Design of abstract domains using first-order logic

DOI10.1016/S0304-3975(98)00231-XMaRDI QIDQ1960541zbMATH OpenOpenAlexFDO

Authors Elena Marchiori

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

zbMATH Keywords

abstract domainsfirst-order logicstatic analysis

Mathematics Subject Classification ID

Logic in computer science (03B70) Logic programming (68N17) Semantics in the theory of computing (68Q55)

Recommendations

• Prime factorizations of abstract domains using first-order logic
• scientific article; zbMATH DE number 1538024
• Abstract interpretation and application to logic programs
• Combinations of abstract domains for logic programming: Open product and generic pattern construction
• Evaluation of the domain prop

Cites work

• ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
• Comparison of abstract interpretations
• 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?)
• 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

Cited in

(4)

• The reduced relative power operation on abstract domains
• Combinations of abstract domains for logic programming: Open product and generic pattern construction
• Prime factorizations of abstract domains using first-order logic
• The reduced product of abstract domains and the combination of decision procedures

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)