Operational Semantics for Reexecution-based Analysis of Logic Programs with Delay Declarations

DOI10.1016/S1571-0661(04)00148-3zbMath1263.68035OpenAlexW2038396541MaRDI QIDQ4923517

Sabina Rossi, Baudouin Le Charlier, Agostino Cortesi

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

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

Uses Software

• SICStus

Cites Work

• Unnamed Item
• Negation and control in PROLOG
• Constraint logic programming with dynamic scheduling: A semantics based on closure operators
• Combinations of abstract domains for logic programming: Open product and generic pattern construction
• Reexecution in abstract interpretation of prolog
• Evaluation of the domain prop
• Optimal groundness analysis using propositional logic
• Termination of logic programs with delay declarations
• Verification of logic programs with delay declarations
• Systematic design of program transformation frameworks by abstract interpretation

This page was built for publication: Operational Semantics for Reexecution-based Analysis of Logic Programs with Delay Declarations