6608 search results - page 73 / 1322 » On the Completeness of Model Checking |
151
click to vote
CAV
2007
Springer
15 years 10 months ago
2007
Springer
This paper explores the concept of locality in proofs of global safety properties of asynchronously composed, multi-process programs. Model checking on the full state space is ofte...
119
click to vote
CAV
2003
Springer
15 years 9 months ago
2003
Springer
ion and BDDs Complement SAT-based BMC in DiVer Aarti Gupta1, Malay Ganai1 , Chao Wang2, Zijiang Yang1, Pranav Ashar1 1 NEC Laboratories America, Princeton, NJ, U.S.A. 2 University ...
160
click to vote
LPAR
2010
Springer
15 years 2 months ago
2010
Springer
The Inst-Gen-Eq method is an instantiation-based calculus which is complete for first-order clause logic modulo equality. Its distinctive feature is that it combines first-order ...
184
click to vote
ICDT
2009
ACM
15 years 1 months ago
2009
ACM
We describe a novel approach to verification of software systems centered around an underlying database. Instead of applying general-purpose techniques with only partial guarantee...
137
click to vote
TAMC
2009
Springer
15 years 10 months ago
2009
Springer
We study a new model of computation called stream checking on graph problems where a space-limited verifier has to verify a proof sequentially (i.e., it reads the proof as a strea...