Logical Methods in Computer Science, Volume 3

Volume 3, Number 1, 2007

• Parosh Aziz Abdulla, Pritha Mahata, Richard Mayr:
  Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness.
  
• Manuel Bodirsky:
  Cores of Countably Categorical Structures.
  
• Yoram Hirshfeld, Alexander Rabinovich:
  Expressiveness of Metric modalities for continuous time.
  
• Pascal Tesson, Denis Thérien:
  Logic Meets Algebra: the Case of Regular Languages.
  
• Corina S. Pasareanu, Radek Pelánek, Willem Visser:
  Predicate Abstraction with Under-Approximation Refinement.
  
• Jörg Hoffmann, Carla P. Gomes, Bart Selman:
  Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning.
  
• Véronique Bruyère, Jean-François Raskin:
  Real-Time Model-Checking: Parameters everywhere.
  
• Joël Ouaknine, James Worrell:
  On the decidability and complexity of Metric Temporal Logic over finite words.
  
• Norman Danner, James S. Royer:
  Adventures in time and space.
  

Volume 3, Number 2, 2007

• Shuvendu K. Lahiri, Thomas Ball, Byron Cook:
  Predicate Abstraction via Symbolic Decision Procedures.
  
• Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan:
  Automatic Structures: Richness and Limitations.
  
• Joost Engelfriet, Hendrik Jan Hoogeboom:
  Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure.
  
• Thomas Colcombet, Christof Löding:
  Transforming structures by set interpretations.
  
• James Laird:
  Bistable Biorders: A Sequential Domain Theory.
  
• Emil W. Kiss, Matthew Valeriote:
  On tractability and congruence distributivity.
  
• Roland Axelsson, Martin Lange, Rafal Somla:
  The Complexity of Model Checking Higher-Order Fixpoint Logic.
  

Volume 3, Number 3, 2007

• Klaus Aehlig:
  A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata.
  
• Véronique Cortier, Michaël Rusinowitch, Eugen Zalinescu:
  Relating two standard notions of secrecy.
  
• Dimitar P. Guelev:
  Probabilistic Interval Temporal Logic and Duration Calculus with Infinite Intervals: Complete Proof Systems.
  
• Jean-François Raskin, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger:
  Algorithms for Omega-Regular Games with Imperfect Information.
  
• Nir Piterman:
  From Nondeterministic Büchi and Streett Automata to Deterministic Parity Automata.
  
• Wojciech Moczydlowski:
  A Normalizing Intuitionistic Set Theory with Inaccessible Sets.
  
• Vladimir Sazonov:
  Inductive Definition and Domain Theoretic Properties of Fully Abstract Models for PCF and PCF+.
  

Volume 3, Number 4, 2007

• Ranjit Jhala, Kenneth L. McMillan:
  Interpolant-Based Transition Relation Approximation.
  
• Morten Heine Sørensen:
  A Note on Shortest Developments.
  
• Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman:
  Interactive Small-Step Algorithms I: Axiomatization.
  
• Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman:
  Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem.
  
• Stefan Wöhrle, Wolfgang Thomas:
  Model Checking Synchronized Products of Infinite Transition Systems.
  
• Benoit Larose, Cynthia Loten, Claude Tardif:
  A Characterisation of First-Order Constraint Satisfaction Problems.
  
• Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr:
  Decisive Markov Chains.
  
• Dexter Kozen:
  Coinductive Proof Principles for Stochastic Processes.
  
• Alexander Rabinovich:
  The Church Synthesis Problem with Parameters.
  
• Vincent Atassi, Patrick Baillot, Kazushige Terui:
  Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic.
  
• Ichiro Hasuo, Bart Jacobs, Ana Sokolova:
  Generic Trace Semantics via Coinduction.
  
• Thierry Coquand, Arnaud Spiwack:
  A proof of strong normalisation using domain theory.