Compositional Verification in Rewriting Logic

In previous work, summarized in this paper, we proposed an operation of parallel composition for rewriting-logic theories, allowing compositional specification of systems and reusability of components. The present paper focuses on compositional verification. We show how the assume/guarantee techniqu...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Theory and practice of logic programming Jg. 24; H. 1; S. 57 - 109
Hauptverfasser: MARTÍN, ÓSCAR, VERDEJO, ALBERTO, MARTÍ-OLIET, NARCISO
Format: Journal Article
Sprache:Englisch
Veröffentlicht: 01.01.2024
ISSN:1471-0684, 1475-3081
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract In previous work, summarized in this paper, we proposed an operation of parallel composition for rewriting-logic theories, allowing compositional specification of systems and reusability of components. The present paper focuses on compositional verification. We show how the assume/guarantee technique can be transposed to our setting, by giving appropriate definitions of satisfaction based on transition structures and path semantics. We also show that simulation and equational abstraction can be done componentwise. Appropriate concepts of fairness and deadlock for our composition operation are discussed, as they affect satisfaction of temporal formulas. We keep in parallel a distributed and a global view of composed systems. We show that these views are equivalent and interchangeable, which may help our intuition and also has practical uses as, for example, it allows global-style verification of a modularly specified system. Under consideration in Theory and Practice of Logic Programming (TPLP).
AbstractList In previous work, summarized in this paper, we proposed an operation of parallel composition for rewriting-logic theories, allowing compositional specification of systems and reusability of components. The present paper focuses on compositional verification. We show how the assume/guarantee technique can be transposed to our setting, by giving appropriate definitions of satisfaction based on transition structures and path semantics. We also show that simulation and equational abstraction can be done componentwise. Appropriate concepts of fairness and deadlock for our composition operation are discussed, as they affect satisfaction of temporal formulas. We keep in parallel a distributed and a global view of composed systems. We show that these views are equivalent and interchangeable, which may help our intuition and also has practical uses as, for example, it allows global-style verification of a modularly specified system. Under consideration in Theory and Practice of Logic Programming (TPLP).
Author MARTÍN, ÓSCAR
MARTÍ-OLIET, NARCISO
VERDEJO, ALBERTO
Author_xml – sequence: 1
  givenname: ÓSCAR
  orcidid: 0000-0001-8212-5074
  surname: MARTÍN
  fullname: MARTÍN, ÓSCAR
– sequence: 2
  givenname: ALBERTO
  surname: VERDEJO
  fullname: VERDEJO, ALBERTO
– sequence: 3
  givenname: NARCISO
  surname: MARTÍ-OLIET
  fullname: MARTÍ-OLIET, NARCISO
