Abstract interpretation: a kind of magic

DOI10.1016/0304-3975(94)00223-6zbMath0873.68046OpenAlexW2092817854MaRDI QIDQ673498

Ulf S. Nilsson

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00223-6

zbMATH Keywords

magic setsdeductive databases

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (2)

Analysis and Transformation of Constrained Horn Clauses for Program Verification ⋮ A simple correctness proof for magic transformation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bottom-up abstract interpretation of logic programs
• The Alexander Method - a technique for the processing of recursive axioms in deductive databases
• Some global optimizations for a PROLOG compiler
• A kripke-kleene semantics for logic programs*
• Abstract interpretation based on Alexander Templates
• The Semantics of Predicate Logic as a Programming Language
• Abstract interpretation of logic programs using magic transformations
• A practical framework for theabstract interpretation of logic programs

This page was built for publication: Abstract interpretation: a kind of magic