Refining and compressing abstract domains

DOI10.1007/3-540-63165-8_230zbMATH Open1401.68197OpenAlexW1559130486MaRDI QIDQ4572005FDOQ4572005

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1953028
• The powerset operator on abstract interpretations
• Making abstract domains condensing
• Refining abstract interpretations
• Optimal domains for disjunctive abstract interpretation

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (18)

• Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements
• Deriving Bisimulations by Simplifying Partitions
• An abstract interpretation-based model for safety semantics
• On multi-language abstraction. Towards a static analysis of multi-language programs
• Deriving escape analysis by abstract interpretation
• Transforming semantics by abstract interpretation
• Refining and compressing abstract model checking
• Making abstract models complete
• Weakening additivity in adjoining closures
• Generalizing the Paige-Tarjan algorithm by abstract interpretation
• The reduced relative power operation on abstract domains
• Affine Loop Invariant Generation via Matrix Algebra
• Title not available (Why is that?)
• Correctness kernels of abstract interpretations
• Pair-independence and freeness analysis through linear refinement.
• Maximal incompleteness as obfuscation potency
• Transforming Abstract Interpretations by Abstract Interpretation
• Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4572005)