61 search results - page 5 / 13 » Invariant Checking for Programs with Procedure Calls |
ACTA
2010
14 years 10 months ago
2010
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
ESOP
2001
Springer
15 years 2 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...
ICLP
1987
Springer
15 years 1 months ago
1987
Springer
The Near-Horn Prolog procedures have been proposed as e ective procedures in the area of disjunctive logic programming, an extension of logic programming to the ( rstorder) non-Ho...
FOSSACS
2006
Springer
15 years 1 months ago
2006
Springer
We define a new decidable logic for expressing and checking invariants of programs that manipulate dynamically-allocated objects via pointers and destructive pointer updates. The ...
104
click to vote
PLDI
2012
ACM
13 years 7 days ago
2012
ACM
Modularity is a central theme in any scalable program analysis. The core idea in a modular analysis is to build summaries at procedure boundaries, and use the summary of a procedu...