Abstract Model Checking of tccp programs

The Timed Concurrent Constraint programming language (tccp) introduces time aspects into the Concurrent Constraint paradigm. This makes tccp especially appropriate to analyze by model checking timing properties of concurrent systems. However, even if very compact state representations are obtained t...

Full description

Saved in:
Bibliographic Details
Published in:Electronic notes in theoretical computer science Vol. 112; pp. 19 - 36
Main Authors: Alpuente, María, del Mar Gallardo, María, Pimentel, Ernesto, Villanueva, Alicia
Format: Journal Article
Language:English
Published: Elsevier B.V 02.01.2005
Subjects:
Abstract Interpretation
Model Checking
Timed Concurrent Constraint Programming
Abstract Interpretation
Timed Concurrent Constraint Programming
Model Checking
ISSN:1571-0661, 1571-0661
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract The Timed Concurrent Constraint programming language (tccp) introduces time aspects into the Concurrent Constraint paradigm. This makes tccp especially appropriate to analyze by model checking timing properties of concurrent systems. However, even if very compact state representations are obtained thanks to the use of constraints in tccp, large state spaces can be still generated which may prevent model checking tools from verifying tccp programs completely. In this paper, we introduce an abstract methodology which is based on over- and under-approximating tccp models and mitigates the state explosion problem which is common to traditional model checking algorithms. We ascertain the conditions for the correctness of the abstract technique and show that, due to the timing aspects of the language, this semantics does not correctly simulate the suspension behavior, which is a key feature of tccp. Then, we present a refined abstract semantics which correctly models suspension.
AbstractList The Timed Concurrent Constraint programming language (tccp) introduces time aspects into the Concurrent Constraint paradigm. This makes tccp especially appropriate to analyze by model checking timing properties of concurrent systems. However, even if very compact state representations are obtained thanks to the use of constraints in tccp, large state spaces can be still generated which may prevent model checking tools from verifying tccp programs completely. In this paper, we introduce an abstract methodology which is based on over- and under-approximating tccp models and mitigates the state explosion problem which is common to traditional model checking algorithms. We ascertain the conditions for the correctness of the abstract technique and show that, due to the timing aspects of the language, this semantics does not correctly simulate the suspension behavior, which is a key feature of tccp. Then, we present a refined abstract semantics which correctly models suspension.
Author Alpuente, María
del Mar Gallardo, María
Pimentel, Ernesto
Villanueva, Alicia
Author_xml – sequence: 1
  givenname: María
  surname: Alpuente
  fullname: Alpuente, María
  email: alpuente@dsic.upv.es
– sequence: 2
  givenname: María
  surname: del Mar Gallardo
  fullname: del Mar Gallardo, María
  email: gallardo@lcc.uma.es
– sequence: 3
  givenname: Ernesto
  surname: Pimentel
  fullname: Pimentel, Ernesto
  email: ernesto@lcc.uma.es
– sequence: 4
  givenname: Alicia
  surname: Villanueva
  fullname: Villanueva, Alicia
  email: villanue@dsic.upv.es
