Abstract is missing.
- Probabilistic Polynominal-Time Process Calculus and Security Protocol AnalysisJohn C. Mitchell, Ajith Ramanathan, Andre Scedrov, Vanessa Teague. 3-8
- Definitions by Rewriting in the Calculus of ConstructionsFrédéric Blanqui. 9-18
- Deconstructing ShostakHarald Rueß, Natarajan Shankar. 19-28
- A Decision Procedure for an Extensional Theory of ArraysAaron Stump, Clark W. Barrett, David L. Dill, Jeremy R. Levitt. 29-37
- On Ordering Constraints for Deduction with Built-In Abelian Semigroups, Monoids and GroupsGuillem Godoy, Robert Nieuwenhuis. 38-50
- Successive Approximation of Abstract Transition RelationsSatyaki Das, David L. Dill. 51-60
- A Bound on Attacks on Payment ProtocolsScott D. Stoller. 61-70
- A Dichotomy in the Complexity of Propositional CircumscriptionLefteris M. Kirousis, Phokion G. Kolaitis. 71-80
- Relating Semantic and Proof-Theoretic Concepts for Polynominal Time Decidability of Uniform Word ProblemsHarald Ganzinger. 81-92
- Semantics of Name and Value PassingMarcelo P. Fiore, Daniele Turi. 93-104
- A Fully Abstract Game Semantics of Local ExceptionsJames Laird. 105-114
- A Universal Characterization of the Closed Euclidean IntervalMartín Hötzel Escardó, Alex K. Simpson. 115-128
- Logician in the Land of OS: Abstract State Machines in MicrosoftYuri Gurevich. 129-138
- Eliminating Definitions and Skolem Functions in First-Order LogicJeremy Avigad. 139-146
- On the Decision Problem for the Guarded Fragment with TransitivityWieslaw Szwast, Lidia Tendera. 147-156
- The Hierarchy inside Closed Monadic Sigma::1:: Collapses on the Infinite Binary TreeAndré Arnold, Giacomo Lenzi, Jerzy Marcinkowski. 157-166
- On Definability of Order in Logic with ChoiceTaneli Huuskonen, Tapani Hyttinen. 167-176
- A Second-Order System for Polytime Reasoning Using Graedel s TheoremStephen A. Cook, Antonina Kolokolova. 177-186
- The Crane Beach ConjectureDavid A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thérien. 187-196
- An n! Lower Bound on Formula SizeMicah Adler, Neil Immerman. 197
- Light Affine Calculus and Polytime Strong NormalizationKazushige Terui. 209-220
- Intensionality, Extensionality, and Proof Irrelevance in Modal Type TheoryFrank Pfenning. 221-230
- Foundational Proof-Carrying CodeAndrew W. Appel. 247-256
- Intuitionistic Linear Logic and Partial CorrectnessDexter Kozen, Jerzy Tiuryn. 259-268
- Perturbed Turing Machines and Hybrid SystemsEugene Asarin, Ahmed Bouajjani. 269-278
- From Verification to Control: Dynamic Programs for Omega-Regular ObjectivesLuca de Alfaro, Thomas A. Henzinger, Rupak Majumdar. 279-290
- Deterministic Generators and Games for LTL FragmentsRajeev Alur, Salvatore La Torre. 291-302
- Normalization by Evaluation for Typed Lambda Calculus with CoproductsThorsten Altenkirch, Peter Dybjer, Martin Hofmann, Philip J. Scott. 303-310
- Strong Normalisation in the pi-CalculusNobuko Yoshida, Martin Berger, Kohei Honda. 311-322
- A Symbolic Labelled Transition System for Coinductive Subtyping of ::::F::µ<:::::: TypesAlan Jeffrey. 323-333
- A Continuum of Theories of Lambda Calculus without SemanticsAntonino Salibra. 334-346
- Relating Levels of the Mu-Calculus Hierarchy and Levels of the Monadic HierarchyDavid Janin, Giacomo Lenzi. 347-356
- Focus Games for Satisfiability and Completeness of Temporal LogicMartin Lange, Colin Stirling. 357-365
- Safety and Liveness in Branching TimePanagiotis Manolios, Richard J. Trefler. 366
- Semistructured Data: from Practice to TheorySerge Abiteboul. 379
- Synthesizing Distributed SystemsOrna Kupferman, Moshe Y. Vardi. 389-398
- Permutation Rewriting and Algorithmic VerificationAhmed Bouajjani, Anca Muscholl, Tayssir Touili. 399-408
- Temporal Logic Query CheckingGlenn Bruns, Patrice Godefroid. 409-417
- Typechecking XML Views of Relational DatabasesNoga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu. 421-430
- A Model-Theoretic Approach to Regular String RelationsMichael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin. 431