some image logo

HOME

SEARCH

CURRENT ISSUE

REGULAR ISSUES

   Volume 1 (2005)

   Volume 2 (2006)

   Volume 3 (2007)

   Volume 4 (2008)

      Issue 1

      Issue 2

      Issue 3

      Issue 4

   Volume 5 (2009)

   Volume 6 (2010)

   Volume 7 (2011)

   Volume 8 (2012)

   Volume 9 (2013)

   Volume 10 (2014)

   Volume 11 (2015)

   Volume 12 (2016)

SPECIAL ISSUES

SURVEY ARTICLES

AUTHORS

ABOUT

SERVICE

LOGIN

FAQ

SUPPORT

CONTACT

VOLUME 4, ISSUE 4


1. Interpolation in local theory extensions
  Viorica Sofronie-Stokkermans


2. Logical Reasoning for Higher-Order Functions with Local State
  Nobuko Yoshida, Kohei Honda and Martin Berger


3. Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets
  Paolo Baldan, Andrea Corradini, Hartmut Ehrig, Reiko Heckel and Barbara König


4. Characterising Testing Preorders for Finite Probabilistic Processes
  Yuxin Deng, Robert J. van Glabbeek, Matthew Hennessy and Carroll C. Morgan


5. Light Logics and the Call-by-Value Lambda Calculus
  Paolo Coppola, Ugo Dal Lago and Simona Ronchi Della Rocca


6. Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
  Lijun Zhang, Holger Hermanns, Friedrich Eisenbrand and David N. Jansen


7. Recursive Concurrent Stochastic Games
  Kousha Etessami and Mihalis Yannakakis


8. Multi-Objective Model Checking of Markov Decision Processes
  Kousha Etessami, Marta Kwiatkowska, Moshe Y. Vardi and Mihalis Yannakakis


9. Compactly accessible categories and quantum key distribution
  Chris Heunen


10. Coalgebraic Automata Theory: Basic Results
  Clemens Kupke and Yde Venema


11. First-Order and Temporal Logics for Nested Words
  Rajeev Alur, Marcelo Arenas, Pablo Barcelo, Kousha Etessami, Neil Immerman and Leonid Libkin


12. A Rational Deconstruction of Landin's SECD Machine with the J Operator
  Olivier Danvy and Kevin Millikin


13. Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning
  Samuel R. Buss, Jan Hoffmann and Jan Johannsen


14. Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
  Matthew Hague and Luke Ong


15. The Wadge Hierarchy of Deterministic Tree Languages
  Filip Murlak


16. On the Expressive Power of 2-Stack Visibly Pushdown Automata
  Benedikt Bollig


17. Bootstrapping Inductive and Coinductive Types in HasCASL
  Lutz Schröder


Creative Commons