BookMark eNp9j7FOwzAURS1UJNrCF7BkZEl4dmwnGRiqCgpSEQvMlmO_FIc2jmwLib8npQxMTPfpSufpngWZDX5AQq4pFBSovO0LHJKJBQPgBdACGD8jcyoqmoOUdPbnviCLGHuAsqaVnJObVRtT0CZlz97iPlu_o_lwwy7zXZaMGbMx-F3Qh3hJzju9j3j1m0vy9nD_un7Mty-bp_VqmxvW1CnXmjVtxdoS5FS0vDbcVsCtlaIGy7BC0WnTWFYJzYXkXAhqO9qUFqc9bVcuSXn6a4KPMWCnxuAOOnwpCuooq3r1I6uOsgqommQn6u5E4TTt02FQ0TgcDFoX0CRlvfuX_wbkOF8l
Cites_doi 10.1145/244795.244800
10.1006/inco.1999.2879
10.1007/BF01384313
10.1007/s00165-004-0040-y
10.1016/0743-1066(95)00038-0
10.1145/186025.186051
10.1145/5397.5399
10.1007/3-540-36377-7_9
ContentType Journal Article
Copyright 2004 Elsevier B.V.
Copyright_xml – notice: 2004 Elsevier B.V.
DBID 6I.
AAFTH
AAYXX
CITATION
DOI 10.1016/j.entcs.2004.01.024
DatabaseName ScienceDirect Open Access Titles
Elsevier:ScienceDirect:Open Access
CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1571-0661
EndPage 36
ExternalDocumentID 10_1016_j_entcs_2004_01_024
S1571066104052405
GroupedDBID --K
--M
0R~
1B1
1~5
4.4
457
4G.
5GY
5VS
6I.
7-5
71M
AABNK
AACTN
AAEDT
AAEDW
AAFTH
AAIKJ
AAKOC
AALRI
AAQFI
AAXUO
ABMAC
ABWVN
ACDAQ
ACGFO
ACGFS
ACNNM
ACRLP
ACRPL
ACXMD
ADBBV
ADEZE
ADMUD
ADNMO
ADVLN
AEIPS
AEKER
AEXQZ
AFTJW
AFXIZ
AGHFR
AIEXJ
AIKHN
AITUG
AKRWK
ALMA_UNASSIGNED_HOLDINGS
AMRAJ
ANKPU
AXJTR
CS3
DU5
EBS
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FNPLU
G-Q
HVGLF
HZ~
IHE
IXB
J1W
KOM
KQ8
M41
M~E
N9A
O-L
O9-
OK1
OZT
P2P
RIG
ROL
RPZ
SDG
SES
SPC
SSH
SSV
SSW
SSZ
29G
9DU
AAQXK
AAYWO
AAYXX
ABFNM
ACLOT
ACVFH
ADCNI
ADFGL
AEUPX
AFPUW
AGQPQ
AIGII
AJMQA
AKBMS
AKYEP
AOUOD
ASPBG
AVWKF
AZFZN
CITATION
FGOYB
GBLVA
R2-
SEW
~HD
ID FETCH-LOGICAL-c298t-aa29b72b306c29b48c4d704dd6580d2e7e5fac9d275a45644551df193de176bf3
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000213986400003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1571-0661
IngestDate Sat Nov 29 02:21:42 EST 2025
Thu Apr 10 08:06:46 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Keywords Abstract Interpretation
Timed Concurrent Constraint Programming
Model Checking
Language English
License http://creativecommons.org/licenses/by-nc-nd/3.0
https://www.elsevier.com/tdm/userlicense/1.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c298t-aa29b72b306c29b48c4d704dd6580d2e7e5fac9d275a45644551df193de176bf3
OpenAccessLink https://dx.doi.org/10.1016/j.entcs.2004.01.024
PageCount 18
ParticipantIDs crossref_primary_10_1016_j_entcs_2004_01_024
elsevier_sciencedirect_doi_10_1016_j_entcs_2004_01_024
PublicationCentury 2000
PublicationDate 2005-01-02
PublicationDateYYYYMMDD 2005-01-02
PublicationDate_xml – month: 01
  year: 2005
  text: 2005-01-02
  day: 02
