Dynamic shape analysis of program heap using graph spectra (NIER track)

Programs written in languages such as Java and C# maintain most of their state on the heap. The size and complexity of these programs pose a challenge in understanding and maintaining them; Heap analysis by summarizing the state of heap graphs assists programmers in these tasks. In this paper we pre...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Proceedings of the 33rd International Conference on Software Engineering S. 952 - 955
1. Verfasser: Malik, Muhammad Zubair
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: New York, NY, USA ACM 21.05.2011
Schriftenreihe:ACM Conferences
Schlagworte:
ISBN:9781450304450, 1450304451
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Programs written in languages such as Java and C# maintain most of their state on the heap. The size and complexity of these programs pose a challenge in understanding and maintaining them; Heap analysis by summarizing the state of heap graphs assists programmers in these tasks. In this paper we present a novel dynamic heap analysis technique that uses spectra of the heap graphs to summarize them. These summaries capture the shape of recursive data structures as dynamic invariants or likely properties of these structures that must be preserved after any destructive update. Initial experiments show that this approach can generate meaningful summaries for a range of subject structures.
ISBN:9781450304450
1450304451
DOI:10.1145/1985793.1985956