Efficient coverability analysis by proof minimization
We consider multi-threaded programs with an unbounded number of threads executing a finite-state, non-recursive procedure. Safety properties of such programs can be checked via reduction to the coverability problem for well-structured transition systems (WSTS). In this paper, we present a novel, sou...
Main Authors: | Kaiser, A, Kroening, D, Wahl, T |
---|---|
Andre forfattere: | Koutny, M |
Format: | Conference item |
Udgivet: |
Springer
2012
|
Lignende værker
-
Lost in abstraction: monotonicity in multi-threaded programs
af: Kaiser, A, et al.
Udgivet: (2016) -
Lost in abstraction: monotonicity in multi-threaded programs
af: Kaiser, A, et al.
Udgivet: (2014) -
A widening approach to multithreaded program verification
af: Kaiser, A, et al.
Udgivet: (2014) -
Proof-graphs for Minimal Implicational Logic
af: Marcela Quispe-Cruz, et al.
Udgivet: (2014-03-01) -
Image Computation and Predicate Refinement for RTL Verilog using Word Level Proofs
af: Kroening, D, et al.
Udgivet: (2007)