6608 search results - page 44 / 1322 » On the Completeness of Model Checking |
137
click to vote
RISE
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for re...
124
click to vote
VSTTE
2005
Springer
15 years 9 months ago
2005
Springer
The interplay back and forth between software model checking and hardware model checking has been fruitful for both. Originally intended for the analysis of concurrent software, mo...
140
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
We revisit the problem of memory checking considered by Blum et al. [3]. In this model, a checker monitors the behavior of a data structure residing in unreliable memory given an a...
119
click to vote
GG
2008
Springer
2008
Springer
Semantical Correctness and Completeness of Model Transformations Using Graph and Rule Transformation
15 years 5 months ago
An important requirement of model transformations is the preservation of the behavior of the original model. A model transformation is semantically correct if for each simulation r...
129
click to vote
ICCAD
2007
IEEE
16 years 29 days ago
2007
IEEE
Retiming and resynthesis are among the most important techniques for practical sequential circuit optimization. However, their applicability is much limited due to verification c...