Database Paper Browser

Back to papers

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)

Paper ID
1695
Venue
PODS
Year
2016
Pagerank
6.636109e-05
Overall Rank
3,910 | 72.81%
DOI
10.1145/2902251.2902300

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
6,913 VERIFAS: A Practical Verifier for Artifact Systems 2018 VLDB 4.8925595e-05
11,645 Reachability in Database-driven Systems with Numerical Attributes under Recency Bounding 2019 PODS 4.1945683e-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.

Previous Page 1 / 1 Next

Semantically Similar Papers