Database Paper Browser

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
1767
Venue
PODS
Year
2019
Pagerank
4.1905499e-05
Overall Rank
11,649 | 19.04%
DOI
10.1145/3294052.3319705

Incoming Non-self Citations Over Time

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

Authors

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

Overall Rank Paper Year Venue Pagerank
11,388 Rewriting the Infinite Chase 2022 VLDB 4.1905499e-05
1,648 Finitely Representable Databases 1994 PODS 0.00011007456
11,328 Data Path Queries over Embedded Graph Databases 2022 PODS 4.1905499e-05
3,913 Chase Termination for Guarded Existential Rules 2015 PODS 6.6311557e-05
6,380 Finite Queries do not Have Effective Syntax 1995 PODS 5.0841675e-05
10,910 Verification of Unary Communicating Datalog Programs 2024 PODS 4.1905499e-05
4,183 Verification of Relational Data-Centric Dynamic Systems with External Services 2013 PODS 6.3721558e-05
12,163 Querying Schemas With Access Restrictions 2012 VLDB 4.1905499e-05
4,002 Verification of Database-driven Systems via Amalgamation 2013 PODS 6.5406774e-05
3,914 Recency-Bounded Verification of Dynamic Database-Driven Systems 2016 PODS 6.6297199e-05