some image logo

HOME

SEARCH

CURRENT ISSUE

REGULAR ISSUES

   Volume 1 (2005)

   Volume 2 (2006)

   Volume 3 (2007)

   Volume 4 (2008)

   Volume 5 (2009)

   Volume 6 (2010)

   Volume 7 (2011)

   Volume 8 (2012)

   Volume 9 (2013)

   Volume 10 (2014)

      Issue 1

      Issue 2

      Issue 3

      Issue 4

   Volume 11 (2015)

   Volume 12 (2016)

   Volume 13 (2017)

SPECIAL ISSUES

SURVEY ARTICLES

AUTHORS

ABOUT

SERVICE

LOGIN

FAQ

SUPPORT

CONTACT

VOLUME 10, ISSUE 1


1. The role of logical interpretations in program development
  Manuel A. Martins, Alexandre Madeira and Luis S. Barbosa


2. Monadic second-order definable graph orderings
  Achim Blumensath and Bruno Courcelle


3. About the range property for H
  René David and Karim Nour


4. Linear Temporal Logic for Regular Cost Functions
  Denis Kuperberg


5. Unification modulo a 2-sorted Equational theory for Cipher-Decipher Block Chaining
  Siva Anantharaman, Christopher Bouchard, Paliath Narendran and Michaël Rusinowitch


6. Computational Complexity of Smooth Differential Equations
  Akitoshi Kawamura, Hiroyuki Ota, Carsten Rösnick and Martin Ziegler


7. The Complexity of the First-Order Theory of Ground Tree Rewrite Graphs
  Stefan Göller and Markus Lohrey


8. Separation Property for wB- and wS-regular Languages
  Michał Pawe Skrzypczak


9. Knowledge Spaces and the Completeness of Learning Strategies
  Stefano Berardi and Ugo de'Liguoro


10. Exact and Approximate Determinization of Discounted-Sum Automata
  Udi Boker and Thomas A. Henzinger


11. The Size-Change Termination Principle for Constructor Based Languages
  Pierre Hyvernat


12. Parameterized Synthesis
  Swen Jacobs and Roderick Bloem


13. Markov Decision Processes with Multiple Long-run Average Objectives
  TomᚠBrázdil, Václav Brožek, Krishnendu Chatterjee, Vojtěch Forejt and Antonín Kučera


14. A Proof of Kamp's theorem
  Alexander Rabinovich


15. Universal First-Order Logic is Superfluous for NL, P, NP and coNP
  Nerio Borges and Blai Bonet


16. Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes
  Marco Bernardo, Rocco De Nicola and Michele Loreti


17. Linear usage of state
  Rasmus Ejlers Mřgelberg and Sam Staton


18. Model Checking Lower Bounds for Simple Graphs
  Michael Lampis


19. Modular Complexity Analysis for Term Rewriting
  Harald Zankl and Martin Korp


Creative Commons