BookMark eNplT8tKxDAUDTKCM6Mf4K4_EL23N03TpRRfUBB8bUua3gyRmWZIBsS_d6ruXJ0XHM5ZicUUJxbiEuEKAevrF1Q1gjaqJAAgBSdiebQqSWBw8cNRzvmZWOX8AYCaSrUUso27fczhEOJkt8U7p-CDs7MswlQ882c6ZtOm6OImuHNx6u0288UfrsXb3e1r-yC7p_vH9qaTrlRwkGNjj1uIDLMdlLOqYla2osGTAShLh9xojfWovTbej1bxgCOZGoZGK-9pLfC316WYc2Lf71PY2fTVI_Tz3_7fX_oGv4ZJmA
Cites_doi 10.1016/j.tcs.2008.04.040
10.1016/0304-3975(92)90182-F
10.1016/j.entcs.2004.07.012
10.1109/TSE.1981.230844
10.1016/0304-3975(96)00069-2
10.1017/S1471068419000425
10.1007/10722167_15
10.1007/978-3-540-24756-2_8
10.1007/978-3-319-99840-4_4
10.1016/j.jlamp.2021.100700
10.1145/1146238.1146250
10.1007/3-540-36577-X_24
10.4204/EPTCS.82.2
10.1145/203095.201069
10.1145/345099.345104
10.1007/s00165-017-0436-0
10.1145/177492.177725
10.1016/j.entcs.2006.03.017
10.1016/j.entcs.2004.06.020
10.1145/3329125
10.1007/s00236-015-0226-1
10.1007/978-3-319-08918-8_5
10.1023/B:JARS.0000009518.26415.49
10.1007/978-3-642-82453-1_5
10.1007/11562436_15
ContentType Journal Article
DBID AAYXX
CITATION
DOI 10.1017/S1471068423000340
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1475-3081
EndPage 109
ExternalDocumentID 10_1017_S1471068423000340
GroupedDBID -E.
.FH
09C
09E
0E1
0R~
123
29Q
4.4
5VS
74X
74Y
7~V
8FE
8FG
8R4
8R5
AAAZR
AABES
AABWE
AACJH
AAFUK
AAGFV
AAKTX
AANRG
AARAB
AASVR
AAUKB
AAYXX
ABBXD
ABGDZ
ABITZ
ABJNI
ABKKG
ABMWE
ABQTM
ABQWD
ABROB
ABTCQ
ABUWG
ABVKB
ABVZP
ABXHF
ABZCX
ACAJB
ACBMC
ACDLN
ACGFS
ACIMK
ACNCT
ACUIJ
ACYZP
ACZBM
ACZUX
ACZWT
ADCGK
ADDNB
ADFEC
ADKIL
ADOVH
ADVJH
AEBAK
AEHGV
AEMTW
AENEX
AENGE
AFFHD
AFFUJ
AFKQG
AFKRA
AFLOS
AFLVW
AFUTZ
AFZFC
AGABE
AGBYD
AGJUD
AHQXX
AHRGI
AIGNW
AIHIV
AIOIP
AISIE
AJ7
AJCYY
AJPFC
AJQAS
AKMAY
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
CITATION
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
NIKVX
O9-
OYBOY
P2P
P62
PHGZM
PHGZT
PQGLB
PQQKQ
PROAC
PYCCK
Q2X
RAMDC
RCA
ROL
RR0
S6-
S6U
SAAAG
T9M
UT1
WFFJZ
WQ3
WXU
WYP
ZYDXJ
ID FETCH-LOGICAL-c240t-d9a106338eeab4ca45ee4a53bf380022c1e96617d6f68ffda4eb1d3870b964ff3
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001062417900001&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 04:58:38 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c240t-d9a106338eeab4ca45ee4a53bf380022c1e96617d6f68ffda4eb1d3870b964ff3
ORCID 0000-0001-8212-5074
OpenAccessLink https://www.cambridge.org/core/services/aop-cambridge-core/content/view/BB7AC42A9DA43517A3D1C5BE0AE40F0C/S1471068423000340a.pdf/div-class-title-compositional-verification-in-rewriting-logic-div.pdf
PageCount 53
ParticipantIDs crossref_primary_10_1017_S1471068423000340
PublicationCentury 2000
PublicationDate 2024-01-00
PublicationDateYYYYMMDD 2024-01-01
PublicationDate_xml – month: 01
  year: 2024
  text: 2024-01-00
PublicationDecade 2020
PublicationTitle Theory and practice of logic programming
PublicationYear 2024
References S1471068423000340_ref35
S1471068423000340_ref13
S1471068423000340_ref14
S1471068423000340_ref36
S1471068423000340_ref37
S1471068423000340_ref15
S1471068423000340_ref16
S1471068423000340_ref38
S1471068423000340_ref39
S1471068423000340_ref17
S1471068423000340_ref18
S1471068423000340_ref19
S1471068423000340_ref30
Clarke (S1471068423000340_ref9) 1999
S1471068423000340_ref31
Lynch (S1471068423000340_ref27) 1989
S1471068423000340_ref10
S1471068423000340_ref32
S1471068423000340_ref11
S1471068423000340_ref33
S1471068423000340_ref12
S1471068423000340_ref34
André (S1471068423000340_ref2) 2012
S1471068423000340_ref24
S1471068423000340_ref26
S1471068423000340_ref28
S1471068423000340_ref29
S1471068423000340_ref1
S1471068423000340_ref5
S1471068423000340_ref20
S1471068423000340_ref21
S1471068423000340_ref4
S1471068423000340_ref22
S1471068423000340_ref3
S1471068423000340_ref23
Lamport (S1471068423000340_ref25) 2002
S1471068423000340_ref8
S1471068423000340_ref7
S1471068423000340_ref6
References_xml – ident: S1471068423000340_ref34
  doi: 10.1016/j.tcs.2008.04.040
– ident: S1471068423000340_ref33
  doi: 10.1016/0304-3975(92)90182-F
– year: 2002
  ident: S1471068423000340_ref25
– ident: S1471068423000340_ref36
  doi: 10.1016/j.entcs.2004.07.012
– ident: S1471068423000340_ref12
– ident: S1471068423000340_ref35
  doi: 10.1109/TSE.1981.230844
– ident: S1471068423000340_ref21
  doi: 10.1016/0304-3975(96)00069-2
– start-page: 283
  volume-title: Large-Scale Complex IT Systems
  year: 2012
  ident: S1471068423000340_ref2
– ident: S1471068423000340_ref20
– ident: S1471068423000340_ref6
– volume-title: Model Checking
  year: 1999
  ident: S1471068423000340_ref9
– ident: S1471068423000340_ref24
– ident: S1471068423000340_ref32
  doi: 10.1017/S1471068419000425
– ident: S1471068423000340_ref8
  doi: 10.1007/10722167_15
