Design of abstract domains using first-order logic
From MaRDI portal
Publication:1960541
DOI10.1016/S0304-3975(98)00231-XzbMath0930.68083OpenAlexW2090777811MaRDI QIDQ1960541
Publication date: 12 January 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00231-x
Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Logic programming (68N17)
Cites Work
- ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
- Reasoning about prolog programs: From modes through types to assertions
- Set-sharing is redundant for pair-sharing
- Two classes of Boolean functions for dependency analysis
- Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
- Prime factorizations of abstract domains using first-order logic
- Some global optimizations for a PROLOG compiler
- On derived dependencies and connected databases
- Static analysis of logic programs for independent and parallelism
- Comparison of abstract interpretations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Design of abstract domains using first-order logic
