Precise complexity guarantees for pointer analysis via Datalog with extensions

Pointer analysis is a fundamental static program analysis for computing the set of objects that an expression can refer to. Decades of research has gone into developing methods of varying precision and efficiency for pointer analysis for programs that use different language features, but determining...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theory and practice of logic programming 2016-09, Vol.16 (5-6), p.916-932
Hauptverfasser:	TEKLE, K. TUNCAY, LIU, YANHONG A.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Complexity Efficiency Logic programming Mathematical analysis Mathematical models Program verification (computers) Regular Papers Symbols
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!