A Perfect Model for Bounded Verification

DOI10.1109/LICS.2012.39zbMath1362.68168arXiv1201.3194OpenAlexW2006337571MaRDI QIDQ2986805

Javier Esparza, Pierre Ganty, Rupak Majumdar

Publication date: 16 May 2017

Published in: 2012 27th Annual IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.3194

zbMATH Keywords

verificationcomplexityalgorithmsformal languagesunderapproximation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Coverability in 2-VASS with one unary counter is in NP ⋮ Unboundedness problems for machines with reversal-bounded counters ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Verification of Flat FIFO Systems ⋮ Unboundedness Problems for Languages of Vector Addition Systems. ⋮ Bounded Context Switching for Valence Systems ⋮ Reachability analysis of reversal-bounded automata on series-parallel graphs ⋮ On the path-width of integer linear programming ⋮ Unnamed Item ⋮ A Perfect Class of Context-Sensitive Timed Languages ⋮ Non axiomatisability of positive relation algebras with constants, via graph homomorphisms ⋮ Unnamed Item