19. CSL 2005: Oxford, UK

C.-H. Luke Ong (Ed.): Computer Science Logic, 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005, Proceedings. Lecture Notes in Computer Science 3634 Springer 2005, ISBN 3-540-28231-9 BibTeX

Invited Lectures

Maarten Marx:
XML Navigation and Tarski's Relation Algebras. 1-2
Electronic Edition (link) BibTeX
Anatol Slissenko:
Verification in Predicate Logic with Time: Algorithmic Questions. 3-17
Electronic Edition (link) BibTeX
Matthias Baaz:
Note on Formal Analogical Reasoning in the Juridical Context. 18-26
Electronic Edition (link) BibTeX
Ulrich Berger:
An Abstract Strong Normalization Theorem. 27-35
Electronic Edition (link) BibTeX

Semantics and Logics

Matthew Collinson, David J. Pym, Edmund Robinson:
On Bunched Polymorphism. 36-50
Electronic Edition (link) BibTeX
Tom Murphy VII, Karl Crary, Robert Harper:
Distributed Control Flow with Classical Modal Logic. 51-69
Electronic Edition (link) BibTeX
Jirí Adámek:
A Logic of Coequations. 70-86
Electronic Edition (link) BibTeX
Shin-ya Katsumata:
A Semantic Formulation of TT-Lifting and Logical Predicates for Computational Metalanguage. 87-102
Electronic Edition (link) BibTeX

Type Theory and Lambda Calculus

Paula Severi, Fer-Jan de Vries:
Order Structures on Böhm-Like Models. 103-118
Electronic Edition (link) BibTeX
Colin Stirling:
Higher-Order Matching and Games. 119-134
Electronic Edition (link) BibTeX
Frédéric Blanqui:
Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations. 135-150
Electronic Edition (link) BibTeX
Bruno Barras, Benjamin Grégoire:
On the Role of Type Decorations in the Calculus of Inductive Constructions. 151-166
Electronic Edition (link) BibTeX

Linear Logic and Ludics

Pierre-Louis Curien, Claudia Faggian:
L-Nets, Strategies and Proof-Nets. 167-183
Electronic Edition (link) BibTeX
Jean-Marc Andreoli, Gabriele Pulcini, Paul Ruet:
Permutative Logic. 184-199
Electronic Edition (link) BibTeX
Kaustuv Chaudhuri, Frank Pfenning:
Focusing the Inverse Method for Linear Logic. 200-215
Electronic Edition (link) BibTeX
Esfandiar Haghverdi, Philip J. Scott:
Towards a Typed Geometry of Interaction. 216-231
Electronic Edition (link) BibTeX

Constraints

Hubie Chen, Víctor Dalmau:
From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction. 232-247
Electronic Edition (link) BibTeX
Ashish Tiwari:
An Algebraic Approach for the Unsatisfiability of Nonlinear Constraints. 248-262
Electronic Edition (link) BibTeX

Finite Models, Decidability and Complexity

Marcin Mostowski, Konrad Zdanowski:
Coprimality in Finite Models. 263-275
Electronic Edition (link) BibTeX
Michael Benedikt, Luc Segoufin:
Towards a Characterization of Order-Invariant Queries over Tame Structures. 276-291
Electronic Edition (link) BibTeX
Bakhadyr Khoussainov, Sasha Rubin:
Decidability of Term Algebras Extending Partial Algebras. 292-308
Electronic Edition (link) BibTeX
Emanuel Kieronski:
Results on the Guarded Fragment with Equivalence or Transitive Relations. 309-324
Electronic Edition (link) BibTeX
Bruno Courcelle, Christian Delhommé:
The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic. 325-338
Electronic Edition (link) BibTeX
Balder ten Cate, Massimo Franceschet:
On the Complexity of Hybrid Logics with Binders. 339-354
Electronic Edition (link) BibTeX
Julian C. Bradfield, Stephan Kreutzer:
The Complexity of Independence-Friendly Fixpoint Logic. 355-368
Electronic Edition (link) BibTeX
Antonina Kolokolova:
Closure Properties of Weak Systems of Bounded Arithmetic. 369-383
Electronic Edition (link) BibTeX

Verification and Model Checking

Julian C. Bradfield, Jacques Duparc, Sandra Quickert:
Transfinite Extension of the Mu-Calculus. 384-396
Electronic Edition (link) BibTeX
Witold Charatonik, Lilia Georgieva, Patrick Maier:
Bounded Model Checking of Pointer Programs. 397-412
Electronic Edition (link) BibTeX
Carsten Lutz:
PDL with Intersection and Converse Is Decidable. 413-427
Electronic Edition (link) BibTeX
Filip Murlak:
On Deciding Topological Classes of Deterministic Tree Languages. 428-441
Electronic Edition (link) BibTeX

Constructive Reasoning and Computational Mathematics

Branimir Lambov:
Complexity and Intensionality in a Type-1 Framework for Computable Analysis. 442-461
Electronic Edition (link) BibTeX
Vasco Brattka, Matthias Schröder:
Computing with Sequences, Weak Topologies and the Axiom of Choice. 462-476
Electronic Edition (link) BibTeX
Mircea-Dan Hernest:
Light Functional Interpretation. 477-492
Electronic Edition (link) BibTeX
Michael Soltys:
Feasible Proofs of Matrix Properties with Csanky's Algorithm. 493-508
Electronic Edition (link) BibTeX

Implicit Computational Complexity and Rewriting

Steven Perron:
A Propositional Proof System for Log Space. 509-524
Electronic Edition (link) BibTeX
Carsten Schürmann, Jatin Shah:
Identifying Polynomial-Time Recursive Functions. 525-540
Electronic Edition (link) BibTeX
Guillem Godoy, Ashish Tiwari:
Confluence of Shallow Right-Linear Rewrite Systems. 541-556
Electronic Edition (link) BibTeX

Appendices

Erich Grädel, Janos Makowsky, Alexander A. Razborov:
The Ackermann Award 2005. 557-565
Electronic Edition (link) BibTeX
Johann A. Makowsky:
Clemens Lautemann: 1951-2005 An Obituary. 566-566
Electronic Edition (link) BibTeX