—Practical software verification is dominated by two major classes of techniques. The first is model checking, which provides total precision, but suffers from the state space ...
Daniel Kroening, Natasha Sharygina, Stefano Tonett...
Polyhedra are widely used in model checking and abstract interpretation. Polyhedral analysis is effective when the relationships between variables are linear, but suffers from im...
Abstract. Optimistic and nonblocking concurrent algorithms are increasingly finding their way into practical use; an important example is software transactional memory implementat...
Parity games are 2-player games of perfect information and infinite duration that have important applications in automata theory and decision procedures (validity as well as model...
For programs whose data variables range over boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. I...