Publications

Here is the list of publications founded at least in part by the ReacHard project:

2014

  1. Timos Antonopoulos, Nikos Gorogiannis, Christoph Haase, Max Kanovich, and Joël Ouaknine (2014) Foundations for Decision Problems in Separation Logic with General Inductive Predicates FoSSaCS 2014 Anca Muscholl Springer (To appear) (BibTeX)
  2. Sylvain Schmitz (2014) Implicational Relevance Logic is 2-EXPTIME-Complete Research Report arXiv:1402.0705 [cs.LO]Computing Research Repository (URL) (BibTeX)
  3. Christoph Haase (2014) Subclasses of Presburger Arithmetic and the Weak EXP Hierarchy Research Report arXiv:1401.5266 [cs.LO]Computing Research Repository (URL) (BibTeX)
  4. Ranko Lazić and Sylvain Schmitz (2014) Non-Elementary Complexities for Branching VASS, MELL, and Extensions Research Report arXiv:1401.6785 [cs.LO]Computing Research Repository (URL) (BibTeX)

2013

  1. Prateek Karandikar and Philippe Schnoebelen (2013) On the index of Simon's congruence for piecewise testability Research Report arXiv:1310.1278 [cs.LO]Computing Research Repository (URL) (BibTeX)
  2. Christoph Haase, Samin Ishtiaq, Joel Ouaknine, and Matthew Parkinson (2013) SeLoger: A Tool for Graph-Based Reasoning in Separation Logic CAV 2013 Natasha Sharygina and Helmut Veith Springer 790–795 (URL) (BibTeX)
  3. Sylvain Schmitz and Philippe Schnoebelen (2013) The Power of Well-Structured Systems Concur 2013 Pedro R. D'Argenio and Hernán Melgratti Springer 5–24 (URL) (BibTeX)
  4. Jérôme Leroux, M. Praveen, and Grégoire Sutre (2013) A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness Concur 2013 Pedro R. D'Argenio and Hernán Melgratti Springer 137–151 (URL) (BibTeX)
  5. Gilles Geeraerts, Alexander Heussner, M. Praveen, and Jean-François Raskin (2013) $\omega$-Petri nets Petri nets 2013 José-Manuel Colom and Jörg Desel Springer 49–69 (URL) (BibTeX)
  6. Alain Finkel, Stefan Göller, and Christoph Haase (2013) Reachability in Register Machines with Polynomial Updates MFCS 2013 Krishnendu Chatterjee and Ji\vrí Sgall Springer 409–420 (URL) (BibTeX)
  7. Sylvain Schmitz (2013) Complexity Hierarchies Beyond Elementary Research Report arXiv:1312.5686 [cs.CC]Computing Research Repository (URL) (BibTeX)
  8. Jérôme Leroux (2013) Vector Addition System Reversible Reachability Problem Logical Methods in Computer Science, 9(1) (URL) (BibTeX)
  9. Stéphane Demri (2013) On selective unboundedness of VASS Journal of Computer and System Sciences, 79(5):689–713 (URL) (BibTeX)
  10. Jérôme Leroux (2013) Acceleration for Petri Nets ATVA 2013 Dang Van Hung and Mizuhito Ogawa Springer 1–4 (URL) (BibTeX)
  11. Christoph Haase, Sylvain Schmitz, and Philippe Schnoebelen (2013) The Power of Priority Channel Systems Concur 2013 Pedro R. D'Argenio and Hernán Melgratti Springer 319–333 (URL) (BibTeX)
  12. Jérôme Leroux (2013) Presburger Vector Addition Systems LICS 2013 IEEE Computer Society Press 23–32 (URL) (BibTeX)
  13. Rémi Bonnet, Alain Finkel, Serge Haddad, and Fernando Rosa-Velardo (2013) Ordinal Theory for Expressiveness of Well-Structured Transition Systems Information and Computation, 224:1–22 (URL) (BibTeX)
  14. Rémi Bonnet (2013) Theory of Well-Structured Transition Systems and Extended Vector-Addition SystemsPhD thesisLaboratoire Spécification et Vérification, ENS Cachan, France (URL) (BibTeX)
  15. Michaël Cadilhac (2013) Automata with a semilinear constraintPhD thesisUniversité de Montréal (URL) (BibTeX)
  16. Nathalie Bertrand and Philippe Schnoebelen (2013) Computable fixpoints in well-structured symbolic model checking Formal Methods in System Design, 43(2):233–267 (URL) (BibTeX)
  17. Prateek Karandikar and Sylvain Schmitz (2013) The Parametric Ordinal-Recursive Complexity of Post Embedding Problems FoSSaCS 2013 Frank Pfenning Springer 273–288 (URL) (BibTeX)
  18. Stéphane Demri, Diego Figueira, and M. Praveen (2013) Reasoning about Data Repetitions with Counter Systems LICS 2013 IEEE Computer Society Press 33–42 (URL) (BibTeX)
  19. Jérôme Leroux, Vincent Penelle, and Grégoire Sutre (2013) On the Context-Freeness Problem for Vector Addition Systems LICS 2013 IEEE Computer Society Press 43–52 (URL) (BibTeX)
  20. Nathalie Bertrand and Philippe Schnoebelen (2013) Solving stochastic Büchi games on infinite arenas with a finite attractor QAPL 2013 Electronic Proceedings in Theoretical Computer Science vol. 117 Luca Bortolussi and Herbert Wiklicky 116–131 (URL) (BibTeX)
  21. Lorenzo Clemente, Frédéric Herbreteau, Amélie Stainer, and Grégoire Sutre (2013) Reachability of Communicating Timed Processes FoSSaCS 2013 Frank Pfenning Springer 81–96 (URL) (BibTeX)

