Optimal domains for disjunctive abstract interpretation
From MaRDI portal
Publication:1818325
DOI10.1016/S0167-6423(97)00034-8zbMath0942.68020MaRDI QIDQ1818325
Francesco Ranzato, Roberto Giacobazzi
Publication date: 4 January 2000
Published in: Science of Computer Programming (Search for Journal in Brave)
68N17: Logic programming
Related Items
Refining and compressing abstract domains, Refining and Compressing Abstract Model Checking1 1The work is partially supported by MURST project: Certificazione automatica di programmi mediante interpretazione astratta., Transfer Function Synthesis without Quantifier Elimination, Why does Astrée scale up?, An efficient simulation algorithm based on abstract interpretation, Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements, The reduced relative power operation on abstract domains, Closures on CPOs form complete lattices, The powerset operator on abstract interpretations, Correctness kernels of abstract interpretations, Weakening additivity in adjoining closures, Complete Abstractions and Subclassical Modal Logics, Linear Absolute Value Relation Analysis, Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships, Transforming Abstract Interpretations by Abstract Interpretation
