21. CSL 2007: Lausanne, Switzerland

Jacques Duparc, Thomas A. Henzinger (Eds.): Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings. Lecture Notes in Computer Science 4646 Springer 2007, ISBN 978-3-540-74914-1 BibTeX

Invited Lectures

Samson Abramsky:
Full Completeness: Interactive and Geometric Characterizations of the Space of Proofs (Abstract). 1-2
Electronic Edition (link) BibTeX
Luca de Alfaro:
The Symbolic Approach to Repeated Games (Abstract). 3
Electronic Edition (link) BibTeX
Arnold Beckmann:
Proofs, Programs and Abstract Complexity. 4-5
Electronic Edition (link) BibTeX
Anuj Dawar:
Model-Checking First-Order Logic: Automata and Locality. 6
Electronic Edition (link) BibTeX
Orna Kupferman:
Tightening the Exchange Rates Between Automata. 7-22
Electronic Edition (link) BibTeX
Thomas Gawlitza, Helmut Seidl:
Precise Relational Invariants Through Strategy Iteration. 23-40
Electronic Edition (link) BibTeX

Logic and Games

Eryk Kopczynski:
Omega-Regular Half-Positional Winning Conditions. 41-53
Electronic Edition (link) BibTeX
Jan Obdrzálek:
Clique-Width and Parity Games. 54-68
Electronic Edition (link) BibTeX
Alexander Rabinovich, Wolfgang Thomas:
Logical Refinements of Church's Problem. 69-83
Electronic Edition (link) BibTeX
Anuj Dawar, David Richerby:
The Power of Counting Logics on Restricted Classes of Finite Structures. 84-98
Electronic Edition (link) BibTeX

Expressiveness

Parosh Aziz Abdulla, Giorgio Delzanno, Laurent Van Begin:
Comparing the Expressive Power of Well-Structured Transition Systems. 99-114
Electronic Edition (link) BibTeX
Olivier Finkel, Dominique Lecomte:
There Exist Some omega -Powers of Any Borel Rank. 115-129
Electronic Edition (link) BibTeX

Games and Trees

Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison:
Satisfiability of a Spatial Logic with Tree Variables. 130-145
Electronic Edition (link) BibTeX
Mikolaj Bojanczyk:
Forest Expressions. 146-160
Electronic Edition (link) BibTeX
Arnaud Carayol, Christof Löding:
MSO on the Infinite Binary Tree: Choice and Order. 161-176
Electronic Edition (link) BibTeX

Logic and Deduction

Hervé Fournier, Danièle Gardy, Antoine Genitrini, Marek Zaionc:
Classical and Intuitionistic Logic Are Asymptotically Identical. 177-193
Electronic Edition (link) BibTeX
Manuel Bodirsky, Hubie Chen:
Qualitative Temporal and Spatial Reasoning Revisited. 194-207
Electronic Edition (link) BibTeX
Guillaume Bagan, Arnaud Durand, Etienne Grandjean:
On Acyclic Conjunctive Queries and Constant Delay Enumeration. 208-222
Electronic Edition (link) BibTeX
Konstantin Korovin, Andrei Voronkov:
Integrating Linear Arithmetic into Superposition Calculus. 223-237
Electronic Edition (link) BibTeX

Lambda Calculus 1

Delia Kesner:
The Theory of Calculi with Explicit Substitutions Revisited. 238-252
Electronic Edition (link) BibTeX
Marco Gaboardi, Simona Ronchi Della Rocca:
A Soft Type Assignment System for lambda -Calculus. 253-267
Electronic Edition (link) BibTeX
Chantal Berline, Giulio Manzonetto, Antonino Salibra:
Lambda Theories of Effective Lambda Models. 268-282
Electronic Edition (link) BibTeX
Søren B. Lassen, Paul Blain Levy:
Typed Normal Form Bisimulation. 283-297
Electronic Edition (link) BibTeX

Lambda Calculus 2

Antonio Bucciarelli, Thomas Ehrhard, Giulio Manzonetto:
Not Enough Points Is Enough. 298-312
Electronic Edition (link) BibTeX
Alexandre Miquel:
Classical Program Extraction in the Calculus of Constructions. 313-327
Electronic Edition (link) BibTeX
Frédéric Blanqui, Jean-Pierre Jouannaud, Pierre-Yves Strub:
Building Decision Procedures in the Calculus of Inductive Constructions. 328-342
Electronic Edition (link) BibTeX

Finite Model Theory

Philipp Weis, Neil Immerman:
Structure Theorem and Strict Alternation Hierarchy for FO² on Words. 343-357
Electronic Edition (link) BibTeX
Stefan Göller:
On the Complexity of Reasoning About Dynamic Policies. 358-373
Electronic Edition (link) BibTeX
Klaus Aehlig, Stephen Cook, Phuong Nguyen:
Relativizing Small Complexity Classes and Their Theories. 374-388
Electronic Edition (link) BibTeX
Yijia Chen, Jörg Flum:
Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping. 389-404
Electronic Edition (link) BibTeX

Linear Logic

Dale Miller, Alexis Saurin:
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic. 405-419
Electronic Edition (link) BibTeX
Naohiko Hoshino:
Linear Realizability. 420-434
Electronic Edition (link) BibTeX
Paulin Jacobé de Naurois, Virgile Mogbil:
Correctness of Multiplicative (and Exponential) Proof Structures is NL -Complete. 435-450
Electronic Edition (link) BibTeX
Chuck Liang, Dale Miller:
Focusing and Polarization in Intuitionistic Logic. 451-465
Electronic Edition (link) BibTeX

Proof Theory

Dale Miller, Vivek Nigam:
Incorporating Tables into Proofs. 466-480
Electronic Edition (link) BibTeX
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, Marisa Navarro, Fernando Orejas:
A Cut-Free and Invariant-Free Sequent Calculus for PLTL. 481-495
Electronic Edition (link) BibTeX
Guillaume Burel:
Unbounded Proof-Length Speed-Up in Deduction Modulo. 496-511
Electronic Edition (link) BibTeX
Klaus Aehlig, Arnold Beckmann:
Propositional Logic for Circuit Classes. 512-526
Electronic Edition (link) BibTeX
Alexander Hertel, Alasdair Urquhart:
Game Characterizations and the PSPACE-Completeness of Tree Resolution Space. 527-541
Electronic Edition (link) BibTeX

Game Semantics

Jean Goubault-Larrecq:
Continuous Previsions. 542-557
Electronic Edition (link) BibTeX
Andrzej S. Murawski:
Bad Variables Under Control. 558-572
Electronic Edition (link) BibTeX
Guy McCusker, David J. Pym:
A Games Model of Bunched Implications. 573-588
Electronic Edition (link) BibTeX
Martin Grohe, Martin Hyland, Johann A. Makowsky, Damian Niwinski:
The Ackermann Award 2007. 589-597
Electronic Edition (link) BibTeX