Recency-Bounded Verification of Dynamic Database-Driven Systems
Summary: DMS: an expressive infinite‑state relational transition model whose FO‑selected updates add/delete tuples and elements; MSO‑FO linear‑time model checking undecidable. Define k‑recency under‑approximation (only the k most‑recent active‑domain elements can be modified) and show MSO‑FO model checking is decidable by reduction to MSO over nested words. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Parosh Aziz Abdulla (Uppsala University)
- 2. C. Aiswarya (Chennai Mathematical Institute)
- 3. Mohamed Faouzi Atig (Uppsala University)
- 4. Marco Montali (Free University of Bolzano)
- 5. Othmane Rezine (Uppsala University)
BibTeX Citation
@inproceedings{abdulla_pods16,
address = {New York, NY, USA},
series = {{PODS} '16},
title = {{Recency-Bounded Verification of Dynamic Database-Driven Systems}},
url = {https://dl.acm.org/doi/10.1145/2902251.2902300},
doi = {10.1145/2902251.2902300},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Abdulla, Parosh Aziz and Aiswarya, C. and Atig, Mohamed Faouzi and Montali, Marco and Rezine, Othmane},
year = {2016}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,516 | VERIFAS: A Practical Verifier for Artifact Systems | 2018 | VLDB | 5.6029996e-05 |
| 11,839 | Reachability in Database-driven Systems with Numerical Attributes under Recency Bounding | 2019 | PODS | 5.093636e-05 |
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 |
|---|---|---|---|---|
| 1,159 | Relational Transducers for Electronic Commerce | 1998 | PODS | 0.00011898742 |
| 2,653 | Foundations of Data-Aware Process Analysis: A Database Theory Perspective | 2013 | PODS | 8.2898925e-05 |
| 5,127 | Verification of Database-driven Systems via Amalgamation | 2013 | PODS | 6.3564332e-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 | 1,630 | On the Decidability of Query Containment under Constraints | 1998 | PODS |
| 2 | 7,972 | On the First-Order Expressibility of Recursive Queries | 1989 | PODS |
| 3 | 4,439 | Temporal Deductive Databases and Infinite Objects | 1988 | PODS |
| 4 | 3,171 | Temporal versus First-Order Logic to Query Temporal Databases | 1996 | PODS |
| 5 | 11,968 | Stable Model Semantics for Tuple-Generating Dependencies Revisited | 2017 | PODS |
| 6 | 12,029 | Bounded Query Rewriting Using Views | 2016 | PODS |
| 7 | 5,127 | Verification of Database-driven Systems via Amalgamation | 2013 | PODS |
| 8 | 12,351 | Querying Schemas With Access Restrictions | 2012 | VLDB |
| 9 | 5,874 | Verification of Relational Data-Centric Dynamic Systems with External Services | 2013 | PODS |
| 10 | 11,839 | Reachability in Database-driven Systems with Numerical Attributes under Recency Bounding | 2019 | PODS |