20. CSL 2006:
Szeged, Hungary
Zoltán Ésik (Ed.):
Computer Science Logic, 20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25-29, 2006, Proceedings.
Lecture Notes in Computer Science 4207 Springer 2006, ISBN 3-540-45458-6 
Invited Presentations
- Paul-André Melliès:
Functorial Boxes in String Diagrams.
1-30
- C.-H. Luke Ong:
Some Results on a Game-Semantic Approach to Verifying Finitely-Presentable Infinite Structures (Extended Abstract).
31-40
- Luc Segoufin:
Automata and Logics for Words and Trees over an Infinite Alphabet.
41-57
- Miroslaw Truszczynski:
Nonmonotonic Logics and Their Algebraic Foundations.
58-71
Contributions
- Andreas Abel:
Semi-continuous Sized Types and Termination.
72-88
- Jirí Srba:
Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation.
89-103
- Klaus Aehlig:
A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata.
104-118
- Sandra Alves, Maribel Fernández, Mário Florido, Ian Mackie:
The Power of Linear Functions.
119-134
- Sergei N. Artëmov, Roman Kuznets:
Logical Omniscience Via Proof Complexity.
135-149
- Vincent Atassi, Patrick Baillot, Kazushige Terui:
Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic.
150-166
- Guillaume Bagan:
MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay.
167-181
- Nick Benton:
Abstracting Allocation.
182-196
- Manuel Bodirsky, Hubie Chen:
Collapsibility in Infinite-Domain Quantified Constraint Satisfaction.
197-211
- Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem:
Towards an Implicit Characterization of NCk.
212-224
- Arnaud Carayol, Christophe Morvan:
On Rational Trees.
225-239
- Rohit Chadha, Paulo Mateus, Amílcar Sernadas:
Reasoning About States of Probabilistic Sequential Programs.
240-255
- Krishnendu Chatterjee:
Concurrent Games with Tail Objectives.
256-270
- Krishnendu Chatterjee:
Nash Equilibrium for Upward-Closed Objectives.
271-286
- Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin:
Algorithms for Omega-Regular Games with Imperfect Information, .
287-302
- Véronique Cortier, Michaël Rusinowitch, Eugen Zalinescu:
Relating Two Standard Notions of Secrecy.
303-318
- Paolo Di Giamberardino, Claudia Faggian:
Jump from Parallel to Sequential Proofs: Multiplicatives.
319-333
- Arnaud Durand, Frédéric Olive:
First-Order Queries over One Unary Function.
334-348
- Stefan Göller, Markus Lohrey:
Infinite State Model-Checking of Propositional Dynamic Logics.
349-364
- Will Harwood, Faron Moller, Anton Setzer:
Weak Bisimulation Approximants.
365-379
- Lauri Hella, Jose Maria Turull Torres:
Complete Problems for Higher Order Logics.
380-394
- Thomas A. Henzinger, Nir Piterman:
Solving Games Without Determinization.
395-410
- Lukasz Kaiser:
Game Quantification on Automatic Structures and Hierarchical Model Checking Games.
411-425
- Clemens Lautemann, Pascal Tesson, Denis Thérien:
An Algebraic Point of View on the Crane Beach Property.
426-440
- Stéphane Lengrand, Roy Dyckhoff, James McKinna:
A Sequent Calculus for Type Theory.
441-455
- Tobias Löw, Thomas Streicher:
Universality Results for Models in Locally Boolean Domains.
456-470
- Florent R. Madelaine:
Universal Structures and the Logic of Forbidden Patterns.
471-485
- Jerzy Marcinkowski:
On the Expressive Power of Graph Logic.
486-500
- Ursula Martin, Erik A. Mathiesen, Paulo Oliva:
Hoare Logic in the Abstract.
501-515
- Wojciech Moczydlowski:
Normalization of IZF with Replacement.
516-530
- Michele Pagani:
Acyclicity and Coherence in Multiplicative Exponential Linear Logic.
531-545
- Alexander Moshe Rabinovich:
Church Synthesis Problem with Parameters.
546-561
- Alexander Moshe Rabinovich, Wolfgang Thomas:
Decidable Theories of the Ordering of Natural Numbers with Unary Predicates.
562-574
- Bernhard Reus, Jan Schwinghammer:
Separation Logic for Higher-Order Store.
575-590
- Sven Schewe, Bernd Finkbeiner:
Satisfiability and Finite Model Property for the Alternating-Time mu-Calculus.
591-605
- Ulrich Schöpp:
Space-Efficient Computation by Interaction.
606-621
Appendix
Last update Fri May 24 02:01:52 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
