DBScholar

Back to papers

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)

Paper ID
1952
Venue
PODS
Year
2024
Pagerank
5.093636e-05
Overall Rank
11,127 | 23.66%
DOI
10.1145/3651590

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

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.

Previous Page 1 / 1 Next

Semantically Similar Papers