6608 search results - page 1 / 1322 » On the Completeness of Model Checking |
CAV
2005
Springer
13 years 10 months ago
2005
Springer
Bounded model checking is an efficient method for finding bugs in system designs. The major drawback of the basic method is that it cannot prove properties, only disprove them. R...
FMSD
2002
13 years 5 months ago
2002
We present a new technique for verification of complex hardware devices that allows both generality andahighdegreeofautomation.Thetechniqueisbasedonournewwayofconstructinga"li...
CONCUR
2000
Springer
13 years 8 months ago
2000
Springer
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
CONCUR
2008
Springer
13 years 7 months ago
2008
Springer
Software transactional memory (STM) offers a disciplined concurrent programming model for exploiting the parallelism of modern processor architectures. This paper presents the firs...
VMCAI
2004
Springer
13 years 10 months ago
2004
Springer