Verification of Temporal Properties in Communicating Datalog Programs
ACM Transactions on Database Systems · 30.10.2026
DOI: 10.1145/3849387 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Transactions on Database Systems, online erschienen am 30.10.2026. Verfasst von Diego Calvanese und 3 weiteren Autor:innen. Die Arbeit nennt 55 Literaturangaben.
Abstract (Originalsprache)
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. A rigorous, comprehensive characterization of the decidability and complexity of verification in declarative distributed systems is yet to come. This paper provides a stepping stone towards this grand objective, considering the case where the network is a fixed connected graph, and nodes can incorporate fresh data from the external world into the system. We study the problem from different angles, delineating the decidability frontier of verification and providing tight complexity bounds for the decidable cases.
Zitieren
APA
Calvanese, D., Cosmo, F. D., Lobo, J., & Montali, M. (2026). Verification of Temporal Properties in Communicating Datalog Programs. ACM Transactions on Database Systems. https://doi.org/10.1145/3849387
Vancouver
Calvanese D, Cosmo FD, Lobo J, Montali M. Verification of Temporal Properties in Communicating Datalog Programs. ACM Transactions on Database Systems. 2026. doi:10.1145/3849387
BibTeX
@article{Calvanese2026,
author = {Calvanese, Diego and Cosmo, Francesco Di and Lobo, Jorge and Montali, Marco},
title = {Verification of Temporal Properties in Communicating Datalog Programs},
journal = {ACM Transactions on Database Systems},
year = {2026},
doi = {10.1145/3849387}
}
EUVIMED