some image logo





   Volume 1 (2005)

   Volume 2 (2006)

   Volume 3 (2007)

   Volume 4 (2008)

   Volume 5 (2009)

   Volume 6 (2010)

   Volume 7 (2011)

   Volume 8 (2012)

      Issue 1

      Issue 2

      Issue 3

      Issue 4

   Volume 9 (2013)

   Volume 10 (2014)

   Volume 11 (2015)

   Volume 12 (2016)

   Volume 13 (2017)











1. Coupling policy iteration with semi-definite relaxation to compute accurate numerical invariants in static analysis
  Assalé Adjé, Stéphane Gaubert and Eric Goubault

2. Formal proofs in real algebraic geometry: from ordered fields to quantifier elimination
  Assia Mahboubi and Cyril Cohen

3. On completeness of reducibility candidates as a semantics of strong normalization
  Denis Cousineau

4. A type reduction theory for systems with replicated components
  Tomasz Mazur and Gavin Lowe

5. An extension of data automata that captures XPath
  Mikołaj Bojańczyk and Sławomir Lasota

6. Ground interpolation for the theory of equality
  Alexander Fuchs, Amit Goel, Jim Grundy, Sava Krstić and Cesare Tinelli

7. Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem
  Libor Barto and Marcin Kozik

8. A dependent nominal type theory
  James Cheney

9. Semantics and Algorithms for Parametric Monitoring
  Grigore Rosu and Feng Chen

10. Realizability algebras II : new models of ZF + DC
  Jean-Louis Krivine

11. A System F accounting for scalars
  Pablo Arrighi and Alejandro Díaz-Caro

12. Type-elimination-based reasoning for the description logic SHIQbs using decision diagrams and disjunctive datalog
  Sebastian Rudolph, Markus Krötzsch and Pascal Hitzler

13. Büchi Complementation and Size-Change Termination
  Seth Fogarty and Moshe Y. Vardi

14. QRB-Domains and the Probabilistic Powerdomain
  Jean Goubault-Larrecq

15. Two-Variable Logic with Two Order Relations
  Thomas Schwentick and Thomas Zeume

16. Deciding Kleene Algebras in Coq
  Thomas Braibant and Damien Pous

17. Typing Copyless Message Passing
  Viviana Bono and Luca Padovani

18. A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions
  Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen and Enrico Tassi

19. Derivation Lengths Classification of Gödel's T Extending Howard's Assignment
  Gunnar Wilken and Andreas Weiermann

20. Theorem proving for prenex Gödel logic with Delta: checking validity and unsatisfiability
  Matthias Baaz, Agata Ciabattoni and Christian G. Fermüller

21. Modeling Adversaries in a Logic for Security Protocol Analysis
  Joseph Y. Halpern and Riccardo Pucella

22. Alternating register automata on finite words and trees
  Diego Figueira

23. The rapid points of a complex oscillation
  Paul Potgieter

24. On Global Types and Multi-Party Session
  Giuseppe Castagna, Mariangiola Dezani-Ciancaglini and Luca Padovani

25. Formal Theories for Linear Algebra
  Stephen A Cook and Lila A Fontes

26. Static Analysis of Run-Time Errors in Embedded Real-Time Parallel C Programs
  Antoine Miné

27. On the Parameterized Intractability of Monadic Second-Order Logic
  Stephan Kreutzer

28. Preservation of Strong Normalisation modulo permutations for the structural lambda-calculus
  Beniamino Accattoli and Delia Kesner

29. On Irrelevance and Algorithmic Equality in Predicative Type Theory
  Andreas Abel and Gabriel Scherer

30. A Synthesis of the Procedural and Declarative Styles of Interactive Theorem Proving
  Freek Wiedijk

31. A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems
  Takahito Aoto and Yoshihito Toyama

32. Tree-width for first order formulae
  Isolde Adler and Mark Weyer

Creative Commons