Abstract is missing.
- Little Engines of ProofNatarajan Shankar. 3 [doi]
- Automatic DecidabilityChristopher Lynch, Barbara Morawska. 7 [doi]
- Tree-Like Counterexamples in Model CheckingEdmund M. Clarke, Somesh Jha, Yuan Lu, Helmut Veith. 19-29 [doi]
- Probabilistic Abstraction for Model Checking: An Approach Based on Property TestingSophie Laplante, Richard Lassaigne, Frédéric Magniez, Sylvain Peyronnet, Michel de Rougemont. 30-39 [doi]
- Semantic Minimization of 3-Valued Propositional FormulaeThomas W. Reps, Alexey Loginov, Shmuel Sagiv. 40 [doi]
- Separation Logic: A Logic for Shared Mutable Data StructuresJohn C. Reynolds. 55-74 [doi]
- A Stratified Semantics of General References A Stratified Semantics of General ReferencesAmal J. Ahmed, Andrew W. Appel, Roberto Virga. 75 [doi]
- A Syntactic Approach to Foundational Proof-Carrying CodeNadeem Abdul Hamid, Zhong Shao, Valery Trifonov, Stefan Monnier, Zhaozhong Ni. 89-100 [doi]
- A Fully Abstract May Testing Semantics for Concurrent ObjectsAlan Jeffrey, Julian Rathke. 101-112 [doi]
- Semantics and Logic of Object CalculiBernhard Reus, Thomas Streicher. 113 [doi]
- Efficient Type Inference for Record Concatenation and SubtypingJens Palsberg, Tian Zhao. 125-136 [doi]
- Semantic SubtypingAlain Frisch, Giuseppe Castagna, Véronique Benzaken. 137-146 [doi]
- Remarks on Isomorphisms in Typed Lambda Calculi with Empty and Sum TypesMarcelo P. Fiore, Roberto Di Cosmo, Vincent Balat. 147 [doi]
- On The Lambda Y CalculusRichard Statman. 159-166 [doi]
- Dense Real-Time GamesMarco Faella, Salvatore La Torre, Aniello Murano. 167-176 [doi]
- Computing Reachability Relations in Timed AutomataCatalin Dima. 177 [doi]
- Monadic Queries over Tree-Structured DataGeorg Gottlob, Christoph Koch. 189-202 [doi]
- Tree Extension Algebras: Logics, Automata, and Query LanguagesMichael Benedikt, Leonid Libkin. 203 [doi]
- The Complexity of First-Order and Monadic Second-Order Logic RevisitedMarkus Frick, Martin Grohe. 215-224 [doi]
- The 0-1 law fails for frame satisfiability of propositional modal logicJean-Marie Le Bars. 225-234 [doi]
- Some Results on Automatic StructuresHajime Ishihara, Bakhadyr Khoussainov, Sasha Rubin. 235 [doi]
- Observational Equivalence of 3rd-Order Idealized Algol is DecidableC.-H. Luke Ong. 245-256 [doi]
- Games on Graphs and Sequentially Realizable FunctionalsMartin Hyland, Andrea Schalk. 257-264 [doi]
- Polarized GamesOlivier Laurent. 265 [doi]
- Domain Theory and Differential Calculus (Functions of one Variable)Abbas Edalat, André Lieutier. 277-286 [doi]
- Computational Adequacy for Recursive Types in Models of Intuitionistic Set TheoryAlex K. Simpson. 287-298 [doi]
- The Powerdomain of Indexed ValuationsDaniele Varacca. 299 [doi]
- Complexity Classes, Propositional Proof Systems, and Formal TheoriesStephen A. Cook. 311 [doi]
- Complete Problems for Dynamic Complexity ClassesWilliam Hesse, Neil Immerman. 313 [doi]
- Unsatisfiable Random Formulas Are Hard to CertifyAlbert Atserias. 325-334 [doi]
- The Proof Complexity of Linear AlgebraMichael Soltys, Stephen A. Cook. 335-344 [doi]
- Calibrating Computational Feasibility by Abstraction RankDaniel Leivant. 345 [doi]
- Description Logics: Foundations for Class-based Knowledge RepresentationDiego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini. 359-370 [doi]
- Modal and Guarded Characterisation Theorems over Finite Transition SystemsMartin Otto. 371 [doi]
- Temporal Logic with Forgettable PastFrançois Laroussinie, Nicolas Markey, Ph. Schnoebelen. 383-392 [doi]
- Decidable and Undecidable Fragments of First-Order Branching Temporal LogicsIan M. Hodkinson, Frank Wolter, Michael Zakharyaschev. 393-402 [doi]
- Expressive Equivalence of Least and Inflationary Fixed-Point LogicStephan Kreutzer. 403 [doi]
- The Metric Analogue of Weak Bisimulation for Probabilistic ProcessesJosee Desharnais, Radha Jagadeesan, Vineet Gupta, Prakash Panangaden. 413-422 [doi]
- Separability, Expressiveness, and Decidability in the Ambient LogicDaniel Hirschkoff, Étienne Lozes, Davide Sangiorgi. 423-432 [doi]
- Linearity in Process LanguagesMikkel Nygaard, Glynn Winskel. 433 [doi]
- Deciding Confluence of Certain Term Rewriting Systems in Polynomial TimeAshish Tiwari. 447 [doi]