Transforming semantics by abstract interpretation
From MaRDI portal
Publication:557807
DOI10.1016/j.tcs.2004.12.021zbMath1080.68061WikidataQ62046240 ScholiaQ62046240MaRDI QIDQ557807
Roberto Giacobazzi, Isabella Mastroeni
Publication date: 30 June 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.12.021
compositionality; constraint programming; domain theory; abstract interpretation; comparative semantics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
- Recognizing safety and liveness
- Constructive versions of Tarski's fixed point theorems
- Weak relative pseudo-complements of closure operators
- The reduced relative power operation on abstract domains
- A compositional semantics for logic programs
- Non-standard semantics for program slicing
- Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
- Logical optimality of groundness analysis
- The structure of Galois connections
- Complementing logic program semantics
- Countable nondeterminism and random assignment
- Abstract interpretation and application to logic programs
- Guarded commands, nondeterminacy and formal derivation of programs
- Design, implementation, and evaluation of the constraint language cc(FD)
- Refining and compressing abstract domains
- “Optimal” collecting semantics for analysis in a hierarchy of logic program semantics
- An axiomatic basis for computer programming