Open access
Date
2013Type
- Report
ETH Bibliography
yes
Altmetrics
Abstract
Effective static analysis of heap manipulating programs is required to track precise information about the heap structures and values computed by the program. In this paper, we introduce a combined heap and value analysis that infers complex invariants for recursive data structures like lists and trees, in particular relations between value fields of heap-allocated objects. Our analysis does not require any manual annotation of the program. Different performance/precision ratios are achieved by selecting different value domains. The analysis has been implemented in the generic static analyzer Sample. The experimental results show that the analysis infers invariants automatically that required manual annotations in the state-of-the-art analyses. Show more
Permanent link
https://doi.org/10.3929/ethz-a-010110962Publication status
publishedJournal / series
Technical report / Department of Computer ScienceVolume
Publisher
ETH-Zürich, Departement InformatikSubject
Value analysis; Static analysis; CODING (SOFTWARE ENGINEERING); PROCESS MANAGEMENT (OPERATING SYSTEMS); SPECIAL PROGRAMMING METHODS; PROZESSVERWALTUNG + PROZESSMANAGEMENT (BETRIEBSSYSTEME); SPEZIELLE PROGRAMMIERMETHODEN; Abstract domains; Abstract interpretation; KODIERUNG (SOFTWARE ENGINEERING); Heap analysisOrganisational unit
03653 - Müller, Peter / Müller, Peter
02150 - Dep. Informatik / Dep. of Computer Science
Notes
Updated version from 15. September 2014 see: http://e-citations.ethbib.ethz.ch/view/pub:139737.More
Show all metadata
ETH Bibliography
yes
Altmetrics