Proving concurrent constraint programming correct, revisited

• Autor(a) principal: Vega, Carlos Alberto Olarte
• Data de Publicação: 2015
• Outros Autores: Pimentel, Elaine Gouvea
• Tipo de documento: Artigo
• Idioma: eng
• Título da fonte: Repositório Institucional da UFRN
• Texto Completo: https://repositorio.ufrn.br/jspui/handle/123456789/29762
• topic: Linear logic; Concurrent Constraint Programming; Proof Systems; Focusing; Fixed Points

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