Reachability in Database-driven Systems with Numerical Attributes under Recency Bounding
Summary: Extend database-manipulating systems to include numerical attributes with order and introduce recency-bounding as an under-approximation that tames unbounded active domain, numeric domain, and execution length. Under recency bounding reachability is decidable and ExpTime-complete; full LTL model checking is undecidable. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
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)
BibTeX Citation
@inproceedings{abdulla_pods19,
address = {New York, NY, USA},
series = {{PODS} '19},
title = {{Reachability in Database-driven Systems with Numerical Attributes under Recency Bounding}},
url = {https://dl.acm.org/doi/10.1145/3294052.3319705},
doi = {10.1145/3294052.3319705},
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},
year = {2019}
}
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 6 of 6 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,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 |
| 5,959 | Recency-Bounded Verification of Dynamic Database-Driven Systems | 2016 | PODS | 6.0274692e-05 |
| 7,516 | VERIFAS: A Practical Verifier for Artifact Systems | 2018 | VLDB | 5.6029996e-05 |
| 7,518 | Verification of Hierarchical Artifact Systems | 2016 | PODS | 5.6029996e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,584 | Rewriting the Infinite Chase | 2022 | VLDB |
| 2 | 2,241 | Finitely Representable Databases | 1994 | PODS |
| 3 | 11,525 | Data Path Queries over Embedded Graph Databases | 2022 | PODS |
| 4 | 4,353 | Chase Termination for Guarded Existential Rules | 2015 | PODS |
| 5 | 6,286 | Finite Queries do not Have Effective Syntax | 1995 | PODS |
| 6 | 11,127 | Verification of Unary Communicating Datalog Programs | 2024 | PODS |
| 7 | 5,874 | Verification of Relational Data-Centric Dynamic Systems with External Services | 2013 | PODS |
| 8 | 12,351 | Querying Schemas With Access Restrictions | 2012 | VLDB |
| 9 | 5,127 | Verification of Database-driven Systems via Amalgamation | 2013 | PODS |
| 10 | 5,959 | Recency-Bounded Verification of Dynamic Database-Driven Systems | 2016 | PODS |