Proving Concurrent Constraint Programming Correct, Revisited | Zendy

Carlos Olarte | Zendy; Elaine Pimentel | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Proving Concurrent Constraint Programming Correct, Revisited

Author(s) -

Carlos Olarte,

Elaine Pimentel

Publication year - 2015

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2015.04.011

Subject(s) - concurrency , computer science , programming language , concurrent constraint logic programming , mathematical proof , declarative programming , logic programming , constraint programming , logical framework , constraint (computer aided design) , theoretical computer science , logical conjunction , simple (philosophy) , semantics (computer science) , constraint logic programming , constraint satisfaction , mathematics , functional logic programming , programming paradigm , inductive programming , artificial intelligence , mathematical optimization , philosophy , geometry , epistemology , probabilistic logic , stochastic programming

Concurrent Constraint Programming (CCP) is a simple and powerful model of concurrency where processes interact by telling and asking constraints into a global store of partial information. Since its inception, CCP has been endowed with declarative semantics where processes are interpreted as formulas in a given logic. This allows for the use of logical machinery to reason about the behavior of programs and to prove properties in a declarative way. Nevertheless, the logical characterization of CCP programs exhibits normally a weak level of adequacy since proofs in the logical system may not correspond directly to traces of the program. In this paper, relying on a focusing discipline, we show that it is possible to give a logical characterization to different CCP-based languages with the highest level of adequacy. We shall also provide a neater way of interpreting procedure calls by adding fixed points to the logical structure

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research