6608 search results - page 33 / 1322 » On the Completeness of Model Checking |
124
Voted
BCS
2008
15 years 2 months ago
2008
Parity games underlie the model checking problem for the modal
98
Voted
ADC
2004
Springer
15 years 6 months ago
2004
Springer
A complete workflow specification requires careful integration of many different process characteristics. Decisions must be made as to the definitions of individual activities, th...
DATE
2004
IEEE
2004
IEEE
Automatic Verification of Safety and Liveness for XScale-Like Processor Models Using WEB Refinements
15 years 4 months ago
We show how to automatically verify that complex XScale-like pipelined machine models satisfy the same safety and liveness properties as their corresponding instruction set archit...
101
Voted
CAV
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. We consider a fully SAT-based method of unbounded symbolic model checking based on computing Craig interpolants. In benchmark studies using a set of large industrial circ...
114
click to vote
APLAS
2007
ACM
15 years 4 months ago
2007
ACM
Abstract. We propose a theory of up-to techniques for proofs by coinduction, in the setting of complete lattices. This theory improves over existing results by providing a way to c...