Computer Science Logic: 15th International Workshop, CSL 2001. 10th Annual Conference of the EACSL, Paris, France, September 10-13, 2001 Proceedings (Lecture Notes in Computer Science (2142))

The Annual Conference of the European Association for Computer Science Logic, CSL 2001, was held in Paris, Palais de la Mutualit ́ e, on September 10-13, 2001. This was the 15th in a series of annual meetings, originally intended as International Workshops on Computer Science Logic, and the 10th to be held as the Annual Conference of the EACSL. The conference was organized by La- ratoire Sp ́ eci?cation et V ́ eri?cation (CNRS & ENS Cachan). The CSL 2001 program committee selected 39 of 91 submitted papers for presentation at the conference and publication in this proceedings volume. The submittedpapersoriginatedfrom26di?erentcountries.Eachpaperwasrefereed by at least three reviewers. In addition to the contributed papers, the scienti?c program of CSL 2001 - cluded three invited talks (Jean-Yves Girard, Peter O'Hearn, and Jan Van den Bussche). This volume includes the papers provided by the invited speakers as well as the selected contributed papers. The topics of the papers include: linear logic, descriptive complexity, semantics, higher-order programs, modal logics, veri?cation, automata, ?-calculus, induction, equational calculus, and constr- tive theory of types. I am most grateful to the members of the program committee and all the referees for their thorough work. I am also particularly indebted to Fran, cois Laroussinie, helped by Patricia Bouyer, Nicolas Markey, and Philippe Schn- belen, for the successful organization of this event. Special thanks to Emmanuel Fleury for the design of the beautiful "Notre-Dame de Paris" poster. Computer Science Logic: 15th International Workshop, CSL 2001 10th Annual Conference of the EACSL Paris, France, September 10–13, 2001, Proceedings Author: Laurent Fribourg Published by Springer Berlin Heidelberg ISBN: 978-3-540-42554-0 DOI: 10.1007/3-540-44802-0 Table of Contents: Local Reasoning about Programs that Alter Data Structures Applications of Alfred Tarski’s Ideas in Database Theory Locus Solum: From the Rules of Logic to the Logic of Rules The Expressive Power of Horn Monadic Linear Logic Non-commutativity and MELL in the Calculus of Structures Quadratic Correctness Criterion for Non-commutative Logic Capture Complexity by Partition An Existential Locality Theorem Actual Arithmetic and Feasibility The Natural Order-Generic Collapse for ω-Representable Databases over the Rational and the Real Ordered Group An Algebraic Foundation for Higraphs Semantic Characterisations of Second-Order Computability over the Real Numbers An Abstract Look at Realizability The Anatomy of Innocence An Improved Extensionality Criterion for Higher-Order Logic Programs A Logic for Abstract State Machines Constrained Hyper Tableaux Modal Logic and the Two-Variable Fragment A Logic for Approximate First-Order Reasoning Inflationary Fixed Points in Modal Logic

This book constitutes the refereed proceedings of the 15th International Workshop on Computer Science Logic, CSL 2001, held as the 10th Annual Conerence of the EACSL in Paris, France in September 2001.
The 39 revised full papers presented together with two invited papers were carefully reviewed and selected from 91 submissions. The papers are organized in topical sections on linear logic, descriptive complexity, semantics, higher-order programs, model logics, verification, automata, lambda calculus, induction, equational calculus, and constructive theory of types.