5015 search results - page 524 / 1003 » Model Checking a Path |
171
click to vote
FSTTCS
2004
Springer
16 years 8 days ago
2004
Springer
We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. The restrictions in the fragment are motivated by the...
174
click to vote
SAT
2004
Springer
16 years 7 days ago
2004
Springer
Modern algorithms for the SAT problem reveal an almost tractable behavior on “real-world” instances. This is frequently contributed to the fact that these instances possess an ...
184
click to vote
ECRTS
2003
IEEE
16 years 5 days ago
2003
IEEE
The memory model used in the Real-Time Specification for Java (RTSJ) imposes strict assignment rules to or from memory areas preventing the creation of dangling pointers, and thus...
169
click to vote
DAC
2003
ACM
16 years 4 days ago
2003
ACM
Coverage estimation for model checking quantifies the completeness of a set of properties. We present an improved version of the algorithm of Hoskote et al. [7] that applies to a...
184
click to vote
COCOON
2003
Springer
16 years 3 days ago
2003
Springer
We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as...