122 search results - page 8 / 25 » Bounded Model Checking of Pointer Programs |
NFM
2011
13 years 2 months ago
2011
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
TACAS
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. We present Boom, a comprehensive analysis tool for Boolean programs. We focus in this paper on model-checking non-recursive concurrent programs. Boom implements a recent ...
ESOP
2001
Springer
13 years 12 months ago
2001
Springer
We check statically whether it is safe for untrusted foreign machine code to be loaded into a trusted host system. (Here “safety” means that the program abides by a memory-acc...
CP
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. This paper studies how to verify the conformity of a program with its specification and proposes a novel constraint-programming framework for bounded program verification...
SPIN
2007
Springer
14 years 1 months ago
2007
Springer
Boolean programs are frequently used to model abstractions of software programs. They have the advantage that reachability properties are decidable, despite the fact that their sta...