A proof-theoretic approach to the static analysis of logic programs

MaRDI QIDQ3086788zbMATH OpenFDO

Authors

Publication date 30 March 2011

zbMATH Keywords

static analysislogic programsapproximation of data structures

Mathematics Subject Classification ID

Data structures (68P05) Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Logic in computer science (03B70)

Recommendations

• scientific article; zbMATH DE number 879004
• On the complexity analysis of static analyses
• Logical approximation for program analysis
• Static analysis, abstract interpretation and verification in (constraint logic) programming
• scientific article; zbMATH DE number 1953280

Cited in

(6)

• Automatic inference of determinacy and mutual exclusion for logic programs using mode and type analyses
• Verifying Tight Logic Programs with anthem and vampire
• Logical approximation for program analysis
• scientific article; zbMATH DE number 1834571 (Why is no real title available?)
• scientific article; zbMATH DE number 1953280 (Why is no real title available?)
• A Survey of the Proof-Theoretic Foundations of Logic Programming

Describes a project that uses

Uses Software

• ETPS

This page was built for publication: A proof-theoretic approach to the static analysis of logic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3086788)