Proving correctness of Constraint Logic Programs with dynamic scheduling

DOI10.1007/3-540-61739-6_35zbMath1482.68086OpenAlexW2164547345MaRDI QIDQ5030189

Maurizio Gabbrielli, Catuscia Palamidessi, Frank S. de Boer

Publication date: 16 February 2022

Published in: Static Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61739-6_35

zbMATH Keywords

logic programmingconstraint systemdynamic schedulepredicate symboldelay condition

Mathematics Subject Classification ID

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

Related Items (1)

Models and emerging trends of concurrent constraint programming

Cites Work

• Unnamed Item
• Unnamed Item
• Cylindric algebras. Part II
• Negation and control in PROLOG
• Soundness and Completeness of an Axiom System for Program Verification
• Termination of logic programs with delay declarations

This page was built for publication: Proving correctness of Constraint Logic Programs with dynamic scheduling