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: | , , |
|---|---|
| Outros Autores: | |
| Formato: | Conference item |
| Publicado em: |
Springer
2012
|
Registos relacionados
Model and proof generation for heap-manipulating programs
Por: Brain, M, et al.
Publicado em: (2014)
Por: Brain, M, et al.
Publicado em: (2014)