Operational semantics for reexecution-based analysis of logic programs with delay declarations

DOI10.1016/S1571-0661(04)00148-3MaRDI QIDQ4923517zbMATH OpenOpenAlexFDO

Authors Agostino Cortesi, Sabina Rossi, Baudouin Le Charlier

Publication date 24 May 2013

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s1571-0661(04)00148-3

Mathematics Subject Classification ID

Logic programming (68N17) Semantics in the theory of computing (68Q55)

Recommendations

• scientific article; zbMATH DE number 2084360
• Verification of logic programs with delay declarations
• Semantics of well-moded input consuming logic programs
• Inferring non-suspension conditions for logic programs with dynamic scheduling
• scientific article; zbMATH DE number 1956547

Cites work

• Combinations of abstract domains for logic programming: Open product and generic pattern construction
• Constraint logic programming with dynamic scheduling: A semantics based on closure operators
• Evaluation of the domain prop
• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• Negation and control in PROLOG
• Optimal groundness analysis using propositional logic
• Reexecution in abstract interpretation of prolog
• Systematic design of program transformation frameworks by abstract interpretation
• Termination of logic programs with delay declarations
• Verification of logic programs with delay declarations

Cited in

(2)

• scientific article; zbMATH DE number 1956547 (Why is no real title available?)
• scientific article; zbMATH DE number 2084360 (Why is no real title available?)

Describes a project that uses

Uses Software

• SICStus

This page was built for publication: Operational semantics for reexecution-based analysis of logic programs with delay declarations

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