Refining and compressing abstract domains

DOI10.1007/3-540-63165-8_230zbMath1401.68197OpenAlexW1559130486MaRDI QIDQ4572005

Roberto Giacobazzi, Francesco Ranzato

Publication date: 4 July 2018

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63165-8_230

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (16)

Pair-independence and freeness analysis through linear refinement. ⋮ Deriving escape analysis by abstract interpretation ⋮ Transforming Abstract Interpretations by Abstract Interpretation ⋮ Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation ⋮ Generalizing the Paige-Tarjan algorithm by abstract interpretation ⋮ An abstract interpretation-based model for safety semantics ⋮ On multi-language abstraction. Towards a static analysis of multi-language programs ⋮ Maximal incompleteness as obfuscation potency ⋮ Correctness kernels of abstract interpretations ⋮ Refining and Compressing Abstract Model Checking1 1The work is partially supported by MURST project: Certificazione automatica di programmi mediante interpretazione astratta. ⋮ Making abstract models complete ⋮ Transforming semantics by abstract interpretation ⋮ Deriving Bisimulations by Simplifying Partitions ⋮ Weakening additivity in adjoining closures ⋮ Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements ⋮ The reduced relative power operation on abstract domains

Cites Work

• Weak relative pseudo-complements of closure operators
• Combinations of abstract domains for logic programming: Open product and generic pattern construction
• Optimal domains for disjunctive abstract interpretation
• The closure operators of a lattice
• On the power of abstract interpretation
• Abstract interpretation and application to logic programs
• “Optimal” collecting semantics for analysis in a hierarchy of logic program semantics
• Systematic design of program transformation frameworks by abstract interpretation
• Unnamed Item

This page was built for publication: Refining and compressing abstract domains