Verification of Unary Communicating Datalog Programs
Summary: Verifies reachability in unary CDPs with bounded state and unbounded, unordered channels carrying unary relations. Reduction to coverability in high-level Petri nets over unordered data IDs yields CTL-decidability, with tight undecidability for modest generalizations. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. C. Aiswarya (Chennai Mathematical Institute)
- 2. Diego Calvanese (Free University of Bolzano; Umeå University)
- 3. Francesco Di Cosmo (Free University of Bolzano)
- 4. Marco Montali (Free University of Bolzano)
BibTeX Citation
@inproceedings{aiswarya_pods24,
address = {New York, NY, USA},
series = {{PODS} '24},
title = {{Verification of Unary Communicating Datalog Programs}},
url = {https://dl.acm.org/doi/10.1145/3651590},
doi = {10.1145/3651590},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Aiswarya, C. and Calvanese, Diego and Di Cosmo, Francesco and Montali, Marco},
year = {2024}
}
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,125 | Verification of Communicating Data-Driven Web Services | 2006 | PODS | 9.1334411e-05 |
| 2,653 | Foundations of Data-Aware Process Analysis: A Database Theory Perspective | 2013 | PODS | 8.2898925e-05 |
| 5,769 | Rule-Based Application Development using Webdamlog | 2013 | SIGMOD | 6.0941716e-05 |
| 5,874 | Verification of Relational Data-Centric Dynamic Systems with External Services | 2013 | PODS | 6.0586728e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,613 | Inherent Complexity of Recursive Queries (Extended Abstract) | 1999 | PODS |
| 2 | 7,549 | Hard problems for simple logic programs | 1990 | SIGMOD |
| 3 | 13,023 | Universal Finiteness and Satisfiability | 1994 | PODS |
| 4 | 6,077 | Safety of Datalog Queries over Infinite Databases | 1989 | PODS |
| 5 | 2,662 | Equivalence, Query-Reachability, and Satisfiability in Datalog Extensions | 1993 | PODS |
| 6 | 12,165 | Does Query Evaluation Tractability Help Query Containment? | 2014 | PODS |
| 7 | 5,874 | Verification of Relational Data-Centric Dynamic Systems with External Services | 2013 | PODS |
| 8 | 4,615 | Tools for Datalog Boundedness | 1991 | PODS |
| 9 | 7,972 | On the First-Order Expressibility of Recursive Queries | 1989 | PODS |
| 10 | 11,839 | Reachability in Database-driven Systems with Numerical Attributes under Recency Bounding | 2019 | PODS |