A new framework for elimination-based data flow analysis using DJ graphs

In this article, we present a new framework for elimination-based exhaustive and incremental data flow analysis using the DJ graph representation of a program. Unlike previous approaches to elimination-based incremental data flow analysis, our approach can handle arbitrary structural and nonstructur...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	ACM transactions on programming languages and systems 1998-03, Vol.20 (2), p.388-435
Hauptverfasser:	Sreedhar, Vugranam C., Gao, Guang R., Lee, Yong-Fong
Format:	Artikel
Sprache:	eng
Schlagworte:	Automated flow chart B-trees Compilers Directory structures Discrete mathematics Flow charts Graph theory Information storage systems Information systems Mathematics of computing Methods Record storage systems Software and its engineering Software notations and tools Trees
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!