13. CSL 1999: Madrid, Spain
Jörg Flum, Mario Rodríguez-Artalejo (Eds.): Computer Science Logic, 13th International Workshop, CSL '99, 8th Annual Conference of the EACSL, Madrid, Spain, September 20-25, 1999, Proceedings. Springer 1999 Lecture Notes in Computer Science ISBN 3-540-66536-6
Invited Papers
- Victor Vianu: Topological Queries in Spatial Databases. 1
- José L. Balcázar: The Consistency Dimension, Compactness, and Query Learning. 2-13
- Martin Grohe: Descriptive and Parameterized Complexity. 14-31
- Peter D. Mosses: Logical Specification of Operational Semantics. 32-49
- Giorgio Delzanno, Javier Esparza, Andreas Podelski: Constraint-Based Analysis of Broadcast Protocols. 50-66
Descriptive Complexity, I
- Daniel Leivant: Applicative Control and Computational Complexity. 82-95
Verification
- Thomas Arts, Jürgen Giesl: Applying Rewriting Techniques to the Verification of Erlang Processes. 96-110
- Jesper B. Møller, Jakob Lichtenberg, Henrik Reif Andersen, Henrik Hulgaard: Difference Decision Diagrams. 111-125
- Martin Fränzle: Analysis of Hybrid Systems: An Ounce of Realism Can Save an Infinity of States. 126-140
Temporal Logic
- Thomas Marthedal Rasmussen: Signed Interval Logic. 157-171
- Volker Diekert, Paul Gastin: An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces. 188-203
Lambda Calculus, Linear Logic
- Eduardo Bonelli: Using Fields and Explicit Substitutions to Implement Objects and Functions in a de Bruijn Setting. 204-219
- Samin S. Ishtiaq, David J. Pym: Kripke Resource Models of a Dependently-Typed, Bunched lambda-Calculus. 235-249
Logic Programming, Modal Logic, Description Logic
- Shigeki Hagihara, Naoki Yonezaki: Resolution Method for Modal Logic with Well-Founded Frames. 277-291
- Stephan Tobies: A NExpTime-Complete Description Logic Strictly Contained in C2. 292-306
Descriptive Complexity, II
- Jerzy Marcinkowski: Directed Reachability: From Ajtai-Fagin to Ehrenfeucht-Fraïssé Games. 338-349
- Julian C. Bradfield: Fixpoint Alternation and the Game Quantifier. 350-361
Logic and Complexity
- Jacobo Torán: Lower Bounds for Space in Resolution. 362-373
- Iain A. Stewart: Program Schemes, Arrays, Lindström Quantifiers and Zero-One Laws. 374-388
- Lev D. Beklemishev: Open Least Element Principle and Bounded Query Computation. 389-404
Lambda Calculus, Type Theory
- Andrew D. Ker, Hanno Nickau, C.-H. Luke Ong: A Universal Innocent Game Model for the Böhm Tree Lambda Theory. 405-419
- Thorsten Altenkirch, Bernhard Reus: Monadic Presentations of Lambda Terms Using Generalized Inductive Types. 453-468
Linear Logic, Mu Calculus, Concurrency
- Luca Roversi: A P-Time Completeness Proof for Light Logics. 469-483
- Paul Gastin, Michael W. Mislove: A Truly Concurrent Semantics for a Simple Parallel Programming Language. 515-529
Specification, Data Refinement
- Jo Erskine Hannay: Specification Refinement with System F. 530-545
Tutorials
- Aart Middeldorp: Term Rewriting. 577
- Douglas J. Howe: Interactive Theorem Proving Using Type Theory. 578
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team