Convergence verification of declarative distributed systems

Logic-based languages, such as Datalog and Answer Set Programming, have been recently put forward as a data-centric model to effectively specify and implement network services and protocols, seeing them as dynamic systems of distributed computational nodes where each node evolves an internal databas...

ver descrição completa

Detalhes bibliográficos
Autores: Calvanese, Diego, Cosmo, Francesco di, Lobo, Jorge, Montali, Marco
Tipo de documento: artigo
Estado:Versão publicada
Data de publicação:2021
País:España
Recursos:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
Repositório:Recercat. Dipósit de la Recerca de Catalunya
OAI Identifier:oai:recercat.cat:10230/55981
Acesso em linha:http://hdl.handle.net/10230/55981
Access Level:Acceso aberto
Palavra-chave:Sistemes operatius distribuïts (Ordinadors)
id ES_d405c6a6b1c54dff0df0e6aa8b59f07a
oai_identifier_str oai:recercat.cat:10230/55981
network_acronym_str ES
network_name_str España
repository_id_str
spelling Convergence verification of declarative distributed systemsCalvanese, DiegoCosmo, Francesco diLobo, JorgeMontali, MarcoSistemes operatius distribuïts (Ordinadors)Logic-based languages, such as Datalog and Answer Set Programming, have been recently put forward as a data-centric model to effectively specify and implement network services and protocols, seeing them as dynamic systems of distributed computational nodes where each node evolves an internal database and exchanges data with the other nodes of the network. This approach provides the basis for declarative distributed computing. However, a rigorous, comprehensive characterization of the decidability and complexity of verification in declarative distributed systems is yet to come. This paper charts the decidability border of the verification of convergence properties, considering the case where the network is a fixed connected graph, nodes can incorporate fresh data from the external world into the system, and can communicate asynchronously by means of reliable but unordered channels.CEUR Workshop Proceedings202320232021info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfapplication/pdfhttp://hdl.handle.net/10230/55981reponame:Recercat. Dipósit de la Recerca de Catalunyainstname:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)InglésCEUR Workshop Proceedings. 2021;3002:62-76.Copyright © 2021 for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0)https://creativecommons.org/licenses/by/4.0/info:eu-repo/semantics/openAccessoai:recercat.cat:10230/559812026-05-29T05:05:01Z
dc.title.none.fl_str_mv Convergence verification of declarative distributed systems
title Convergence verification of declarative distributed systems
spellingShingle Convergence verification of declarative distributed systems
Calvanese, Diego
Sistemes operatius distribuïts (Ordinadors)
title_short Convergence verification of declarative distributed systems
title_full Convergence verification of declarative distributed systems
title_fullStr Convergence verification of declarative distributed systems
title_full_unstemmed Convergence verification of declarative distributed systems
title_sort Convergence verification of declarative distributed systems
dc.creator.none.fl_str_mv Calvanese, Diego
Cosmo, Francesco di
Lobo, Jorge
Montali, Marco
author Calvanese, Diego
author_facet Calvanese, Diego
Cosmo, Francesco di
Lobo, Jorge
Montali, Marco
author_role author
author2 Cosmo, Francesco di
Lobo, Jorge
Montali, Marco
author2_role author
author
author
dc.subject.none.fl_str_mv Sistemes operatius distribuïts (Ordinadors)
topic Sistemes operatius distribuïts (Ordinadors)
description Logic-based languages, such as Datalog and Answer Set Programming, have been recently put forward as a data-centric model to effectively specify and implement network services and protocols, seeing them as dynamic systems of distributed computational nodes where each node evolves an internal database and exchanges data with the other nodes of the network. This approach provides the basis for declarative distributed computing. However, a rigorous, comprehensive characterization of the decidability and complexity of verification in declarative distributed systems is yet to come. This paper charts the decidability border of the verification of convergence properties, considering the case where the network is a fixed connected graph, nodes can incorporate fresh data from the external world into the system, and can communicate asynchronously by means of reliable but unordered channels.
publishDate 2021
dc.date.none.fl_str_mv 2021
2023
2023
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/10230/55981
url http://hdl.handle.net/10230/55981
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv CEUR Workshop Proceedings. 2021;3002:62-76.
dc.rights.none.fl_str_mv https://creativecommons.org/licenses/by/4.0/
info:eu-repo/semantics/openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by/4.0/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv CEUR Workshop Proceedings
publisher.none.fl_str_mv CEUR Workshop Proceedings
dc.source.none.fl_str_mv reponame:Recercat. Dipósit de la Recerca de Catalunya
instname:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
instname_str Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
reponame_str Recercat. Dipósit de la Recerca de Catalunya
collection Recercat. Dipósit de la Recerca de Catalunya
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869420510574542848
score 15,812429