A lattice for abstract interpretation of dynamic (LISP-like) structures

DOI10.1016/0890-5401(92)90076-RzbMath0760.68048MaRDI QIDQ1201726

Jan Stransky

Publication date: 17 January 1993

Published in: Information and Computation (Search for Journal in Brave)

zbMATH Keywords

LISPheap-graphssemantic analysis of dynamic data structures

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Semantics in the theory of computing (68Q55) Data structures (68P05) Continuous lattices and posets, applications (06B35)

Related Items (1)

Abstractions of data types

Cites Work

• ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
• Analysis of functional programs to detect run-time garbage cells
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A lattice for abstract interpretation of dynamic (LISP-like) structures