Type-based data structure verification

We present a refinement type-based approach for the static verification of complex data structure invariants. Our approach is based on the observation that complex data structures are typically fashioned from two elements: recursion (e.g., lists and trees), and maps (e.g., arrays and hash tables). W...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	SIGPLAN notices 2009-06, Vol.44 (6), p.304-315
Hauptverfasser:	Kawaguchi, Ming, Rondon, Patrick, Jhala, Ranjit
Format:	Artikel
Sprache:	eng
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!