Abstract interpretation of temporal concurrent constraint programs

Detalhes bibliográficos
Autor(a) principal: Falaschi, Moreno
Data de Publicação: 2014
Outros Autores: Palamidessi, Catuscia, Vega, Carlos Alberto Olarte
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Institucional da UFRN
Texto Completo: https://repositorio.ufrn.br/jspui/handle/123456789/29777
Resumo: Timed Concurrent Constraint Programming (tcc) is a declarative model for concurrency offering a logic for specifying reactive systems, i.e., systems that continuously interact with the environment. The universal tcc formalism (utcc) is an extension of tcc with the ability to express mobility. Here mobility is understood as communication of private names as typically done for mobile systems and security protocols. In this paper we consider the denotational semantics for tcc, and extend it to a “collecting” semantics for utcc based on closure operators over sequences of constraints. Relying on this semantics, we formalize a general framework for data flow analyses of tcc and utcc programs by abstract interpretation techniques. The concrete and abstract semantics that we propose are compositional, thus allowing us to reduce the complexity of data flow analyses. We show that our method is sound and parametric with respect to the abstract domain. Thus, different analyses can be performed by instantiating the framework. We illustrate how it is possible to reuse abstract domains previously defined for logic programming to perform, for instance, a groundness analysis for tcc programs. We show the applicability of this analysis in the context of reactive systems. Furthermore, we also make use of the abstract semantics to exhibit a secrecy flaw in a security protocol. We also show how it is possible to make an analysis which may show that tcc programs are suspension-free. This can be useful for several purposes, such as for optimizing compilation or for debugging
id UFRN_13b1d5c12568acc754315b849bd5cd4e
oai_identifier_str oai:https://repositorio.ufrn.br:123456789/29777
network_acronym_str UFRN
network_name_str Repositório Institucional da UFRN
repository_id_str
spelling Falaschi, MorenoPalamidessi, CatusciaVega, Carlos Alberto Olarte2020-08-03T20:04:37Z2020-08-03T20:04:37Z2014FALASCHI, Moreno; OLARTE, Carlos; PALAMIDESSI, Catuscia. Abstract interpretation of temporal concurrent constraint programs. Theory and Practice of Logic Programming, [S.L.], v. 15, n. 3, p. 312-357, 10 fev. 2014. Disponível em: https://www.cambridge.org/core/journals/theory-and-practice-of-logic-programming/article/abstract-interpretation-of-temporal-concurrent-constraint-programs/79AB54B8007AA797C1631A461FD7CE2B. Acesso em: 30 jul. 2020. https://doi.org/10.1017/S14710684130006411475-3081https://repositorio.ufrn.br/jspui/handle/123456789/2977710.1017/S1471068413000641Cambridge University PressTimed concurrent constraint programmingProcess calculiAbstract interpretationDenotational semanticsReactive systemsAbstract interpretation of temporal concurrent constraint programsinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleTimed Concurrent Constraint Programming (tcc) is a declarative model for concurrency offering a logic for specifying reactive systems, i.e., systems that continuously interact with the environment. The universal tcc formalism (utcc) is an extension of tcc with the ability to express mobility. Here mobility is understood as communication of private names as typically done for mobile systems and security protocols. In this paper we consider the denotational semantics for tcc, and extend it to a “collecting” semantics for utcc based on closure operators over sequences of constraints. Relying on this semantics, we formalize a general framework for data flow analyses of tcc and utcc programs by abstract interpretation techniques. The concrete and abstract semantics that we propose are compositional, thus allowing us to reduce the complexity of data flow analyses. We show that our method is sound and parametric with respect to the abstract domain. Thus, different analyses can be performed by instantiating the framework. We illustrate how it is possible to reuse abstract domains previously defined for logic programming to perform, for instance, a groundness analysis for tcc programs. We show the applicability of this analysis in the context of reactive systems. Furthermore, we also make use of the abstract semantics to exhibit a secrecy flaw in a security protocol. We also show how it is possible to make an analysis which may show that tcc programs are suspension-free. This can be useful for several purposes, such as for optimizing compilation or for debuggingengreponame:Repositório Institucional da UFRNinstname:Universidade Federal do Rio Grande do Norte (UFRN)instacron:UFRNinfo:eu-repo/semantics/openAccessORIGINALAbstractInterpretationPrograms_VEGA_2014.pdfAbstractInterpretationPrograms_VEGA_2014.pdfapplication/pdf1263800https://repositorio.ufrn.br/bitstream/123456789/29777/1/AbstractInterpretationPrograms_VEGA_2014.pdf9dd2f4d4579f14d06cff97e934218007MD51LICENSElicense.txtlicense.txttext/plain; charset=utf-81484https://repositorio.ufrn.br/bitstream/123456789/29777/2/license.txte9597aa2854d128fd968be5edc8a28d9MD52TEXTAbstractInterpretationPrograms_VEGA_2014.pdf.txtAbstractInterpretationPrograms_VEGA_2014.pdf.txtExtracted texttext/plain144688https://repositorio.ufrn.br/bitstream/123456789/29777/3/AbstractInterpretationPrograms_VEGA_2014.pdf.txt2285ecd5c6eee448f900812f47e8b53aMD53THUMBNAILAbstractInterpretationPrograms_VEGA_2014.pdf.jpgAbstractInterpretationPrograms_VEGA_2014.pdf.jpgGenerated Thumbnailimage/jpeg1540https://repositorio.ufrn.br/bitstream/123456789/29777/4/AbstractInterpretationPrograms_VEGA_2014.pdf.jpg98b3453d4a1406f8029364cc0a6a67c2MD54123456789/297772020-08-04 22:39:44.222oai:https://repositorio.ufrn.br:123456789/29777Tk9OLUVYQ0xVU0lWRSBESVNUUklCVVRJT04gTElDRU5TRQoKCkJ5IHNpZ25pbmcgYW5kIGRlbGl2ZXJpbmcgdGhpcyBsaWNlbnNlLCBNci4gKGF1dGhvciBvciBjb3B5cmlnaHQgaG9sZGVyKToKCgphKSBHcmFudHMgdGhlIFVuaXZlcnNpZGFkZSBGZWRlcmFsIFJpbyBHcmFuZGUgZG8gTm9ydGUgdGhlIG5vbi1leGNsdXNpdmUgcmlnaHQgb2YKcmVwcm9kdWNlLCBjb252ZXJ0IChhcyBkZWZpbmVkIGJlbG93KSwgY29tbXVuaWNhdGUgYW5kIC8gb3IKZGlzdHJpYnV0ZSB0aGUgZGVsaXZlcmVkIGRvY3VtZW50IChpbmNsdWRpbmcgYWJzdHJhY3QgLyBhYnN0cmFjdCkgaW4KZGlnaXRhbCBvciBwcmludGVkIGZvcm1hdCBhbmQgaW4gYW55IG1lZGl1bS4KCmIpIERlY2xhcmVzIHRoYXQgdGhlIGRvY3VtZW50IHN1Ym1pdHRlZCBpcyBpdHMgb3JpZ2luYWwgd29yaywgYW5kIHRoYXQKeW91IGhhdmUgdGhlIHJpZ2h0IHRvIGdyYW50IHRoZSByaWdodHMgY29udGFpbmVkIGluIHRoaXMgbGljZW5zZS4gRGVjbGFyZXMKdGhhdCB0aGUgZGVsaXZlcnkgb2YgdGhlIGRvY3VtZW50IGRvZXMgbm90IGluZnJpbmdlLCBhcyBmYXIgYXMgaXQgaXMKdGhlIHJpZ2h0cyBvZiBhbnkgb3RoZXIgcGVyc29uIG9yIGVudGl0eS4KCmMpIElmIHRoZSBkb2N1bWVudCBkZWxpdmVyZWQgY29udGFpbnMgbWF0ZXJpYWwgd2hpY2ggZG9lcyBub3QKcmlnaHRzLCBkZWNsYXJlcyB0aGF0IGl0IGhhcyBvYnRhaW5lZCBhdXRob3JpemF0aW9uIGZyb20gdGhlIGhvbGRlciBvZiB0aGUKY29weXJpZ2h0IHRvIGdyYW50IHRoZSBVbml2ZXJzaWRhZGUgRmVkZXJhbCBkbyBSaW8gR3JhbmRlIGRvIE5vcnRlIHRoZSByaWdodHMgcmVxdWlyZWQgYnkgdGhpcyBsaWNlbnNlLCBhbmQgdGhhdCB0aGlzIG1hdGVyaWFsIHdob3NlIHJpZ2h0cyBhcmUgb2YKdGhpcmQgcGFydGllcyBpcyBjbGVhcmx5IGlkZW50aWZpZWQgYW5kIHJlY29nbml6ZWQgaW4gdGhlIHRleHQgb3IKY29udGVudCBvZiB0aGUgZG9jdW1lbnQgZGVsaXZlcmVkLgoKSWYgdGhlIGRvY3VtZW50IHN1Ym1pdHRlZCBpcyBiYXNlZCBvbiBmdW5kZWQgb3Igc3VwcG9ydGVkIHdvcmsKYnkgYW5vdGhlciBpbnN0aXR1dGlvbiBvdGhlciB0aGFuIHRoZSBVbml2ZXJzaWRhZGUgRmVkZXJhbCBkbyBSaW8gR3JhbmRlIGRvIE5vcnRlLCBkZWNsYXJlcyB0aGF0IGl0IGhhcyBmdWxmaWxsZWQgYW55IG9ibGlnYXRpb25zIHJlcXVpcmVkIGJ5IHRoZSByZXNwZWN0aXZlIGFncmVlbWVudCBvciBhZ3JlZW1lbnQuCgpUaGUgVW5pdmVyc2lkYWRlIEZlZGVyYWwgZG8gUmlvIEdyYW5kZSBkbyBOb3J0ZSB3aWxsIGNsZWFybHkgaWRlbnRpZnkgaXRzIG5hbWUgKHMpIGFzIHRoZSBhdXRob3IgKHMpIG9yIGhvbGRlciAocykgb2YgdGhlIGRvY3VtZW50J3MgcmlnaHRzCmRlbGl2ZXJlZCwgYW5kIHdpbGwgbm90IG1ha2UgYW55IGNoYW5nZXMsIG90aGVyIHRoYW4gdGhvc2UgcGVybWl0dGVkIGJ5CnRoaXMgbGljZW5zZQo=Repositório de PublicaçõesPUBhttp://repositorio.ufrn.br/oai/opendoar:2020-08-05T01:39:44Repositório Institucional da UFRN - Universidade Federal do Rio Grande do Norte (UFRN)false
dc.title.pt_BR.fl_str_mv Abstract interpretation of temporal concurrent constraint programs
title Abstract interpretation of temporal concurrent constraint programs
spellingShingle Abstract interpretation of temporal concurrent constraint programs
Falaschi, Moreno
Timed concurrent constraint programming
Process calculi
Abstract interpretation
Denotational semantics
Reactive systems
title_short Abstract interpretation of temporal concurrent constraint programs
title_full Abstract interpretation of temporal concurrent constraint programs
title_fullStr Abstract interpretation of temporal concurrent constraint programs
title_full_unstemmed Abstract interpretation of temporal concurrent constraint programs
title_sort Abstract interpretation of temporal concurrent constraint programs
author Falaschi, Moreno
author_facet Falaschi, Moreno
Palamidessi, Catuscia
Vega, Carlos Alberto Olarte
author_role author
author2 Palamidessi, Catuscia
Vega, Carlos Alberto Olarte
author2_role author
author
dc.contributor.author.fl_str_mv Falaschi, Moreno
Palamidessi, Catuscia
Vega, Carlos Alberto Olarte
dc.subject.por.fl_str_mv Timed concurrent constraint programming
Process calculi
Abstract interpretation
Denotational semantics
Reactive systems
topic Timed concurrent constraint programming
Process calculi
Abstract interpretation
Denotational semantics
Reactive systems
description Timed Concurrent Constraint Programming (tcc) is a declarative model for concurrency offering a logic for specifying reactive systems, i.e., systems that continuously interact with the environment. The universal tcc formalism (utcc) is an extension of tcc with the ability to express mobility. Here mobility is understood as communication of private names as typically done for mobile systems and security protocols. In this paper we consider the denotational semantics for tcc, and extend it to a “collecting” semantics for utcc based on closure operators over sequences of constraints. Relying on this semantics, we formalize a general framework for data flow analyses of tcc and utcc programs by abstract interpretation techniques. The concrete and abstract semantics that we propose are compositional, thus allowing us to reduce the complexity of data flow analyses. We show that our method is sound and parametric with respect to the abstract domain. Thus, different analyses can be performed by instantiating the framework. We illustrate how it is possible to reuse abstract domains previously defined for logic programming to perform, for instance, a groundness analysis for tcc programs. We show the applicability of this analysis in the context of reactive systems. Furthermore, we also make use of the abstract semantics to exhibit a secrecy flaw in a security protocol. We also show how it is possible to make an analysis which may show that tcc programs are suspension-free. This can be useful for several purposes, such as for optimizing compilation or for debugging
publishDate 2014
dc.date.issued.fl_str_mv 2014
dc.date.accessioned.fl_str_mv 2020-08-03T20:04:37Z
dc.date.available.fl_str_mv 2020-08-03T20:04:37Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.citation.fl_str_mv FALASCHI, Moreno; OLARTE, Carlos; PALAMIDESSI, Catuscia. Abstract interpretation of temporal concurrent constraint programs. Theory and Practice of Logic Programming, [S.L.], v. 15, n. 3, p. 312-357, 10 fev. 2014. Disponível em: https://www.cambridge.org/core/journals/theory-and-practice-of-logic-programming/article/abstract-interpretation-of-temporal-concurrent-constraint-programs/79AB54B8007AA797C1631A461FD7CE2B. Acesso em: 30 jul. 2020. https://doi.org/10.1017/S1471068413000641
dc.identifier.uri.fl_str_mv https://repositorio.ufrn.br/jspui/handle/123456789/29777
dc.identifier.issn.none.fl_str_mv 1475-3081
dc.identifier.doi.none.fl_str_mv 10.1017/S1471068413000641
identifier_str_mv FALASCHI, Moreno; OLARTE, Carlos; PALAMIDESSI, Catuscia. Abstract interpretation of temporal concurrent constraint programs. Theory and Practice of Logic Programming, [S.L.], v. 15, n. 3, p. 312-357, 10 fev. 2014. Disponível em: https://www.cambridge.org/core/journals/theory-and-practice-of-logic-programming/article/abstract-interpretation-of-temporal-concurrent-constraint-programs/79AB54B8007AA797C1631A461FD7CE2B. Acesso em: 30 jul. 2020. https://doi.org/10.1017/S1471068413000641
1475-3081
10.1017/S1471068413000641
url https://repositorio.ufrn.br/jspui/handle/123456789/29777
dc.language.iso.fl_str_mv eng
language eng
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.publisher.none.fl_str_mv Cambridge University Press
publisher.none.fl_str_mv Cambridge University Press
dc.source.none.fl_str_mv reponame:Repositório Institucional da UFRN
instname:Universidade Federal do Rio Grande do Norte (UFRN)
instacron:UFRN
instname_str Universidade Federal do Rio Grande do Norte (UFRN)
instacron_str UFRN
institution UFRN
reponame_str Repositório Institucional da UFRN
collection Repositório Institucional da UFRN
bitstream.url.fl_str_mv https://repositorio.ufrn.br/bitstream/123456789/29777/1/AbstractInterpretationPrograms_VEGA_2014.pdf
https://repositorio.ufrn.br/bitstream/123456789/29777/2/license.txt
https://repositorio.ufrn.br/bitstream/123456789/29777/3/AbstractInterpretationPrograms_VEGA_2014.pdf.txt
https://repositorio.ufrn.br/bitstream/123456789/29777/4/AbstractInterpretationPrograms_VEGA_2014.pdf.jpg
bitstream.checksum.fl_str_mv 9dd2f4d4579f14d06cff97e934218007
e9597aa2854d128fd968be5edc8a28d9
2285ecd5c6eee448f900812f47e8b53a
98b3453d4a1406f8029364cc0a6a67c2
bitstream.checksumAlgorithm.fl_str_mv MD5
MD5
MD5
MD5
repository.name.fl_str_mv Repositório Institucional da UFRN - Universidade Federal do Rio Grande do Norte (UFRN)
repository.mail.fl_str_mv
_version_ 1802117817637535744