• Participants
  • Documents
  • Meetings
  • Login

ReacHard

Taming Hard Reachability Problems

General

  • Publications by the ReacHard members
  • Job postings
  • News

Starting Points: Three Breakthroughs

  • New reachability algorithm
  • Algorithmic aspects of wqo's
  • Extending Rackoff's technique

Documents

Latest NewsRSS

  • Dagstuhl Seminar
  • Papers at LICS 2013
  • Working Group on Verification

Tags

Postdoc Master PhD Complexity Wqo WSTS BVASS PetriNets Decidability Model-checking First-order Modal

Latest Publications

  1. Sylvain Schmitz (2014) Implicational Relevance Logic is 2-EXPTIME-Complete Research Report arXiv:1402.0705 [cs.LO]Computing Research Repository (URL) (BibTeX)
  2. Christoph Haase (2014) Subclasses of Presburger Arithmetic and the Weak EXP Hierarchy Research Report arXiv:1401.5266 [cs.LO]Computing Research Repository (URL) (BibTeX)
  3. 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)
  4. 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)
Laboratoire Spécification et Vérification Laboratoire Bordelais de Recherche en Informatique Agence Nationale de la Recherche

Project ReacHard is funded by ANR decision ANR 11 BS02 001 01.