Transforming semantics by abstract interpretation

DOI10.1016/J.TCS.2004.12.021MaRDI QIDQ557807zbMATH OpenOpenAlexWikidataFDO

Authors 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

zbMATH Keywords

constraint programmingabstract interpretationdomain theorycompositionalitycomparative semantics

Mathematics Subject Classification ID

Continuous lattices and posets, applications (06B35) Semantics in the theory of computing (68Q55)

Recommendations

• 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

Cites work

• 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?)
• 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
• 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
• ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
• “Optimal” collecting semantics for analysis in a hierarchy of logic program semantics

Cited in

(6)

• scientific article; zbMATH DE number 2111735 (Why is no real title available?)
• Abstract interpretation
• scientific article; zbMATH DE number 2085260 (Why is no real title available?)
• Compositional characterization of observable program properties
• Constructing Specialized Shape Analyses for Uniform Change
• Transforming Abstract Interpretations by Abstract Interpretation

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)