798 search results - page 7 / 160 » Proving More Properties with Bounded Model Checking |
105
click to vote
SOFSEM
2010
Springer
15 years 8 months ago
2010
Springer
We extend the lower bound of Adler et. al [1] and Berenbrink [3] for parallel randomized load balancing algorithms. The setting in these asynchronous and distributed algorithms is...
100
click to vote
POPL
2000
ACM
15 years 4 months ago
2000
ACM
Certified code is a general mechanism for enforcing security properties. In this paradigm, untrusted mobile code carries annotations that allow a host to verify its trustworthine...
TACAS
2005
Springer
15 years 5 months ago
2005
Springer
Shorter counterexamples are typically easier to understand. The length of a counterexample, as reported by a model checker, depends on both the algorithm used for state space explo...
178
click to vote
POPL
2007
ACM
16 years 3 hour ago
2007
ACM
In recent years we have seen great progress made in the area of automatic source-level static analysis tools. However, most of today's program verification tools are limited ...
TPHOL
2005
IEEE
15 years 5 months ago
2005
IEEE
Using the HOL theorem prover, we proved the correctness of a translation from a subset of Accellera’s property specification language PSL to linear temporal logic LTL. Moreover,...