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)

SPECIAL ISSUES

SURVEY ARTICLES

AUTHORS

ABOUT

SERVICE

LOGIN

FAQ

SUPPORT

CONTACT

VOLUME 10, ISSUE 4


1. Connection Matrices and the Definability of Graph Parameters
  Tomer Kotek and Johann A. Makowsky


2. Full abstraction for fair testing in CCS (expanded version)
  Tom Hirschowitz


3. On the strictness of the quantifier structure hierarchy in first-order logic
  Yuguo He


4. The Power of Priority Channel Systems
  Christoph Haase, Sylvain Schmitz and Philippe Schnoebelen


5. Decidability Problems for Actor Systems
  Frank De Boer, Mahdi Jaghoori, Cosimo Laneve and Gianluigi Zavattaro


6. Stochastic Timed Automata
  Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Quentin Menet, Christel Baier, Marcus Groesser and Marcin Jurdzinski


7. Computing a Solution of Feigenbaum's Functional Equation in Polynomial Time
  Peter Hertling and Christoph Spandl


8. Call-by-value, call-by-name and the vectorial behaviour of the algebraic λ-calculus
  Ali Assaf, Alejandro Díaz-Caro, Simon Perdrix, Christine Tasson and Benoît Valiron


9. An Effect System for Algebraic Effects and Handlers
  Andrej Bauer and Matija Pretnar


10. On the Relation of Interaction Semantics to Continuations and Defunctionalization
  Ulrich Schöpp


11. Cost Preserving Bisimulations for Probabilistic Automata
  Andrea Turrini and Holger Hermanns


12. Algorithmic randomness for Doob's martingale convergence theorem in continuous time
  Bjørn Kjos-Hanssen, Paul Kim Long V. Nguyen and Jason Rute


13. State of Büchi Complementation
  Ming-Hsien Tsai, Seth Fogarty, Moshe Y. Vardi and Yih-Kuen Tsay


14. Beyond Q-Resolution and Prenex Form: A Proof System for Quantified Constraint Satisfaction
  Hubie Chen


15. Sub-computable Boundedness Randomness
  Sam Buss, Douglas Cenzer and Jeffrey B. Remmel


16. Bounded variation and the strength of Helly's selection theorem
  Alexander P. Kreuzer


17. Quantified CTL: Expressiveness and Complexity
  François Laroussinie and Nicolas Markey


18. Global semantic typing for inductive and coinductive computing
  Daniel M. Leivant


19. A Robust Class of Data Languages and an Application to Learning
  Benedikt Bollig, Peter Habermehl, Martin Leucker and Benjamin Monmege


20. Globally Governed Session Semantics
  Dimitrios Kouzapas and Nobuko Yoshida


21. Stochastic Parity Games on Lossy Channel Systems
  Parosh Aziz Abdulla, Lorenzo Clemente, Richard Mayr and Sven Sandberg


Creative Commons