23. CSL 2009:
Coimbra,
Portugal
Erich Grädel, Reinhard Kahle (Eds.):
Computer Science Logic, 23rd international Workshop, CSL 2009, 18th Annual Conference of the EACSL, Coimbra, Portugal, September 7-11, 2009. Proceedings.
Lecture Notes in Computer Science 5771 Springer 2009, ISBN 978-3-642-04026-9 
Invited Talks
Special Invited Talk to Commemorate the Centenary of Stephen Cole Kleene
Contributed Papers
- Andreas Abel:
Typed Applicative Structures and Normalization by Evaluation for System Fomega.
40-54
- Beniamino Accattoli, Stefano Guerrini:
Jumping Boxes.
55-70
- Isolde Adler, Mark Weyer:
Tree-Width for First Order Formulae.
71-85
- Rajeev Alur, Pavol Cerný, Scott Weinstein:
Algorithmic Analysis of Array-Accessing Programs.
86-101
- Albert Atserias, Mark Weyer:
Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems.
102-116
- Vince Bárány, Lukasz Kaiser, Alexander Rabinovich:
Cardinality Quantifiers in MLO over Trees.
117-131
- Ulrich Berger:
From Coinductive Proofs to Exact Real Arithmetic.
132-146
- Frédéric Blanqui, Cody Roux:
On the Relation between Sized-Types Based Termination and Semantic Labelling.
147-162
- Agata Ciabattoni, Lutz Straßburger, Kazushige Terui:
Expanding the Realm of Systematic Proof Theory.
163-178
- Corina Cîrstea, Clemens Kupke, Dirk Pattinson:
EXPTIME Tableaux for the Coalgebraic µ-Calculus.
179-193
- J. Robin B. Cockett, Luigi Santocanale:
On the Word Problem for SP{Sigma Pi}-Categories, and the Properties of Two-Way Communication.
194-208
- Mariangiola Dezani-Ciancaglini, Paola Giannini, Simona Ronchi Della Rocca:
Intersection, Universally Quantified, and Reference Types.
209-224
- Jacques Duparc, Alessandro Facchini, Filip Murlak:
Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata.
225-239
- Jeff Egger, Rasmus Ejlers Møgelberg, Alex Simpson:
Enriching an Effect Calculus with Linear Types.
240-254
- Jörg Endrullis, Herman Geuvers, Hans Zantema:
Degrees of Undecidability in Term Rewriting.
255-270
- Marco Gaboardi, Romain Péchoux:
Upper Bounds on Stream I/O Using Semantic Interpretations.
271-286
- Amélie Gheerbrant, Balder ten Cate:
Craig Interpolation for Linear Temporal Languages.
287-301
- Heng Guo, Hanpin Wang, Zhongyuan Xu, Yongzhi Cao:
On Model Checking Boolean BI.
302-316
- Martin Hofmann, Dulma Rodriguez:
Efficient Type-Checking for Amortised Heap-Space Analysis.
317-331
- Matthias Horbach, Christoph Weidenbach:
Deciding the Inductive Validity of FOR ALL THERE EXISTS * Queries.
332-347
- Stephan Kreutzer:
On the Parameterised Intractability of Monadic Second-Order Logic.
348-363
- Dietrich Kuske, Markus Lohrey:
Automatic Structures of Bounded Degree Revisited.
364-378
- James Laird:
Nondeterminism and Observable Sequentiality.
379-393
- Angelo Montanari, Gabriele Puppis, Pietro Sala:
A Decidable Spatial Logic with Cone-Shaped Cardinal Directions.
394-408
- Guillaume Munch-Maccagnoni:
Focalisation and Classical Realisability.
409-423
- Alexander Rabinovich:
Decidable Extensions of Church's Problem.
424-439
- Jan Schwinghammer, Lars Birkedal, Bernhard Reus, Hongseok Yang:
Nested Hoare Triples and Frame Rules for Higher-Order Store.
440-454
- Eijiro Sumii:
A Complete Characterization of Observational Equivalence in Polymorphic lambda-Calculus with General References.
455-469
- Makoto Tatsuta:
Non-Commutative First-Order Sequent Calculus.
470-484
- Anthony Widjaja To:
Model Checking FO(R) over One-Counter Processes and beyond.
485-499
- Paolo Tranquilli:
Confluence of Pure Differential Nets with Promotion.
500-514
- Michael Ummels, Dominik Wojtczak:
Decision Problems for Nash Equilibria in Stochastic Games.
515-529
- Volker Weber:
On the Complexity of Branching-Time Logics.
530-545
- David Turner, Glynn Winskel:
Nominal Domain Theory for Concurrency.
546-560
Appendix
Copyright © Mon Nov 2 20:27:12 2009
by Michael Ley (ley@uni-trier.de)
