CSL B

41 papers

YearTitle / Authors
2009A Complete Characterization of Observational Equivalence in Polymorphic
Eijiro Sumii
2009A Decidable Spatial Logic with Cone-Shaped Cardinal Directions.
Angelo Montanari, Gabriele Puppis, Pietro Sala
2009Algebra for Tree Languages.
Mikolaj Bojanczyk
2009Algorithmic Analysis of Array-Accessing Programs.
Rajeev Alur, Pavol Cerný, Scott Weinstein
2009Automatic Structures of Bounded Degree Revisited.
Dietrich Kuske, Markus Lohrey
2009Cardinality Quantifiers in MLO over Trees.
Vince Bárány, Lukasz Kaiser, Alexander Rabinovich
2009Computer Science Logic, 23rd international Workshop, CSL 2009, 18th Annual Conference of the EACSL, Coimbra, Portugal, September 7-11, 2009. Proceedings
Erich Grädel, Reinhard Kahle
2009Confluence of Pure Differential Nets with Promotion.
Paolo Tranquilli
2009Craig Interpolation for Linear Temporal Languages.
Amélie Gheerbrant, Balder ten Cate
2009Decidable Extensions of Church's Problem.
Alexander Rabinovich
2009Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems.
Albert Atserias, Mark Weyer
2009Deciding the Inductive Validity of FOR ALL THERE EXISTS
Matthias Horbach, Christoph Weidenbach
2009Decision Problems for Nash Equilibria in Stochastic Games.
Michael Ummels, Dominik Wojtczak
2009Degrees of Undecidability in Term Rewriting.
Jörg Endrullis, Herman Geuvers, Hans Zantema
2009EXPTIME Tableaux for the Coalgebraic
Corina Cîrstea, Clemens Kupke, Dirk Pattinson
2009Efficient Type-Checking for Amortised Heap-Space Analysis.
Martin Hofmann, Dulma Rodriguez
2009Enriching an Effect Calculus with Linear Types.
Jeff Egger, Rasmus Ejlers Møgelberg, Alex Simpson
2009Expanding the Realm of Systematic Proof Theory.
Agata Ciabattoni, Lutz Straßburger, Kazushige Terui
2009Fixed-Point Definability and Polynomial Time.
Martin Grohe
2009Focalisation and Classical Realisability.
Guillaume Munch-Maccagnoni
2009Forcing and Type Theory.
Thierry Coquand
2009From Coinductive Proofs to Exact Real Arithmetic.
Ulrich Berger
2009Functional Interpretations of Intuitionistic Linear Logic.
Gilda Ferreira, Paulo Oliva
2009Intersection, Universally Quantified, and Reference Types.
Mariangiola Dezani-Ciancaglini, Paola Giannini, Simona Ronchi Della Rocca
2009Jumping Boxes.
Beniamino Accattoli, Stefano Guerrini
2009Kleene's Amazing Second Recursion Theorem.
Yiannis N. Moschovakis
2009Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata.
Jacques Duparc, Alessandro Facchini, Filip Murlak
2009Model Checking FO(R) over One-Counter Processes and beyond.
Anthony Widjaja To
2009Nested Hoare Triples and Frame Rules for Higher-Order Store.
Jan Schwinghammer, Lars Birkedal, Bernhard Reus, Hongseok Yang
2009Nominal Domain Theory for Concurrency.
David Turner, Glynn Winskel
2009Non-Commutative First-Order Sequent Calculus.
Makoto Tatsuta
2009Nondeterminism and Observable Sequentiality.
James Laird
2009On Model Checking Boolean BI.
Heng Guo, Hanpin Wang, Zhongyuan Xu, Yongzhi Cao
2009On the Complexity of Branching-Time Logics.
Volker Weber
2009On the Parameterised Intractability of Monadic Second-Order Logic.
Stephan Kreutzer
2009On the Relation between Sized-Types Based Termination and Semantic Labelling.
Frédéric Blanqui, Cody Roux
2009On the Word Problem for SP{Sigma Pi}-Categories, and the Properties of Two-Way Communication.
J. Robin B. Cockett, Luigi Santocanale
2009The Ackermann Award 2009.
Johann A. Makowsky, Alexander A. Razborov
2009Tree-Width for First Order Formulae.
Isolde Adler, Mark Weyer
2009Typed Applicative Structures and Normalization by Evaluation for System F
Andreas Abel
2009Upper Bounds on Stream I/O Using Semantic Interpretations.
Marco Gaboardi, Romain Péchoux