37 search results - page 5 / 8 » SAT-Based Procedures for Temporal Reasoning |
102
click to vote
ASIAN
2003
Springer
15 years 2 months ago
2003
Springer
Protocols for distributed systems make often use of random transitions to achieve a common goal. A popular example are randomized leader election protocols. We introduce probabilis...
FMCAD
2006
Springer
15 years 1 months ago
2006
Springer
Recent years have seen a proliferation of 3-valued or capturing abstractions of systems, since these enable verifying both universal and existential properties. Reasoning about suc...
LICS
2007
IEEE
15 years 3 months ago
2007
IEEE
In an influential paper titled “The Benefits of Relaxing Punctuality” [2], Alur, Feder, and Henzinger introduced Metric Interval Temporal Logic (MITL) as a fragment of the r...
111
click to vote
POPL
2011
ACM
14 years 11 days ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
CN
2004
14 years 9 months ago
2004
A number of web cache-related algorithms, such as replacement and prefetching policies, rely on specific characteristics present in the sequence of requests for efficient performa...