Abstract interpretation of temporal concurrent constraint programs

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 m...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Theory and practice of logic programming Ročník 15; číslo 3; s. 312 - 357
Hlavní autori:	FALASCHI, MORENO, OLARTE, CARLOS, PALAMIDESSI, CATUSCIA
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Cambridge, UK Cambridge University Press 01.05.2015 Cambridge University Press (CUP)
Predmet:	Computer Science Data flow analysis Logic Logic in Computer Science Logic programming Mobile communication systems Regular Papers Reuse Secrecy aspects Security Semantics abstract interpretation process calculi timed concurrent constraint programming reactive systems denotational semantics
ISSN:	1471-0684, 1475-3081
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Abstract	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.
AbstractList	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. 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 abil- ity 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 we 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 inter- pretation techniques. The concrete and abstract semantics 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 make also 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. 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. Abstract Timed Concurrent Constraint Programming () is a declarative model for concurrency offering a logic for specifying reactive systems, i.e., systems that continuously interact with the environment. The universal formalism () is an extension of 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 , and extend it to a "collecting" semantics for based on closure operators over sequences of constraints. Relying on this semantics, we formalize a general framework for data flow analyses of and 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 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 programs are suspension-free. This can be useful for several purposes, such as for optimizing compilation or for debugging.
Author	FALASCHI, MORENO OLARTE, CARLOS PALAMIDESSI, CATUSCIA
Author_xml	– sequence: 1 givenname: MORENO surname: FALASCHI fullname: FALASCHI, MORENO email: moreno.falaschi@unisi.it organization: Dipartimento di Ingegneria dell'Informazione e Scienze Matematiche Università di Siena, Siena, Italy (e-mail: moreno.falaschi@unisi.it) – sequence: 2 givenname: CARLOS surname: OLARTE fullname: OLARTE, CARLOS email: carlosolarte@javerianacali.edu.co organization: Departamento de Electrónica y Ciencias de la Computación Pontificia Universidad Javeriana, Cali, Colombia (e-mail: carlosolarte@javerianacali.edu.co) – sequence: 3 givenname: CATUSCIA surname: PALAMIDESSI fullname: PALAMIDESSI, CATUSCIA email: catuscia@lix.polytechnique.fr organization: INRIA and LIX Ecole Polytechnique, Palaiseau, France (e-mail: catuscia@lix.polytechnique.fr)
BackLink	https://inria.hal.science/hal-00945462$$DView record in HAL
BookMark	eNp9kVFLwzAQgINMcE5_gG8FX_Shete0Sfs4hzph4IP6HNIsnR1tM5NM8N-b2gky0adcLt93XO6OyagznSbkDOEKAfn1E6YcgeUpUgBgKR6QcUhlMYUcR18xxv37ETl2bg2AjCbpmNxMS-etVD6qO6_txmovfW26yFSR1-3GWNlEynRqa63ufB_2fICjjTUrK1t3Qg4r2Th9ujsn5OXu9nk2jxeP9w-z6SJWGeM-zjnwhGOi5JJppJlKuJQcClUwCWkRbqUuscyRJyrRDCiVGZTBoVXFqyWjE3I51H2VjdjYupX2QxhZi_l0IfocQJFmKUveMbAXAxuafNtq50VbO6WbRnbabJ1Almc8zwGygJ7voWuztV34SaB4gsBp1hfkA6Wscc7qSqh6mFQ_jUYgiH4P4tcegol75nfv_zl058i2tPVypX809af1CXGLmN0
CitedBy_id	crossref_primary_10_1007_s00165_016_0409_8 crossref_primary_10_1016_j_tcs_2021_03_024 crossref_primary_10_3390_en10122113
Cites_doi	10.1016/0743-1066(92)90030-7 10.1016/0743-1066(95)00038-0 10.1016/0304-3975(84)90119-1 10.1145/177492.177656 10.1007/3-540-48224-5_55 10.1016/S0167-6423(96)00039-1 10.1109/LICS.1988.5132 10.1006/inco.1997.2638 10.1007/s10207-007-0041-y 10.1017/S1471068411000135 10.1016/0890-5401(92)90008-4 10.1016/S1571-0661(05)80291-9 10.1109/TIT.1983.1056650 10.1016/S0743-1066(96)00013-1 10.3233/JCS-2001-91-203 10.1006/inco.1999.2879 10.1006/inco.2000.3002 10.1016/0167-6423(92)90005-V 10.1016/S0304-3975(97)00328-9 10.1016/S0743-1066(98)10006-7 10.1016/0304-3975(95)00047-Z 10.1007/s10601-013-9145-3 10.1145/72551.72555 10.7551/mitpress/2086.001.0001 10.1145/265943.265954 10.1007/BFb0016844 10.1017/S1471068406002675 10.1109/LICS.1994.316085 10.1145/330249.330252 10.1145/1363686.1363726 10.3233/JCS-2010-0361
ContentType	Journal Article
Copyright	Copyright © Cambridge University Press 2014 Distributed under a Creative Commons Attribution 4.0 International License
Copyright_xml	– notice: Copyright © Cambridge University Press 2014 – notice: Distributed under a Creative Commons Attribution 4.0 International License
DBID	AAYXX CITATION 3V. 7SC 7XB 8AL 8FD 8FE 8FG 8FK ABUWG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ HCIFZ JQ2 K7- L7M L~C L~D M0N P5Z P62 PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI PRINS Q9U 1XC VOOES
DOI	10.1017/S1471068413000641
DatabaseName	CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts ProQuest Central (purchase pre-March 2016) Computing Database (Alumni Edition) Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials - QC ProQuest Central (New) Technology Collection ProQuest One ProQuest Central ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Computing Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Databases ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China ProQuest Central Basic Hyper Article en Ligne (HAL) Hyper Article en Ligne (HAL) (Open Access)
DatabaseTitle	CrossRef Computer Science Database ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Central Korea ProQuest Central (New) Advanced Technologies Database with Aerospace Advanced Technologies & Aerospace Collection ProQuest Computing ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest One Academic UKI Edition ProQuest One Academic ProQuest Central (Alumni) ProQuest One Academic (New)
DatabaseTitleList	Computer and Information Systems Abstracts CrossRef Computer Science Database
Database_xml	– sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science
DocumentTitleAlternate	Abstract interpretation of temporal CCP M. Falaschi et al.
EISSN	1475-3081
EndPage	357
ExternalDocumentID	oai:HAL:hal-00945462v1 3650515921 10_1017_S1471068413000641
Genre	Feature
GroupedDBID	-E. .FH 09C 09E 0E1 0R~ 123 29Q 3V. 4.4 5VS 74X 74Y 7~V 8FE 8FG 8R4 8R5 AAAZR AABES AABWE AACJH AAEED AAFUK AAGFV AAKTX AANRG AARAB AASVR AAUKB AAYOK ABBXD ABITZ ABJNI ABKKG ABMWE ABMYL ABQTM ABQWD ABROB ABTCQ ABUWG ABZCX ACBMC ACCHT ACGFS ACIMK ACNCT ACQFJ ACREK ACUIJ ACUYZ ACWGA ACYZP ACZBM ACZUX ACZWT ADCGK ADDNB ADFEC ADGEJ ADKIL ADOCW ADOVH ADVJH AEBAK AEHGV AEMTW AENEX AENGE AEYYC AFFUJ AFKQG AFKRA AFKSM AFLOS AFLVW AFUTZ AGABE AGBYD AGJUD AGOOT AHQXX AHRGI AIGNW AIHIV AIOIP AISIE AJ7 AJCYY AJPFC AJQAS ALMA_UNASSIGNED_HOLDINGS ALVPG ALWZO AQJOH ARABE ARAPS ATUCA AUXHV AZQEC BBLKV BENPR BGHMG BGLVJ BLZWO BMAJL BPHCQ C0O CAG CBIIA CCPQU CCQAD CCTKK CFAFE CHEAL CJCSC COF CS3 DC4 DOHLZ DU5 DWQXO EBS EJD GNUQQ HCIFZ HG- HST HZ~ I.6 IH6 IOEEP IPYYG IS6 I~P J36 J38 J3A J9A JHPGK JQKCU K6V K7- KCGVB KFECR L98 LW7 M-V M0N NIKVX O9- OK1 OYBOY P2P P62 PQQKQ PROAC PYCCK Q2X RAMDC RCA ROL RR0 S6- S6U SAAAG T9M UT1 WFFJZ WQ3 WXU WXY WYP ZYDXJ AAYXX ABGDZ ABVKB ABVZP ABXHF ACAJB ACDLN AFFHD AFZFC AKMAY CITATION PHGZM PHGZT PQGLB 7SC 7XB 8AL 8FD 8FK JQ2 L7M L~C L~D PKEHL PQEST PQUKI PRINS Q9U 1XC VOOES
ID	FETCH-LOGICAL-c567t-87072712cad6e135c27aa709c96a04927abeb1b8172c2e6033a50b0723ff7fd63
IEDL.DBID	K7-
ISICitedReferencesCount	8
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000351762100002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1471-0684
IngestDate	Sat Nov 29 15:08:56 EST 2025 Sun Nov 09 13:30:40 EST 2025 Mon Jul 14 09:06:09 EDT 2025 Sat Nov 29 04:58:35 EST 2025 Tue Nov 18 19:37:50 EST 2025 Wed Mar 13 05:51:43 EDT 2024
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	3
Keywords	abstract interpretation process calculi timed concurrent constraint programming reactive systems denotational semantics
Language	English
License	https://www.cambridge.org/core/terms Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c567t-87072712cad6e135c27aa709c96a04927abeb1b8172c2e6033a50b0723ff7fd63
Notes	SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23
ORCID	0000-0003-4597-7002
OpenAccessLink	https://inria.hal.science/hal-00945462
PQID	1672107351
PQPubID	43613
PageCount	46
ParticipantIDs	hal_primary_oai_HAL_hal_00945462v1 proquest_miscellaneous_1685788005 proquest_journals_1672107351 crossref_citationtrail_10_1017_S1471068413000641 crossref_primary_10_1017_S1471068413000641 cambridge_journals_10_1017_S1471068413000641
PublicationCentury	2000
PublicationDate	2015-05-01
PublicationDateYYYYMMDD	2015-05-01
PublicationDate_xml	– month: 05 year: 2015 text: 2015-05-01 day: 01
PublicationDecade	2010
PublicationPlace	Cambridge, UK
PublicationPlace_xml	– name: Cambridge, UK – name: Cambridge
PublicationTitle	Theory and practice of logic programming
PublicationTitleAlternate	Theory and Practice of Logic Programming
PublicationYear	2015
Publisher	Cambridge University Press Cambridge University Press (CUP)
Publisher_xml	– name: Cambridge University Press – name: Cambridge University Press (CUP)
References	Olarte (S1471068413000641_ref40) 2008 Nielsen (S1471068413000641_ref38) 2002 S1471068413000641_ref28 Codish (S1471068413000641_ref6) 1994 S1471068413000641_ref26 S1471068413000641_ref24 S1471068413000641_ref21 S1471068413000641_ref20 Lowe (S1471068413000641_ref33) 1996; 17 Saraswat (S1471068413000641_ref44) 1991 Mendler (S1471068413000641_ref35) 1995; 2 López (S1471068413000641_ref32) 2009 Falaschi (S1471068413000641_ref22) 2009 Nielsen (S1471068413000641_ref37) 2002; 9 S1471068413000641_ref39 S1471068413000641_ref36 Falaschi (S1471068413000641_ref23) 2007 S1471068413000641_ref34 Hildebrandt (S1471068413000641_ref29) 2009 Jagadeesan (S1471068413000641_ref31) 2005 Fiore (S1471068413000641_ref25) 2001 Cousot (S1471068413000641_ref11) 1979 Saraswat (S1471068413000641_ref42) 1993 S1471068413000641_ref49 S1471068413000641_ref47 S1471068413000641_ref48 S1471068413000641_ref45 S1471068413000641_ref46 S1471068413000641_ref43 S1471068413000641_ref41 Haemmerlé (S1471068413000641_ref27) 2007 S1471068413000641_ref18 S1471068413000641_ref16 S1471068413000641_ref17 S1471068413000641_ref3 S1471068413000641_ref14 S1471068413000641_ref15 S1471068413000641_ref4 Falaschi (S1471068413000641_ref19) 1993 S1471068413000641_ref5 S1471068413000641_ref12 S1471068413000641_ref13 S1471068413000641_ref7 S1471068413000641_ref10 Zaffanella (S1471068413000641_ref50) 1997; 1997 S1471068413000641_ref8 S1471068413000641_ref9 Jaffar (S1471068413000641_ref30) 1987 S1471068413000641_ref1 S1471068413000641_ref2
References_xml	– ident: S1471068413000641_ref12 doi: 10.1016/0743-1066(92)90030-7 – ident: S1471068413000641_ref26 doi: 10.1016/0743-1066(95)00038-0 – ident: S1471068413000641_ref45 doi: 10.1016/0304-3975(84)90119-1 – ident: S1471068413000641_ref7 doi: 10.1145/177492.177656 – volume: 17 start-page: 93 year: 1996 ident: S1471068413000641_ref33 article-title: Breaking and fixing the Needham-Schroeder public-key protocol using fdr publication-title: Software – Concepts and Tools – volume: 1997 start-page: 6 year: 1997 ident: S1471068413000641_ref50 article-title: Abstracting synchronization in concurrent constraint programming publication-title: Journal of Functional and Logic Programming – ident: S1471068413000641_ref5 doi: 10.1007/3-540-48224-5_55 – ident: S1471068413000641_ref2 doi: 10.1016/S0167-6423(96)00039-1 – ident: S1471068413000641_ref34 doi: 10.1109/LICS.1988.5132 – start-page: 269 volume-title: Proceedings of the 6th ACM SIGACT-SIGPLAN Symposium on Principles of Programming (POPL) year: 1979 ident: S1471068413000641_ref11 – ident: S1471068413000641_ref21 doi: 10.1006/inco.1997.2638 – ident: S1471068413000641_ref1 doi: 10.1007/s10207-007-0041-y – ident: S1471068413000641_ref10 doi: 10.1017/S1471068411000135 – ident: S1471068413000641_ref36 doi: 10.1016/0890-5401(92)90008-4 – start-page: 271 volume-title: 23rd International Conference on Logic Programming (ICLP) year: 2007 ident: S1471068413000641_ref23 – ident: S1471068413000641_ref49 doi: 10.1016/S1571-0661(05)80291-9 – ident: S1471068413000641_ref16 doi: 10.1109/TIT.1983.1056650 – ident: S1471068413000641_ref8 doi: 10.1016/S0743-1066(96)00013-1 – start-page: 417 volume-title: International Conference on Logic Programming (ICLP) year: 2009 ident: S1471068413000641_ref29 – start-page: 281 volume-title: First International Static Analysis Symposium (SAS '94) year: 1994 ident: S1471068413000641_ref6 – ident: S1471068413000641_ref48 doi: 10.3233/JCS-2001-91-203 – ident: S1471068413000641_ref14 doi: 10.1006/inco.1999.2879 – ident: S1471068413000641_ref18 doi: 10.1006/inco.2000.3002 – start-page: 164 volume-title: Proceedings of Principles and Practice of Declarative Programming (PPDP) year: 2005 ident: S1471068413000641_ref31 – start-page: 544 volume-title: Proceedings of the Foundations of Software Technology and Theoretical Computer Science (FSTTCS) year: 2007 ident: S1471068413000641_ref27 – volume: 2 start-page: 181 year: 1995 ident: S1471068413000641_ref35 article-title: A logical view of concurrent constraint programming publication-title: Nordic Journal of Computing – start-page: 156 volume-title: Proceedings of the 4th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP) year: 2002 ident: S1471068413000641_ref38 – ident: S1471068413000641_ref3 doi: 10.1016/0167-6423(92)90005-V – start-page: 111 volume-title: Fourteenth Annual ACM Symposium on Principles of Programming Languages (POPL) year: 1987 ident: S1471068413000641_ref30 – start-page: 8 volume-title: Proceedings of the 10th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP) year: 2008 ident: S1471068413000641_ref40 – start-page: 160 volume-title: 14th IEEE Computer Security Foundations Workshop (CSFW-14) year: 2001 ident: S1471068413000641_ref25 – start-page: 333 volume-title: Proceedings of the Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages (POPL) year: 1991 ident: S1471068413000641_ref44 – ident: S1471068413000641_ref20 doi: 10.1016/S0304-3975(97)00328-9 – ident: S1471068413000641_ref28 doi: 10.1016/S0743-1066(98)10006-7 – ident: S1471068413000641_ref15 doi: 10.1016/0304-3975(95)00047-Z – ident: S1471068413000641_ref39 doi: 10.1007/s10601-013-9145-3 – ident: S1471068413000641_ref46 doi: 10.1145/72551.72555 – start-page: 210 volume-title: LICS year: 1993 ident: S1471068413000641_ref19 – start-page: 207 volume-title: 11th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP) year: 2009 ident: S1471068413000641_ref22 – volume-title: Concurrent Constraint Programming year: 1993 ident: S1471068413000641_ref42 doi: 10.7551/mitpress/2086.001.0001 – ident: S1471068413000641_ref13 doi: 10.1145/265943.265954 – ident: S1471068413000641_ref17 – ident: S1471068413000641_ref47 doi: 10.1007/BFb0016844 – ident: S1471068413000641_ref24 doi: 10.1017/S1471068406002675 – ident: S1471068413000641_ref43 doi: 10.1109/LICS.1994.316085 – volume: 9 start-page: 145 year: 2002 ident: S1471068413000641_ref37 article-title: Temporal concurrent constraint programming: Denotation, logic and applications publication-title: Nordic Journal of Computing – ident: S1471068413000641_ref9 doi: 10.1145/330249.330252 – ident: S1471068413000641_ref41 doi: 10.1145/1363686.1363726 – ident: S1471068413000641_ref4 doi: 10.3233/JCS-2010-0361 – start-page: 1 volume-title: Proceedings of the Second International Workshop on PLACES year: 2009 ident: S1471068413000641_ref32
SSID	ssj0016324
Score	2.067951
Snippet	Timed Concurrent Constraint Programming (tcc) is a declarative model for concurrency offering a logic for specifying reactive systems, i.e., systems that... Timed Concurrent Constraint Programming ( tcc ) is a declarative model for concurrency offering a logic for specifying reactive systems, i.e., systems that... Abstract Timed Concurrent Constraint Programming () is a declarative model for concurrency offering a logic for specifying reactive systems, i.e., systems that... Timed Concurrent Constraint Programming (tcc) is a declarative model for concurrency offering a logic for specifying reactive systems, i.e. systems that...
SourceID	hal proquest crossref cambridge
SourceType	Open Access Repository Aggregation Database Enrichment Source Index Database Publisher
StartPage	312
SubjectTerms	Computer Science Data flow analysis Logic Logic in Computer Science Logic programming Mobile communication systems Regular Papers Reuse Secrecy aspects Security Semantics
Title	Abstract interpretation of temporal concurrent constraint programs
URI	https://www.cambridge.org/core/product/identifier/S1471068413000641/type/journal_article https://www.proquest.com/docview/1672107351 https://www.proquest.com/docview/1685788005 https://inria.hal.science/hal-00945462
Volume	15
WOSCitedRecordID	wos000351762100002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1475-3081 dateEnd: 20241207 omitProxy: false ssIdentifier: ssj0016324 issn: 1471-0684 databaseCode: P5Z dateStart: 20010101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1475-3081 dateEnd: 20241207 omitProxy: false ssIdentifier: ssj0016324 issn: 1471-0684 databaseCode: K7- dateStart: 20010101 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1475-3081 dateEnd: 20241207 omitProxy: false ssIdentifier: ssj0016324 issn: 1471-0684 databaseCode: BENPR dateStart: 20010101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8QwEB58Hbz4FtcXVTyJxaZtHj3JKoqgLIsoiJeSpikuyK7a6u93pk2LD9iLl9KmSWk7k8kk8-UbgKOC5VEcUpA1Y8qPCxX5mWUxGsM8lirh6CLVG4Vv5WCgHh-ToVtwKx2ssrWJtaHOJ4bWyE-ZwLkK6iNnZ69vPmWNouiqS6ExC_MsDBnp-Y30uygCUZHXu4skoXtU3EY1iTKaCqmMwjk4LLPv3Ao_xqjZZ0JI_jLU9ehztfzf916BJed3ev1GUVZhxo7XYLnN6eC5Lr4O5_2MFj9M5Y1-wBG9SeE5GqsXD-fQpuF1otOyTjNReQ7qVW7Aw9Xl_cW17_Is-IYLWaFBDNCLYaHRubAs4iaUWssgMYnQOIHAqwwteqbQ1zGhFUEUaR5k2CYqClnkItqEufFkbLfAYxbFayNutaAdrkqzmEmri0LoxBrFenDS_eXU9ZYybZBmMv0jlB4ErSBS4zjL6ZtepjU57pq8NoQd0yofonS7ekS1fd2_TamMIJc8FuEnVtptJfvtlTux9uCgu41dk-ItemwnH1RHoT1Ej5xvT3_EDiyiH8YbHOUuzFXvH3YPFsxnNSrf92H-_HIwvNuvdRuPQ_70BbpA-fA
linkProvider	ProQuest
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT9wwEB7xqNReCn2gbgvUrdpL1Yg4iR85ILRA0SK2Kw5UQr0Ex3FUJJRQEqj6p_obmclL0Ep749Bb4oyjOJ6XPZ9nAD7kPAujgIKsKddelOvQSx2PUBlmkdKxQBepOSg8VbOZPj2NjxfgT38WhmCVvU5sFHVWWtoj3-IS1yrIj4LvXP70qGoURVf7EhotWxy5379wyVZtH-7j_H4MgoMvJ3sTr6sq4FkhVY3i76PN5oE1mXQ8FDZQxig_trE06C7jXYr6K9Vo2W3gpB-GRvgp9gnzXOWZDPG9i7Ac0QhRfo7F9yFqQanPm9NMitBEOuqjqJSimhqpjcJH6Abwu7kc7tnExR-EyPzLMDTW7mDlf_tPq_C086vZuBWEZ7Dgiuew0tesYJ0KewG745Q2d2zNzu_BLVmZsy5N1wWzZWHbvFV0WTVlNGrWQdmql_DtQUayBktFWbhXwLhD9nWhcEbSCV5teMSVM3kuTeys5iP4PMxq0mmDKmmRdCr5hwlG4PcTn9guJzuN6WJel09Dl8s2Ick84vfITQMdpRKfjKcJtRGkVEQyuEGi9Z6T7nzywEYjeDc8RtVD8SRTuPKaaDTqe1xxiNfzX_EWHk9Ovk6T6eHs6A08QZ9TtJjRdViqr67dBjyyN_V5dbXZyBODs4dmzFsCJ1MW
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Abstract+interpretation+of+temporal+concurrent+constraint+programs&rft.jtitle=Theory+and+practice+of+logic+programming&rft.au=FALASCHI%2C+MORENO&rft.au=OLARTE%2C+CARLOS&rft.au=PALAMIDESSI%2C+CATUSCIA&rft.date=2015-05-01&rft.pub=Cambridge+University+Press&rft.issn=1471-0684&rft.eissn=1475-3081&rft.volume=15&rft.issue=3&rft.spage=312&rft.epage=357&rft_id=info:doi/10.1017%2FS1471068413000641&rft.externalDocID=10_1017_S1471068413000641
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1471-0684&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1471-0684&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1471-0684&client=summon