PublicationDecade 2000
PublicationTitle Electronic notes in theoretical computer science
PublicationYear 2005
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References Falaschi, M. and Villanueva, A.
Clarke, Grumberg, Long (bib007) 1994; 16
Giacobazzi, Debray, Levi (bib015) 1995; 25
Cousot, Cousot (bib008) 1977
Alpuente, M., Falaschi, M. and Villanueva, A.
LNCS 2566, pp. 172-203
Ball, Podelski, Rajamani (bib002) 2002; 2280
Gallardo, Martínez, Merino, Pimentel (bib013) 2003
Saraswat (bib019) 1993
Alicante, 2003
2004
de Boer, Gabbrielli, Meo (bib005) 2001
McMillan (bib018) 1993
Dams, Gerth, Grumberg (bib010) 1997; 19
Cousot, Cousot (bib009) 1979
(2003), submitted for publication
Falaschi, Policriti, Villanueva (bib011) 2000; 48
de Boer, Gabbrielli, Meo (bib004) 2000; 161
Ball, Rajamani (bib003) 2002
Loiseaux, Graf, Sifakis, Boujjani (bib017) 1995; 6
Formal Aspects of Computing
in
Clarke, Emerson, Sistla (bib006) 1986; 8
Hatcliff, J., Dwyer, M., Pasareanu, C. and Robby
Saraswat, Jagadeesan, Gupta (bib020) 1994
Gallardo, M., Merino, P. and Pimentel, E.
10.1016/j.entcs.2004.01.024_bib001
10.1016/j.entcs.2004.01.024_bib012
Cousot (10.1016/j.entcs.2004.01.024_bib008) 1977
Giacobazzi (10.1016/j.entcs.2004.01.024_bib015) 1995; 25
Gallardo (10.1016/j.entcs.2004.01.024_bib013)
Loiseaux (10.1016/j.entcs.2004.01.024_bib017) 1995; 6
Cousot (10.1016/j.entcs.2004.01.024_bib009) 1979
McMillan (10.1016/j.entcs.2004.01.024_bib018) 1993
Ball (10.1016/j.entcs.2004.01.024_bib002) 2002; 2280
10.1016/j.entcs.2004.01.024_bib014
Dams (10.1016/j.entcs.2004.01.024_bib010) 1997; 19
10.1016/j.entcs.2004.01.024_bib016
Clarke (10.1016/j.entcs.2004.01.024_bib006) 1986; 8
Saraswat (10.1016/j.entcs.2004.01.024_bib020) 1994
Falaschi (10.1016/j.entcs.2004.01.024_bib011) 2000; 48
de Boer (10.1016/j.entcs.2004.01.024_bib005) 2001
Clarke (10.1016/j.entcs.2004.01.024_bib007) 1994; 16
Saraswat (10.1016/j.entcs.2004.01.024_bib019) 1993
Ball (10.1016/j.entcs.2004.01.024_bib003) 2002
de Boer (10.1016/j.entcs.2004.01.024_bib004) 2000; 161
References_xml – reference: Gallardo, M., Merino, P. and Pimentel, E.
– volume: 48
  year: 2000
  ident: bib011
  article-title: Modeling Timed Concurrent systems in a Temporal Concurrent Constraint language - I
  publication-title: ENTCS
– start-page: 71
  year: 1994
  end-page: 80
  ident: bib020
  article-title: Foundations of Timed Concurrent Constraint Programming
  publication-title: Proc. 9th IEEE Symposium on LICS
– start-page: 269
  year: 1979
  end-page: 282
  ident: bib009
  article-title: Systematic Design of Program Analysis Frameworks
  publication-title: Proc. of POPL
– volume: 6
  start-page: 1
  year: 1995
  end-page: 35
  ident: bib017
  article-title: Property preserving abstractions for the verification of concurrent systems
  publication-title: Formal Methods in System Design
– reference: , in:
– reference: , Alicante, 2003
– year: 2003
  ident: bib013
  article-title: spin: a tool for abstract model checking
– start-page: 238
  year: 1977
  end-page: 252
  ident: bib008
  article-title: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints
  publication-title: Proc. of POPL
– start-page: 1
  year: 2002
  end-page: 3
  ident: bib003
  article-title: The slam project: Debugging system software via static analysis
  publication-title: Proc. of POPL 2002
– volume: 161
  start-page: 45
  year: 2000
  end-page: 83
  ident: bib004
  article-title: A Timed Concurrent Constraint Language
  publication-title: Information and Computation
– year: 1993
  ident: bib018
  article-title: Symbolic Model Checking: An Approach to the State Explosion Problem
– reference: , Formal Aspects of Computing
– reference: (2003), submitted for publication
– reference: , LNCS 2566, pp. 172-203
– reference: (2004)
– volume: 25
  start-page: 191
  year: 1995
  end-page: 247
  ident: bib015
  article-title: Generalized semantics and abstract interpretation for constraint logic programs
  publication-title: J. of Logic Progr.
