Transforming semantics by abstract interpretation
The most well-known structural properties of semantics, such as their precision, compositionality, and relation between complementary observables, by using standard abstract interpretation techniques are analyzed. It is proved that most of these properties can be characterized in terms of properties of the corresponding abstractions. This is achieved by isolating a suitable set of abstract domain transformers which allows one to design abstractions accordingly, providing a characterization of semantics of programming languages as solutions of simple abstract domain equations, involving both some basic observable property which has to be observed by the semantics and the abstract domain transformers necessary in order to achieve a suitable structural property.
- Transforming Abstract Interpretations by Abstract Interpretation
- Abstract interpretation from a denotational-semantics perspective
- Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
- scientific article; zbMATH DE number 2085260
- Making abstract models complete
- ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
- A compositional semantics for logic programs
- Abstract interpretation and application to logic programs
- An axiomatic basis for computer programming
- Complementing logic program semantics
- Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
- Constructive versions of Tarski's fixed point theorems
- Countable nondeterminism and random assignment
- Design, implementation, and evaluation of the constraint language cc(FD)
- Guarded commands, nondeterminacy and formal derivation of programs
- scientific article; zbMATH DE number 1696900 (Why is no real title available?)
- scientific article; zbMATH DE number 3175304 (Why is no real title available?)
- scientific article; zbMATH DE number 3942992 (Why is no real title available?)
- scientific article; zbMATH DE number 46487 (Why is no real title available?)
- scientific article; zbMATH DE number 3574936 (Why is no real title available?)
- scientific article; zbMATH DE number 1222407 (Why is no real title available?)
- scientific article; zbMATH DE number 1231565 (Why is no real title available?)
- scientific article; zbMATH DE number 783754 (Why is no real title available?)
- scientific article; zbMATH DE number 3204690 (Why is no real title available?)
- scientific article; zbMATH DE number 3339390 (Why is no real title available?)
- scientific article; zbMATH DE number 3090214 (Why is no real title available?)
- Logical optimality of groundness analysis
- Non-standard semantics for program slicing
- Recognizing safety and liveness
- Refining and compressing abstract domains
- The reduced relative power operation on abstract domains
- The structure of Galois connections
- Weak relative pseudo-complements of closure operators
- “Optimal” collecting semantics for analysis in a hierarchy of logic program semantics
- Towards a semantics-based information theory
- Transforming Abstract Interpretations by Abstract Interpretation
- Compositional characterization of observable program properties
- scientific article; zbMATH DE number 1231565 (Why is no real title available?)
- Abstract interpretation
- scientific article; zbMATH DE number 2085260 (Why is no real title available?)
- scientific article; zbMATH DE number 2111735 (Why is no real title available?)
- Constructing Specialized Shape Analyses for Uniform Change
This page was built for publication: Transforming semantics by abstract interpretation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557807)
