Counterexample Driven Refinement for Abstract Interpretation

Abstract interpretation techniques prove properties of programs by computing abstract fixpoints. All such analyses suffer from the possibility of false errors. We present a new counterexample driven refinement technique to reduce false errors in abstract interpretations. Our technique keeps track of...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Gulavani, Bhargav S., Rajamani, Sriram K.
Format:	Buchkapitel
Sprache:	eng
Schlagworte:	Abstract Interpretation Applied sciences Computer science control theory systems Exact sciences and technology Reachable State Software Software engineering Symbolic State True Error Widening Operator
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!