– reference: Alpuente, M., Falaschi, M. and Villanueva, A.,
– volume: 8
  start-page: 244
  year: 1986
  end-page: 263
  ident: bib006
  article-title: Automatic verification of finitestate concurrent systems using temporal logic specifications
  publication-title: ACM Transactions on Programming Languages and Systems
– start-page: 227
  year: 2001
  end-page: 233
  ident: bib005
  article-title: A Temporal Logic for reasoning about Timed Concurrent Constraint Programs
  publication-title: Proc. of 8th Int. Symposium on Temporal Representation and Reasoning
– volume: 2280
  start-page: 158
  year: 2002
  end-page: 172
  ident: bib002
  article-title: Relative completeness of abstraction refinement for software model checking
  publication-title: LNCS
– year: 1993
  ident: bib019
  article-title: Concurrent Constraint Programming Languages
– reference: Hatcliff, J., Dwyer, M., Pasareanu, C. and Robby,
– volume: 16
  start-page: 1512
  year: 1994
  end-page: 1542
  ident: bib007
  article-title: Model Checking and Abstraction
  publication-title: ACM Transactions on Programming Languages and Systems
– volume: 19
  start-page: 253
  year: 1997
  end-page: 291
  ident: bib010
  article-title: Abstract interpretation of reactive systems
  publication-title: ACM Transactions on Programming Languages and Systems
– reference: Falaschi, M. and Villanueva, A.,
– volume: 19
  start-page: 253
  year: 1997
  ident: 10.1016/j.entcs.2004.01.024_bib010
  article-title: Abstract interpretation of reactive systems
  publication-title: ACM Transactions on Programming Languages and Systems
  doi: 10.1145/244795.244800
– year: 1993
  ident: 10.1016/j.entcs.2004.01.024_bib019
– volume: 161
  start-page: 45
  year: 2000
  ident: 10.1016/j.entcs.2004.01.024_bib004
  article-title: A Timed Concurrent Constraint Language
  publication-title: Information and Computation
  doi: 10.1006/inco.1999.2879
– start-page: 269
  year: 1979
  ident: 10.1016/j.entcs.2004.01.024_bib009
  article-title: Systematic Design of Program Analysis Frameworks
– year: 1993
  ident: 10.1016/j.entcs.2004.01.024_bib018
– volume: 6
  start-page: 1
  year: 1995
  ident: 10.1016/j.entcs.2004.01.024_bib017
  article-title: Property preserving abstractions for the verification of concurrent systems
  publication-title: Formal Methods in System Design
  doi: 10.1007/BF01384313
– ident: 10.1016/j.entcs.2004.01.024_bib012
– ident: 10.1016/j.entcs.2004.01.024_bib014
  doi: 10.1007/s00165-004-0040-y
– volume: 48
  year: 2000
  ident: 10.1016/j.entcs.2004.01.024_bib011
  article-title: Modeling Timed Concurrent systems in a Temporal Concurrent Constraint language - I
  publication-title: ENTCS
– volume: 25
  start-page: 191
  year: 1995
  ident: 10.1016/j.entcs.2004.01.024_bib015
  article-title: Generalized semantics and abstract interpretation for constraint logic programs
  publication-title: J. of Logic Progr.
  doi: 10.1016/0743-1066(95)00038-0
– start-page: 71
  year: 1994
  ident: 10.1016/j.entcs.2004.01.024_bib020
  article-title: Foundations of Timed Concurrent Constraint Programming
– ident: 10.1016/j.entcs.2004.01.024_bib013
– start-page: 238
  year: 1977
  ident: 10.1016/j.entcs.2004.01.024_bib008
  article-title: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints
– volume: 16
  start-page: 1512
  year: 1994
  ident: 10.1016/j.entcs.2004.01.024_bib007
  article-title: Model Checking and Abstraction
  publication-title: ACM Transactions on Programming Languages and Systems
  doi: 10.1145/186025.186051
– ident: 10.1016/j.entcs.2004.01.024_bib001
– volume: 2280
  start-page: 158
  year: 2002
  ident: 10.1016/j.entcs.2004.01.024_bib002
  article-title: Relative completeness of abstraction refinement for software model checking
