DBScholar

Back to papers

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)

Paper ID
1799
Venue
PODS
Year
2019
Pagerank
5.093636e-05
Overall Rank
11,839 | 18.78%
DOI
10.1145/3294052.3319705

Incoming Non-self Citations Over Time

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

Authors

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.

Previous Page 1 / 1 Next

Semantically Similar Papers