On collecting semantics for program analysis
Citations Over Time
Abstract
Reasoning on a complex system in the abstract interpretation theory starts with a formal description of the system behavior specified by a collecting semantics. We take the common point of view that a collecting semantics is a very precise semantics from which other abstractions may be derived. We elaborate on both the concepts of precision and derivability, and introduce a notion of adequacy which tell us when a collecting semantics is a good choice for a given family of abstractions. We instantiate this approach to the case of first-order functional programs by considering three common collecting semantics and some abstract properties of functions. We study their relative precision and give a constructive characterization of the classes of abstractions which are adequate for the collecting semantics.
Related Papers
- → Constructive Design of a Hierarchy of Semantics of a Transition System by Abstract Interpretation (Extended Abstract)(1997)45 cited
- → Extraction of strong typing laws from action semantics definitions(1992)11 cited
- An operational semantics of lazy evaluation for analysis(1993)
- A general schema for generating argumentation semantics from logic programming semantics(2008)
- → A uniform approach to logic programming semantics(2002)