– start-page: 227
  year: 2001
  ident: 10.1016/j.entcs.2004.01.024_bib005
  article-title: A Temporal Logic for reasoning about Timed Concurrent Constraint Programs
– volume: 8
  start-page: 244
  year: 1986
  ident: 10.1016/j.entcs.2004.01.024_bib006
  article-title: Automatic verification of finitestate concurrent systems using temporal logic specifications
  publication-title: ACM Transactions on Programming Languages and Systems
  doi: 10.1145/5397.5399
– start-page: 1
  year: 2002
  ident: 10.1016/j.entcs.2004.01.024_bib003
  article-title: The slam project: Debugging system software via static analysis
– ident: 10.1016/j.entcs.2004.01.024_bib016
  doi: 10.1007/3-540-36377-7_9
SSID ssj0038176
Score 1.3890775
Snippet The Timed Concurrent Constraint programming language (tccp) introduces time aspects into the Concurrent Constraint paradigm. This makes tccp especially...
SourceID crossref
elsevier
SourceType Index Database
Publisher
StartPage 19
SubjectTerms Abstract Interpretation
Model Checking
Timed Concurrent Constraint Programming
Title Abstract Model Checking of tccp programs
URI https://dx.doi.org/10.1016/j.entcs.2004.01.024
Volume 112
WOSCitedRecordID wos000213986400003&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: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1571-0661
  dateEnd: 20201231
  omitProxy: false
  ssIdentifier: ssj0038176
  issn: 1571-0661
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 1571-0661
  dateEnd: 20201231
  omitProxy: false
  ssIdentifier: ssj0038176
  issn: 1571-0661
  databaseCode: M~E
  dateStart: 20040101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV07T8MwELbKY2DhjXgrAwNSCSqOUycjKgUGqDoAYoscP8SjSquSVkz8EH4t51dLoUIwsETRJXHi3OnufL77DqEDcNnzNGI4JERGIVE1FrKI5WE9SRVX0Uk9Nzu6d1e01Uru79N2pfLua2GGHVoUyetr2vtXVgMNmK1LZ__A7tGgQIBzYDocge1w_BXjT3MdveClaXPWqTYeJH92qc0l5z2fkfUyEZMfN8MpuqXJ0ZooceSu90PVGcyRmHR6Aw3q6ap-zK772UjR69cDtXqhg_V90Z1-V_vR4oJarVzoTjf-0p1uiVQM5NAGfzs6BDMRpohNmAJ_1qxUp1hZ5PVjOYXm1bFLq7YK1elTa5otVMo3pW_jD0_H8LHcILATi8RKxjbO7-t_MX2jhESf6_aUmUF0c06S1U4yGGQGzWEap1pjXr81vZXXwIamcs1PwSNamdzBb18y3ev55MncLKNFtwQJTq3orKCKLFbRkm_vEThtv4YOvSQFRpICL0lBVwVakgIvSevo9rx507gMXWONkOM0KUPGcJpTnMNyEQg5STgRtEaEAHe0JrCkMlaMpwLmzTTcEAG3Wihw9YWEWecq2kCzRbeQmyigesWfxAILWNdznoDtpFiBDy5ZFCkWb6EjP_GsZ_FTsh9-9haq-5-TOYm2rl0GzP7pwe2_vWcHLYyFdBfNlv2B3EPzfFg-vvT3Dac_AOtzexI
linkProvider ISSN International Centre
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+Model+Checking+of+tccp+programs&rft.jtitle=Electronic+notes+in+theoretical+computer+science&rft.au=Alpuente%2C+Mar%C3%ADa&rft.au=del+Mar+Gallardo%2C+Mar%C3%ADa&rft.au=Pimentel%2C+Ernesto&rft.au=Villanueva%2C+Alicia&rft.date=2005-01-02&rft.issn=1571-0661&rft.eissn=1571-0661&rft.volume=112&rft.spage=19&rft.epage=36&rft_id=info:doi/10.1016%2Fj.entcs.2004.01.024&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_entcs_2004_01_024
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1571-0661&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1571-0661&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1571-0661&client=summon