Abstract is missing.
- Proof Nets for Unit-free Multiplicative-Additive Linear Logic (Extended abstract)Dominic J. D. Hughes, Rob J. van Glabbeek. 1-10 [doi]
- About Translations of Classical Logic into Polarized Linear LogicOlivier Laurent, Laurent Regnier. 11-20 [doi]
- System ST /beta-reduction and completenessChristophe Raffalli. 21 [doi]
- Types and Programming Languages: The Next GenerationBenjamin C. Pierce. 32 [doi]
- Reasoning about Hierarchical StorageAmal J. Ahmed, Limin Jia, David Walker. 33-44 [doi]
- Formal Verification at IntelJohn Harrison. 45 [doi]
- New Directions in Instantiation-Based Theorem ProvingHarald Ganzinger, Konstantin Korovin. 55-64 [doi]
- Abstract Saturation-Based InferenceNachum Dershowitz, Claude Kirchner. 65-74 [doi]
- Orienting Equalities with the Knuth-Bendix OrderKonstantin Korovin, Andrei Voronkov. 75 [doi]
- Dependent Intersection: A New Way of Defining Records in Type TheoryAlexei Kopylov. 86-95 [doi]
- Structural Subtyping of Non-Recursive Types is DecidableViktor Kuncak, Martin C. Rinard. 96-107 [doi]
- On Program Equivalence in Languages with Ground-Type ReferencesAndrzej S. Murawski. 108 [doi]
- A Proof Theory for Generic Judgments: An extended abstractDale Miller, Alwen Fernanto Tiu. 118-127 [doi]
- Polynomial-time Algorithms from Ineffective ProofsPaulo Oliva. 128-137 [doi]
- The Complexity of Resolution RefinementsJosh Buresh-Oppenheim, Toniann Pitassi. 138 [doi]
- Successor-Invariance in the FiniteBenjamin Rossman. 148 [doi]
- Will Deflation Lead to Depletion? On Non-Monotone Fixed Point InductionsErich Grädel, Stephan Kreutzer. 158 [doi]
- On Automatic Partial OrdersBakhadyr Khoussainov, Sasha Rubin, Frank Stephan. 168-177 [doi]
- Logical Definability and Query Languages over Unranked TreesLeonid Libkin, Frank Neven. 178-187 [doi]
- Query Evaluation on Compressed Trees (Extended Abstract)Markus Frick, Martin Grohe, Christoph Koch. 188 [doi]
- Revisiting Digitization, Robustness, and Decidability for Timed AutomataJoël Ouaknine, James Worrell. 198-207 [doi]
- Satisfiability in Alternating-time Temporal LogicGovert van Drimmelen. 208-217 [doi]
- Strong Bisimilarity on Basic Parallel Processes is PSPACE-completePetr Jancar. 218 [doi]
- Logic in Access ControlMartín Abadi. 228 [doi]
- The Planning Spectrum - One, Two, Three, InfinityMarco Pistore, Moshe Y. Vardi. 234-243 [doi]
- Advice about logical AIJohn McCarthy. 244 [doi]
- A Sound Framework for Untrusted Verification-Condition GeneratorsGeorge C. Necula, Robert R. Schneck. 248-260 [doi]
- An NP Decision Procedure for Protocol Insecurity with XORYannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani. 261-270 [doi]
- Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive orHubert Comon-Lundh, Vitaly Shmatikov. 271 [doi]
- Spectrum Hierarchies and Subdiagonal FunctionsAaron Hunter. 281-290 [doi]
- Spectra of Monadic Second-Order Formulas with One Unary FunctionYuri Gurevich, Saharon Shelah. 291-300 [doi]
- Convergence Law for Random Graphs with Specified Degree SequenceJames F. Lynch. 301 [doi]
- Homomorphism Closed vs. Existential PositiveTomás Feder, Moshe Y. Vardi. 311-320 [doi]
- Tractable conservative Constraint Satisfaction ProblemsAndrei A. Bulatov. 321 [doi]
- Labelled Markov Processes: Stronger and Faster ApproximationsVincent Danos, Josee Desharnais. 341-350 [doi]
- Model checking for probability and time: from theory to practice Marta Z. Kwiatkowska. 351 [doi]
- Model Checking Guarded ProtocolsE. Allen Emerson, Vineet Kahlon. 361-370 [doi]
- Model-checking Trace Event StructuresP. Madhusudan. 371-380 [doi]
- Micro-Macro Stack Systems: A New Frontier of Elementary Decidability for Sequential SystemsNir Piterman, Moshe Y. Vardi. 381 [doi]