– ident: S1471068423000340_ref7
  doi: 10.1007/978-3-540-24756-2_8
– ident: S1471068423000340_ref31
  doi: 10.1007/978-3-319-99840-4_4
– ident: S1471068423000340_ref26
– ident: S1471068423000340_ref38
  doi: 10.1016/j.jlamp.2021.100700
– ident: S1471068423000340_ref10
– ident: S1471068423000340_ref13
  doi: 10.1145/1146238.1146250
– ident: S1471068423000340_ref14
  doi: 10.1007/3-540-36577-X_24
– ident: S1471068423000340_ref39
  doi: 10.4204/EPTCS.82.2
– ident: S1471068423000340_ref11
– ident: S1471068423000340_ref1
  doi: 10.1145/203095.201069
– ident: S1471068423000340_ref23
  doi: 10.1145/345099.345104
– ident: S1471068423000340_ref16
  doi: 10.1007/s00165-017-0436-0
– ident: S1471068423000340_ref19
  doi: 10.1145/177492.177725
– ident: S1471068423000340_ref5
– start-page: 219
  year: 1989
  ident: S1471068423000340_ref27
  article-title: An introduction to input/output automata
  publication-title: CWI Quarterly 2
– ident: S1471068423000340_ref15
  doi: 10.1016/j.entcs.2006.03.017
– ident: S1471068423000340_ref28
  doi: 10.1016/j.entcs.2004.06.020
– ident: S1471068423000340_ref18
  doi: 10.1145/3329125
– ident: S1471068423000340_ref17
  doi: 10.1007/s00236-015-0226-1
– ident: S1471068423000340_ref29
– ident: S1471068423000340_ref4
  doi: 10.1007/978-3-319-08918-8_5
– ident: S1471068423000340_ref30
– ident: S1471068423000340_ref3
  doi: 10.1023/B:JARS.0000009518.26415.49
– ident: S1471068423000340_ref37
  doi: 10.1007/978-3-642-82453-1_5
– ident: S1471068423000340_ref22
  doi: 10.1007/11562436_15
SSID ssj0016324
Score 2.3168478
Snippet In previous work, summarized in this paper, we proposed an operation of parallel composition for rewriting-logic theories, allowing compositional specification...
SourceID crossref
SourceType Index Database
StartPage 57
Title Compositional Verification in Rewriting Logic
Volume 24
WOSCitedRecordID wos001062417900001&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: 20241209
  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: 20241209
  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: 20241209
  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/eLvHCXMwtV1LT-MwELZK2QMXdmFBy76UAyckS0nsNPGxLUGAUItCQdwqO7ElJAiI7bKc95fvTGyHQIUEh71EkRXbTWY6D8_MN4TsRkxWnDNNlanAQRGlpjJVhmrOQ5iQIf5J02winUyyy0tx2uv99bUwD9dpXWePj-Luv5IaxoDYWDr7DnK3i8IA3APR4Qpkh-ubCI__cJeJBZ__ArY07lwOzzYK_QdhjLC0CYVe1za1ZfoOOcDWTqEp2QhHn8d14zUd0ghsYYyzZ_tNqgDeCnY2Hraxo4u82M-Pp434ORnlxWy6PJVOT47yWcOTw2J8dDbtHkPEvHMMYSUnaDnsYGNPB7QfSygLbU8WL25tyfQztrKy0wJVOy0cNaAJywLeoULhbrgZOFCIsBM-aTMfwX-h5NrUQ5vVls6Xllghq3GaCJCMq6N8clq0sSgEtG9q1NwL-tg4Ao-_XKRj3XTMlNknsu78i2Bo-WKD9HS9ST763h2BE-WfCX3GJkGXTYKrOmjZJGjYZIucH-Sz8SF1rTNoCSbaglZCwu9iLNNaKl5KnmjNZcKUYeghxGWkwc-N0mpgBpkxleSgsysGwluJATeGbZN-fVvrLyQQVazKWInEJCGHWSrLmJJMhvB4xJNqh-z5V57fWYSU-asf-et7Hv5G1p447TvpL-5_6x_kQ_mwuPp1_9OR6R8b6lPD
linkProvider ProQuest
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=Compositional+Verification+in+Rewriting+Logic&rft.jtitle=Theory+and+practice+of+logic+programming&rft.au=MART%C3%8DN%2C+%C3%93SCAR&rft.au=VERDEJO%2C+ALBERTO&rft.au=MART%C3%8D-OLIET%2C+NARCISO&rft.date=2024-01-01&rft.issn=1471-0684&rft.eissn=1475-3081&rft.volume=24&rft.issue=1&rft.spage=57&rft.epage=109&rft_id=info:doi/10.1017%2FS1471068423000340&rft.externalDBID=n%2Fa&rft.externalDocID=10_1017_S1471068423000340
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