Sciweavers

171 search results - page 5 / 35
» Checking Safety Properties Using Induction and a SAT-Solver
Sort
View
CADE
2006
Springer
14 years 7 months ago
Inferring Network Invariants Automatically
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
Olga Grinchtein, Martin Leucker, Nir Piterman
CAV
2012
Springer
231views Hardware» more  CAV 2012»
11 years 10 months ago
Incremental, Inductive CTL Model Checking
A SAT-based incremental, inductive algorithm for model checking CTL properties is proposed. As in classic CTL model checking, the parse graph of the property shapes the analysis. H...
Zyad Hassan, Aaron R. Bradley, Fabio Somenzi
MEMOCODE
2005
IEEE
14 years 1 months ago
Three-valued logic in bounded model checking
In principle, bounded model checking (BMC) leads to semidecision procedures that can be used to verify liveness properties and to falsify safety properties. If the procedures fail...
Tobias Schüle, Klaus Schneider
GECCO
2007
Springer
215views Optimization» more  GECCO 2007»
13 years 11 months ago
Finding safety errors with ACO
Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulae on the program variables. Most model checke...
Enrique Alba, J. Francisco Chicano
FASE
2005
Springer
14 years 1 months ago
Checking Memory Safety with Blast
Abstract. Blast is an automatic verification tool for checking temporal safety properties of C programs. Given a C program and a temporal safety property, Blast statically proves ...
Dirk Beyer, Thomas A. Henzinger, Ranjit Jhala, Rup...