35 search results - page 5 / 7 » Inferring Invariants by Symbolic Execution |
POPL
2007
ACM
14 years 5 months ago
2007
ACM
An invariance assertion for a program location is a statement that always holds at during execution of the program. Program invariance analyses infer invariance assertions that ca...
ESOP
2001
Springer
13 years 9 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...
PTS
2010
13 years 2 months ago
2010
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic ex...
FMCAD
2007
Springer
13 years 11 months ago
2007
Springer
—Embedded systems typically consist of a composition of a set of hardware and software IP modules. Each module is heavily optimized by itself. However, when these modules are com...
POPL
2009
ACM
14 years 5 months ago
2009
ACM
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...