Linear refinement is a technique for systematically constructing abstract domains for program analysis directly from a basic domain representing just the property of interest. This paper uses linear refinement to construct a domain for non pair-sharing and freeness analysis. The resulting domain is strictly more precise than the domain for sharing and freeness analysis defined by Jacobs and Langen. Moreover, it can be used for abstract compilation, while Jacobs and Langen's domain can only be used for abstract interpretation. We provide a representation of the domain, together with algorithms for the abstract operations.
|Titolo:||Non Pair-Sharing and Freeness Analysis through Linear Refinement|
|Data di pubblicazione:||2000|
|Appare nelle tipologie:||04.01 Contributo in atti di convegno|