Proving concurrent constraint programming correct, revisited

Vega, Carlos Alberto Olarte; Pimentel, Elaine Gouvea

Proving concurrent constraint programming correct, revisited

Página do item simplificado Estatísticas

dc.contributor.author	Vega, Carlos Alberto Olarte
dc.contributor.author	Pimentel, Elaine Gouvea
dc.date.accessioned	2020-07-30T19:21:51Z
dc.date.available	2020-07-30T19:21:51Z
dc.date.issued	2015
dc.description.resumo	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	pt_BR
dc.identifier.citation	OLARTE, Carlos; PIMENTEL, Elaine. Proving Concurrent Constraint Programming Correct, Revisited. Electronic Notes In Theoretical Computer Science, [S.L.], v. 312, p. 179-195, abr. 2015. Disponível em: https://www.sciencedirect.com/science/article/pii/S1571066115000158?via%3Dihub. Acesso em: 29 jul. 2020. http://dx.doi.org/10.1016/j.entcs.2015.04.011	pt_BR
dc.identifier.doi	10.1016/j.entcs.2015.04.011
dc.identifier.issn	1571-0661
dc.identifier.uri	https://repositorio.ufrn.br/jspui/handle/123456789/29762
dc.language	en	pt_BR
dc.publisher	Elsevier	pt_BR
dc.subject	Linear logic	pt_BR
dc.subject	Concurrent Constraint Programming	pt_BR
dc.subject	Proof Systems	pt_BR
dc.subject	Focusing	pt_BR
dc.subject	Fixed Points	pt_BR
dc.title	Proving concurrent constraint programming correct, revisited	pt_BR
dc.type	article	pt_BR