2012

  1. Stéphane Demri, Amit Kumar Dhar, and Arnaud Sangnier (2012) Taming Past LTL and Flat Counter Systems IJCAR 2012 Lecture Notes in Artificial Intelligence vol. 7364 B. Gramlich, D. Miller, and U. Sattler Springer 179–193 (URL) (BibTeX)
  2. Sylvain Schmitz and Philippe Schnoebelen (2012) Algorithmic Aspects of WQO Theory (URL) (BibTeX)
  3. Jérôme Leroux (2012) Vector Addition Systems Reachability Problem (A Simpler Solution) Alan Turing Centenary Conf. Electronic Proceedings in Theoretical Computer Science vol. 10 Andrei Voronkov 214–228 (URL) (BibTeX)
  4. Rémi Bonnet, Alain Finkel, Jérôme Leroux, and Marc Zeitoun (2012) Model Checking Vector Addition Systems with one zero-test Logical Methods in Computer Science, 8(2):11 (URL) (BibTeX)
  5. Serge Haddad, Sylvain Schmitz, and Philippe Schnoebelen (2012) The Ordinal-Recursive Complexity of Timed-Arc Petri Nets, Data Nets, and Other Enriched Nets LICS 2012 IEEE Computer Society Press 355–364 (URL) (BibTeX)
  6. Alain Finkel and Jean Goubault-Larrecq (2012) The Theory of WSTS: The Case of Complete WSTS Petri Nets 2012 Lecture Notes in Computer Science vol. 7347 Serge Haddad and Lucia Pomello Springer 3–31 (URL) (BibTeX)
  7. Prateek Karandikar and Philippe Schnoebelen (2012) Cutting Through Regular Post Embedding Problems CSR 2012 Lecture Notes in Computer Science vol. 7353 Michail Prilutskii Springer 234–245 (URL) (BibTeX)
  8. Alexander Heußner, Tristan Le Gall, and Grégoire Sutre (2012) Safety Verification of Communicating One-Counter Machines FSTTCS 2012 LIPIcs vol. 18 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 224–235 (URL) (BibTeX)
  9. Michaël Cadilhac, Alain Finkel, and Pierre McKenzie (2012) Affine Parikh automata RAIRO Informatique Théorique et Applications, 46(4):511-545 (URL) (BibTeX)
  10. Alain Finkel, Jérôme Leroux, and Igor Potapov, Eds. (2012) Proceedings of the 6th International Wokshop on Reachability Problems (RP'12) Lecture Notes in Computer Science vol. 7550Springer (URL) (BibTeX)
  11. Michaël Cadilhac, Alain Finkel, and Pierre McKenzie (2012) Bounded Parikh automata International Journal of Foundations of Computer Science, 23(8):1691-1710 (URL) (BibTeX)
  12. Alain Finkel and Jean Goubault-Larrecq (2012) Forward Analysis for WSTS, Part II: Complete WSTS Logical Methods in Computer Science, 8(3:28) (URL) (BibTeX)
  13. Rémi Bonnet, Alain Finkel, and M. Praveen (2012) Extending the Rackoff technique to affine nets FSTTCS 2012 LIPIcs vol. 18 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 301–312 (URL) (BibTeX)
  14. Petr Jan\vcar, Prateek Karandikar, and Philippe Schnoebelen (2012) Unidirectional channel systems can be tested IFIP TCS 2012 Lecture Notes in Computer Science vol. 7604 Jos Baeten, Tom Ball, and Frank de Boer Springer 149–163 (URL) (BibTeX)
  15. Alexander Heußner, Jérôme Leroux, Anca Muscholl, and Grégoire Sutre (2012) Reachability Analysis of Communicating Pushdown Systems Logical Methods in Computer Science, 8(3:23):1–20 (URL) (BibTeX)