Taming Past LTL and Flat Counter Systems
From MaRDI portal
Publication:2908489
DOI10.1007/978-3-642-31365-3_16zbMath1358.68186arXiv1205.6584OpenAlexW2162230135MaRDI QIDQ2908489
Amit Kumar Dhar, Stéphane P. Demri, Arnaud Sangnier
Publication date: 5 September 2012
Published in: Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1205.6584
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Temporal logic (03B44)
Related Items (5)
Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic ⋮ Equivalence between model-checking flat counter systems and Presburger arithmetic ⋮ On selective unboundedness of VASS ⋮ Interprocedural Reachability for Flat Integer Programs ⋮ Taming past LTL and flat counter systems
Uses Software
This page was built for publication: Taming Past LTL and Flat Counter Systems
