Fast Acceleration of Ultimately Periodic Relations
From MaRDI portal
Publication:3583851
DOI10.1007/978-3-642-14295-6_23zbMath1427.68113OpenAlexW1540580590MaRDI QIDQ3583851
Radu Iosif, Filip Konečný, Marius Bozga
Publication date: 18 August 2010
Published in: Computer Aided Verification (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14295-6_23
Related Items
A Calculus for Modular Loop Acceleration ⋮ Algebraic program analysis ⋮ Porous invariants ⋮ \textsc{Diffy}: inductive reasoning of array programs using difference invariants ⋮ On selective unboundedness of VASS ⋮ Interprocedural Reachability for Flat Integer Programs ⋮ Accelerating worst case execution time analysis of timed automata models with cyclic behaviour ⋮ A New Acceleration-Based Combination Framework for Array Properties ⋮ Applying abstract acceleration to (co-)reachability analysis of reactive programs ⋮ Proving Safety with Trace Automata and Bounded Model Checking ⋮ Proving non-termination and lower runtime bounds with \textsf{LoAT} (system description) ⋮ Taming past LTL and flat counter systems
Uses Software
