Abstract is missing.
- Model Checking Synchronized Products of Infinite Transition SystemsStefan Wöhrle, Wolfgang Thomas. 2-11 [doi]
- Model Checking Probabilistic Pushdown AutomataJavier Esparza, Antonín Kucera, Richard Mayr. 12-21 [doi]
- Spi Calculus Translated to ?--Calculus Preserving May-TestsMichael Baldamus, Joachim Parrow, Björn Victor. 22-31 [doi]
- Transition InvariantsAndreas Podelski, Andrey Rybalchenko. 32-41 [doi]
- Automatic Structures: Richness and LimitationsBakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan. 44-53 [doi]
- On the Language Inclusion Problem for Timed Automata: Closing a Decidability GapJoël Ouaknine, James Worrell. 54-63 [doi]
- Vector Addition Tree AutomataPhilippe de Groote, Bruno Guillaume, Sylvain Salvati. 64-73 [doi]
- Testing, Optimizaton, and GamesMihalis Yannakakis. 78-88 [doi]
- Proving Termination Assertions in Dynamic LogicsDaniel Leivant. 89-98 [doi]
- Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution BoundsSanjit A. Seshia, Randal E. Bryant. 100-109 [doi]
- On the Automata Size for Presburger ArithmeticFelix Klaedtke. 110-119 [doi]
- From Automata to Formulas: Convex Integer PolyhedraLouis Latour. 120-129 [doi]
- Feasible Proofs and Computations: Partnership and FusionAlexander A. Razborov. 134-138 [doi]
- A Sequent Calculus for Nominal LogicMurdoch Gabbay, James Cheney. 139-148 [doi]
- Nominal Games and Full Abstraction for the Nu-CalculusSamson Abramsky, Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong, Ian D. B. Stark. 150-159 [doi]
- Games with Secure EquilibriaKrishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski. 160-169 [doi]
- Three-Valued Abstractions of Games: Uncertainty, but with PrecisionLuca de Alfaro, Patrice Godefroid, Radha Jagadeesan. 170-179 [doi]
- Proof Nets and Boolean CircuitsKazushige Terui. 182-191 [doi]
- An Arithmetical Hierarchy of the Law of Excluded Middle and Related PrinciplesYohji Akama, Stefano Berardi, Susumu Hayashi, Ulrich Kohlenbach. 192-201 [doi]
- The Omega Rule is II_2^0-Hard in the lambda beta -CalculusBenedetto Intrigila, Richard Statman. 202-210 [doi]
- On the Geometry of Interaction for Classical LogicCarsten Führmann, David J. Pym. 211-220 [doi]
- Beyond Image-Finiteness: Labelled Transition Systems as a Stone SpaceMichael Huth. 222-231 [doi]
- First-Order Definable Retraction Problems for Posets and Reflexive GraphVíctor Dalmau, Andrei A. Krokhin, Benoit Larose. 232-241 [doi]
- Parametric LimitsBrian Dunphy, Uday S. Reddy. 242-251 [doi]
- Self-Adjusting ComputationRobert Harper. 254-255 [doi]
- The Strength of Replacement in Weak ArithmeticStephen A. Cook, Neil Thapen. 256-264 [doi]
- Light Types for Polynomial Time Computation in Lambda-CalculusPatrick Baillot, Kazushige Terui. 266-275 [doi]
- The Sensible Graph Theories of Lambda CalculusAntonio Bucciarelli, Antonino Salibra. 276-285 [doi]
- A Symmetric Modal Lambda Calculus for Distributed ComputingTom Murphy VII, Karl Crary, Robert Harper, Frank Pfenning. 286-295 [doi]
- Bisimulation: From The Origins to TodayDavide Sangiorgi. 298-302 [doi]
- Congruence for SOS with DataMohammad Reza Mousavi, Michel A. Reniers, Jan Friso Groote. 303-312 [doi]
- Towards Imperative Modules: Reasoning about Invariants and Sharing of Mutable StateDavid A. Naumann, Michael Barnett. 313-323 [doi]
- A Computational Interpretation of Open InductionUlrich Berger. 326 [doi]
- The Existence of Finite Abstractions for Branching Time Model CheckingDennis Dams, Kedar S. Namjoshi. 335-344 [doi]
- Multi-Clock Timed NetworksParosh Aziz Abdulla, Johann Deneux, Pritha Mahata. 345-354 [doi]
- A Landscape with Games in the BackgrounIgor Walukiewicz. 356-366 [doi]
- An Algebraic Approach to the Complexity of Propositional CircumscriptionGustav Nordh, Peter Jonsson. 367-376 [doi]
- VTC :::circ:::: A Second-Order Theory for TC:::circ:::Phuong Nguyen, Stephen A. Cook. 378-387 [doi]
- Model-Checking Problems as a Basis for Parameterized IntractabilityJörg Flum, Martin Grohe. 388-397 [doi]
- A Second-Order Theory for NLStephen A. Cook, Antonina Kolokolova. 398-407 [doi]
- High-Level Methods for Quantum Computation and InformationSamson Abramsky. 410-414 [doi]
- A Categorical Semantics of Quantum ProtocolsSamson Abramsky, Bob Coecke. 415-425 [doi]
- Semantics of a Sequential Language for Exact Real-Number ComputationJ. Raymundo Marcial-Romero, Martín Hötzel Escardó. 426-435 [doi]
- The Succinctness of First-Order Logic on Linear OrdersMartin Grohe, Nicole Schweikardt. 438-447 [doi]
- A Graph of a Relational Structure and Constraint Satisfaction ProblemsAndrei A. Bulatov. 448-457 [doi]
- Equicardinality on Linear OrdersKerkko Luosto. 458-465 [doi]