Book section Open Access

Precise Widening Operators for Proving Termination by Abstract Interpretation

Courant, Nathanaël; Urban, Caterina

DataCite XML Export

<?xml version='1.0' encoding='utf-8'?>
<identifier identifierType="URL">https://zenodo.org/record/894778</identifier>
<creators>
<creator>
<creatorName>Courant, Nathanaël</creatorName>
<givenName>Nathanaël</givenName>
<familyName>Courant</familyName>
<nameIdentifier nameIdentifierScheme="ORCID" schemeURI="http://orcid.org/">0000-0002-8736-3060</nameIdentifier>
</creator>
<creator>
<creatorName>Urban, Caterina</creatorName>
<givenName>Caterina</givenName>
<familyName>Urban</familyName>
</creator>
</creators>
<titles>
<title>Precise Widening Operators for Proving Termination by Abstract Interpretation</title>
</titles>
<publisher>Zenodo</publisher>
<publicationYear>2017</publicationYear>
<dates>
<date dateType="Issued">2017-01-01</date>
</dates>
<resourceType resourceTypeGeneral="BookChapter"/>
<alternateIdentifiers>
<alternateIdentifier alternateIdentifierType="url">https://zenodo.org/record/894778</alternateIdentifier>
</alternateIdentifiers>
<relatedIdentifiers>
<relatedIdentifier relatedIdentifierType="DOI" relationType="IsIdenticalTo">10.1007/978-3-662-54577-5_8</relatedIdentifier>
</relatedIdentifiers>
<rightsList>
<rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
</rightsList>
<descriptions>
<description descriptionType="Abstract">FuncTion is a static analyzer designed for proving conditional termination of C programs by means of abstract interpretation. Its underlying abstract domain is based on piecewise-defined functions, which provide an upper bound on the number of program execution steps until termination as a function of the program variables.

In this paper, we fully parameterize various aspects of the abstract domain, gaining a flexible balance between the precision and the cost of the analysis. We propose heuristics to improve the fixpoint extrapolation strategy (i.e., the widening operator) of the abstract domain. In particular we identify new widening operators, which combine these heuristics to dramatically increase the precision of the analysis while offering good cost compromises. We also introduce a more precise, albeit costly, variable assignment operator and the support for choosing between integer and rational values for the piecewise-defined functions.

We combined these improvements to obtain an implementation of the abstract domain which subsumes the previous implementation. We provide experimental evidence in comparison with state-of-the-art tools showing a considerable improvement in precision at a minor cost in performance.</description>
</descriptions>
</resource>

79
153
views