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

ver descrição completa

Detalhes bibliográficos
Autores: Martí Oliet, Narciso, Verdejo López, José Alberto, Martín Sánchez, Óscar
Formato: artículo
Fecha de publicación:2023
País:España
Recursos:Universidad Complutense de Madrid (UCM)
Repositorio:Docta Complutense
Idioma:inglés
OAI Identifier:oai:docta.ucm.es:20.500.14352/88454
Acesso em linha:https://hdl.handle.net/20.500.14352/88454
Access Level:acceso abierto
Palavra-chave:Rewriting logic
Modularity
Verification
Assume/guarantee
Abstration
Simulation
Maude
Software
Lenguajes de programación
1102.05 Sistemas Formales
1203.23 Lenguajes de Programación
id ES_5ab12045cd5a2f92fd8c52eff0eb6a42
oai_identifier_str oai:docta.ucm.es:20.500.14352/88454
network_acronym_str ES
network_name_str España
repository_id_str
spelling Compositional Verification in Rewriting LogicMartí Oliet, NarcisoVerdejo López, José AlbertoMartín Sánchez, ÓscarRewriting logicModularityVerificationAssume/guaranteeAbstrationSimulationMaudeSoftwareLenguajes de programación1102.05 Sistemas Formales1203.23 Lenguajes de ProgramaciónIn 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.Cambridge University PressUniversidad Complutense de Madrid20232023-08-2320232023-08-23journal articlehttp://purl.org/coar/resource_type/c_6501VoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/articleapplication/pdfhttps://hdl.handle.net/20.500.14352/88454reponame:Docta Complutenseinstname:Universidad Complutense de Madrid (UCM)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2Attribution-ShareAlike 4.0 Internationalhttp://creativecommons.org/licenses/by-sa/4.0/info:eu-repo/semantics/openAccessoai:docta.ucm.es:20.500.14352/884542026-06-02T12:44:21Z
dc.title.none.fl_str_mv Compositional Verification in Rewriting Logic
title Compositional Verification in Rewriting Logic
spellingShingle Compositional Verification in Rewriting Logic
Martí Oliet, Narciso
Rewriting logic
Modularity
Verification
Assume/guarantee
Abstration
Simulation
Maude
Software
Lenguajes de programación
1102.05 Sistemas Formales
1203.23 Lenguajes de Programación
title_short Compositional Verification in Rewriting Logic
title_full Compositional Verification in Rewriting Logic
title_fullStr Compositional Verification in Rewriting Logic
title_full_unstemmed Compositional Verification in Rewriting Logic
title_sort Compositional Verification in Rewriting Logic
dc.creator.none.fl_str_mv Martí Oliet, Narciso
Verdejo López, José Alberto
Martín Sánchez, Óscar
author Martí Oliet, Narciso
author_facet Martí Oliet, Narciso
Verdejo López, José Alberto
Martín Sánchez, Óscar
author_role author
author2 Verdejo López, José Alberto
Martín Sánchez, Óscar
author2_role author
author
dc.contributor.none.fl_str_mv Universidad Complutense de Madrid
dc.subject.none.fl_str_mv Rewriting logic
Modularity
Verification
Assume/guarantee
Abstration
Simulation
Maude
Software
Lenguajes de programación
1102.05 Sistemas Formales
1203.23 Lenguajes de Programación
topic Rewriting logic
Modularity
Verification
Assume/guarantee
Abstration
Simulation
Maude
Software
Lenguajes de programación
1102.05 Sistemas Formales
1203.23 Lenguajes de Programación
description 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.
publishDate 2023
dc.date.none.fl_str_mv 2023
2023-08-23
2023
2023-08-23
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://hdl.handle.net/20.500.14352/88454
url https://hdl.handle.net/20.500.14352/88454
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
Attribution-ShareAlike 4.0 International
http://creativecommons.org/licenses/by-sa/4.0/
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
Attribution-ShareAlike 4.0 International
http://creativecommons.org/licenses/by-sa/4.0/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Cambridge University Press
publisher.none.fl_str_mv Cambridge University Press
dc.source.none.fl_str_mv reponame:Docta Complutense
instname:Universidad Complutense de Madrid (UCM)
instname_str Universidad Complutense de Madrid (UCM)
reponame_str Docta Complutense
collection Docta Complutense
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869408737108688896
score 15.301603

Registos relacionados