Search
Now showing items 1-2 of 2
Abstraction Refinement for 3-Valued Logic Analysis
(University of Wisconsin-Madison Department of Computer Sciences, 2004)
This paper concerns the question of how to create abstractions that are useful for program analysis. It presents a method that refines an abstraction automatically for analysis problems in which the semantics of statements ...
A Relational Approach to Interprocedural Shape Analysis
(University of Wisconsin-Madison Department of Computer Sciences, 2004)
This paper addresses the verification of properties of imperative programs with
recursive procedure calls, heap-allocated storage, and destructive updating of pointer-valued fields-i.e., interprocedural shape analysis. ...