Verification of Unary Communicating Datalog Programs
Article No.: 89, Pages 1 - 26
Abstract
We study verification of reachability properties over Communicating Datalog Programs (CDPs), which are networks of relational nodes connected through unordered channels and running Datalog-like computations. Each node manipulates a local state database (DB), depending on incoming messages and additional input DBs from external services. Decidability of verification for CDPs has so far been established only under boundedness assumptions on the state and channel sizes, showing at the same time undecidability of reachability for unbounded states with only two unary relations or unbounded channels with a single binary relation. The goal of this paper is to study the open case of CDPs with bounded states and unbounded channels, under the assumption that channels carry unary relations only. We discuss the significance of the resulting model and prove the decidability of verification of variants of reachability, captured in fragments of first-order CTL. We do so through a novel reduction to coverability problems in a class of high-level Petri Nets that manipulate unordered data identifiers. We study the tightness of our results, showing that minor generalizations of the considered reachability properties yield undecidability of verification, both for CDPs and the corresponding Petri Net model.
References
[1]
Serge Abiteboul, Émilien Antoine, Gerome Miklau, Julia Stoyanovich, and Jules Testard. 2013. Rule-based Application Development Using Webdamlog. In Proc. of the 34th ACM Int. Conf. on Management of Data (SIGMOD). ACM, 965--968. https://doi.org/10.1145/2463676.2465251
[2]
Peter Alvaro, Tom J. Ameloot, Joseph M. Hellerstein, William Marczak, and Jan Van den Bussche. 2011. A Declarative Semantics for Dedalus. Technical Report UCB/EECS-2011--120. EECS Department, University of California, Berkeley. http://www.eecs.berkeley.edu/Pubs/TechRpts/2011/EECS-2011--120.html
[3]
Tom J. Ameloot and Jan Van den Bussche. 2014. Positive Dedalus Programs Tolerate Non-causality. J. of Computer and System Sciences, Vol. 80, 7 (2014), 1191--1213. https://doi.org/10.1016/j.jcss.2014.01.005
[4]
Babak Bagheri Hariri, Diego Calvanese, Giuseppe De Giacomo, Alin Deutsch, and Marco Montali. 2013. Verification of Relational Data-Centric Dynamic Systems with External Services. In Proc. of the 32nd ACM Symp. on Principles of Database Systems (PODS). 163--174. https://doi.org/10.1145/2463664.2465221
[5]
Babak Bagheri Hariri, Diego Calvanese, Marco Montali, and Alin Deutsch. 2014. State-Boundedness in Data-Aware Dynamic Systems. In Proc. of the 14th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR). AAAI Press, 458--467.
[6]
Christel Baier and Joost-Pieter Katoen. 2008. Principles of Model Checking. The MIT Press.
[7]
Francesco Belardinelli, Alessio Lomuscio, and Fabio Patrizi. 2011. Verification of Deployed Artifact Systems via Data Abstraction. In Proc. of the 9th Int. Joint Conf. on Service Oriented Computing (ICSOC) (Lecture Notes in Computer Science, Vol. 7084). Springer, 142--156.
[8]
Hans-Dieter Burkhard. 1982. On Fairness in Petri Nets. Rostocker Mathematisches Kolloquium (1982), 85--96. https://doi.org/10.18452/9417
[9]
Diego Calvanese, Giuseppe De Giacomo, and Marco Montali. 2013. Foundations of data-aware process analysis: a database theory perspective. In Proc. of the 32nd ACM Symp. on Principles of Database Systems (PODS). ACM, 1--12. https://doi.org/10.1145/2463664.2467796
[10]
Diego Calvanese, Giuseppe De Giacomo, Marco Montali, and Fabio Patrizi. 2018. First-order mu-calculus over Generic Transition Systems and Applications to the Situation Calculus. Information and Computation, Vol. 259, 3 (2018), 328--347. https://doi.org/10.1016/j.ic.2017.08.007
[11]
Diego Calvanese, Giuseppe De Giacomo, Marco Montali, and Fabio Patrizi. 2022. Verification and Monitoring for First-Order LTL with Persistence-Preserving Quantification over Finite and Infinite Traces. In Proc. of the 31st Int. Joint Conference on Artificial Intelligence. IJCAI Org., 2553--2560.
[12]
Diego Calvanese, Francesco Di Cosmo, Jorge Lobo, and Marco Montali. 2021. Convergence Verification of Declarative Distributed Systems. In Proc. of the 36th Italian Conf. on Computational Logic (CILC 2021) (CEUR Workshop Proceedings, Vol. 3002). CEUR-WS.org, 62--76.
[13]
Giuseppe De Giacomo, Yves Lespérance, and Fabio Patrizi. 2016. Bounded Situation Calculus Action Theories. Artificial Intelligence, Vol. 237 (2016), 172--203. https://doi.org/10.1016/j.artint.2016.04.006
[14]
Alin Deutsch, Richard Hull, Yuliang Li, and Victor Vianu. 2018. Automatic Verification of Database-centric Systems. ACM SIGLOG News, Vol. 5, 2 (2018), 37--56.
[15]
Alin Deutsch, Liying Sui, and Victor Vianu. 2007. Specification and Verification of Data-Driven Web Applications. J. of Computer and System Sciences, Vol. 73, 3 (2007), 442--474.
[16]
Alin Deutsch, Liying Sui, Victor Vianu, and Dayou Zhou. 2006. Verification of Communicating Data-Driven Web Services. In Proc. of the 25th ACM Symp. on Principles of Database Systems (PODS). 90--99. https://doi.org/10.1145/1142351.1142364
[17]
Silvio Ghilardi, Alessandro Gianola, Marco Montali, and Andrey Rivkin. 2022. Petri Net-based Object-centric Processes with Read-only Data. Information Systems, Vol. 107 (2022), 102011.
[18]
Joseph M. Hellerstein. 2010. The Declarative Imperative: Experiences and Conjectures in Distributed Logic. SIGMOD Record, Vol. 39, 1 (2010), 5--19.
[19]
Richard M. Karp and Raymond E. Miller. 1969. Parallel Program Schemata. J. of Computer and System Sciences, Vol. 3, 2 (1969), 147--195.
[20]
Ranko Lazic, Thomas Christopher Newcomb, Joël Ouaknine, A. W. Roscoe, and James Worrell. 2008. Nets with Tokens which Carry Data. Fundamenta Informaticae, Vol. 88, 3 (2008), 251--274.
[21]
Jiefei Ma, Franck Le, Alessandra Russo, and Jorge Lobo. 2016. Declarative Framework for Specification, Simulation and Analysis of Distributed Applications. IEEE Trans. on Knowledge and Data Engineering, Vol. 28, 6 (2016), 1489--1502.
[22]
Marvin L. Minsky. 1967. Computation: Finite and Infinite Machines. Prentice-Hall.
[23]
Fernando Rosa-Velardo. 2017. Ordinal Recursive Complexity of Unordered Data Nets. Information and Computation, Vol. 254 (2017), 41--58.
[24]
Fernando Rosa-Velardo and David de Frutos-Escrig. 2011. Decidability and Complexity of Petri Nets with Unordered Data. Theoretical Computer Science, Vol. 412, 34 (2011), 4439--4451. https://doi.org/10.1016/j.tcs.2011.05.007
[25]
Dmitry Solomakhin, Marco Montali, Sergio Tessaris, and Riccardo De Masellis. 2013. Verification of Artifact-Centric Systems: Decidability and Modeling Issues. In Proc. of the 11th Int. Joint Conf. on Service Oriented Computing (ICSOC) (Lecture Notes in Computer Science, Vol. 8274). Springer, 252--266.
[26]
Victor Vianu. 2009. Automatic Verification of Database-Driven Systems: a New Frontier. In Proc. of the 12th Int. Conf. on Database Theory (ICDT). 1--13. https://doi.org/10.1145/1514894.1514896
[27]
Michael Westergaard, Sami Evangelista, and Lars Michael Kristensen. 2009. ASAP: An Extensible Platform for State Space Analysis. In Proc. of the 30th Int. Conf. on Application and Theory of Petri Nets (PETRI NETS) (Lecture Notes in Computer Science, Vol. 5606). Springer, 303--312.
Index Terms
- Verification of Unary Communicating Datalog Programs
Recommendations
Formal verification of ASMs using MDGs
We present a framework for the formal verification of abstract state machine (ASM) designs using the multiway decision graphs (MDG) tool. ASM is a state based language for describing transition systems. MDG provides symbolic representation of transition ...
A Framework for the Verification of Certifying Computations
Formal verification of complex algorithms is challenging. Verifying their implementations goes beyond the state of the art of current automatic verification tools and usually involves intricate mathematical theorems. Certifying algorithms compute in ...
Kripke modelling and verification of temporal specifications of a multiple UAV system
A verifiable multiple UAV system cooperatively monitoring a road network is presented in this paper. The focus is on formal modelling and verification which can guarantee correctness of concurrent reactive systems such as multi-UAV systems. Kripke ...
Comments
Information & Contributors
Information
Published In
May 2024
852 pages
Copyright © 2024 Owner/Author.
This work is licensed under a Creative Commons Attribution International 4.0 License.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 14 May 2024
Published in PACMMOD Volume 2, Issue 2
Author Tags
Qualifiers
- Research-article
Funding Sources
- PRIN MUR
- Free University of Bozen-Bolzano
- Knut and Alice Wallenberg Foundation
- Province of Bolzano
- HORIZON EUROPE Framework Programme
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 95Total Downloads
- Downloads (Last 12 months)95
- Downloads (Last 6 weeks)24
Reflects downloads up to 11 Aug 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in