Proving correctness of constraint logic programs with dynamic scheduling

DOI10.1007/3-540-61739-6_35MaRDI QIDQ5030189zbMATH OpenOpenAlexFDO

Authors 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

constraint systemdelay conditiondynamic schedulelogic programmingpredicate symbol

Mathematics Subject Classification ID

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

Recommendations

• Algebraic and logical semantics for CLP languages with dynamic scheduling
• Proving correctness of timed concurrent constraint programs
• scientific article; zbMATH DE number 2087421
• The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1
• Constraint logic programming with dynamic scheduling: A semantics based on closure operators

Cites work

• Cylindric algebras. Part II
• scientific article; zbMATH DE number 1638652 (Why is no real title available?)
• scientific article; zbMATH DE number 788038 (Why is no real title available?)
• Negation and control in PROLOG
• Soundness and Completeness of an Axiom System for Program Verification
• Termination of logic programs with delay declarations

Cited in

(4)

• Constraint logic programming with dynamic scheduling: A semantics based on closure operators
• Models and emerging trends of concurrent constraint programming
• Algebraic and logical semantics for CLP languages with dynamic scheduling
• Termination of simply moded logic programs with dynamic scheduling

This page was built for publication: Proving correctness of constraint logic programs with dynamic scheduling

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