61 search results - page 1 / 13 » Invariant Checking for Programs with Procedure Calls |
SAS
2009
Springer
14 years 5 months ago
2009
Springer
NFM
2011
12 years 12 months ago
2011
Program verifiers based on first-order theorem provers model the program heap as a collection of mutable maps. In such verifiers, preserving unmodified facts about the heap acr...
POPL
2009
ACM
14 years 5 months ago
2009
ACM
We present a unified approach to type checking and property checking for low-level code. Type checking for low-level code is challenging because type safety often depends on compl...
PLDI
2009
ACM
14 years 5 months ago
2009
ACM
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...
CAV
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Modern termination provers rely on a safety checker to construct disjunctively well-founded transition invariants. This safety check is known to be the bottleneck of the ...