Design of abstract domains using first-order logic
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3978439 (Why is no real title available?)
- scientific article; zbMATH DE number 1222406 (Why is no real title available?)
- scientific article; zbMATH DE number 1761902 (Why is no real title available?)
- scientific article; zbMATH DE number 194916 (Why is no real title available?)
- Comparison of abstract interpretations
- Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
- On derived dependencies and connected databases
- Prime factorizations of abstract domains using first-order logic
- Reasoning about prolog programs: From modes through types to assertions
- Set-sharing is redundant for pair-sharing
- Some global optimizations for a PROLOG compiler
- Static analysis of logic programs for independent and parallelism
- Two classes of Boolean functions for dependency analysis
- ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
Cited in
(3)
This page was built for publication: Design of abstract domains using first-order logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1960541)