Efficient analysis of concurrent constraint logic programs

DOI10.1007/3-540-56939-1_108zbMath1418.68052OpenAlexW1832894047MaRDI QIDQ4630298

Michael Codish, Kim Marriott, William Winsborough, Moreno Falaschi

Publication date: 29 March 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-56939-1_108

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Semantics in the theory of computing (68Q55) Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (4)

Confluence in concurrent constraint programming ⋮ A confluent calculus for concurrent constraint programming ⋮ Efficient analysis of concurrent constraint logic programs ⋮ Confluence in concurrent constraint programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Closures and fairness in the semantics of programming logic
• Deadlock absence proofs for networks of communicating processes
• Deadlock analysis in networks of communicating processes
• Efficient analysis of concurrent constraint logic programs

This page was built for publication: Efficient analysis of concurrent constraint logic programs