Prime factorizations of abstract domains using first-order logic

DOI10.1007/3-540-61735-3_14MaRDI QIDQ2956723zbMATH OpenOpenAlexFDO

Authors Elena Marchiori

Publication date 19 January 2017

Published in Algebraic and Logic Programming (Search for Journal in Brave)

Full work available at URL https://ir.cwi.nl/pub/2625

Mathematics Subject Classification ID

Logic in computer science (03B70) Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Recommendations

• Feferman-vaught decompositions for prefix classes of first order logic
• scientific article; zbMATH DE number 139760
• A logic of abstraction related to finite constructive number classes
• Design of abstract domains using first-order logic
• scientific article; zbMATH DE number 3855070
• A domain-independent system for modeling number theory using first-order predicate logic
• FACTORIZATION IN PRÜFER DOMAINS
• Generalisation of first-order logic to nonatomic domains
• scientific article; zbMATH DE number 4145891
• scientific article; zbMATH DE number 16512

Cited in

(3)

• Design of abstract domains using first-order logic
• Algebraic power analysis by abstract interpretation
• Assertion based inductive verification methods for logic programs

This page was built for publication: Prime factorizations 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 Q2956723)