Verification of Database-driven Systems via Amalgamation
Summary: Framework for static verification of finite-register, database-driven systems whose transitions are quantifier-free queries over a fixed constrained database (data trees or relations). Technique based on amalgamation yields ExpSpace decidability for XML data trees with descendant and data comparisons, PSpace for relational schemas, and shows slight model extensions are undecidable. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,910 | Recency-Bounded Verification of Dynamic Database-Driven Systems | 2016 | PODS | 6.636109e-05 |
| 11,555 | Projection Views of Register Automata | 2020 | PODS | 4.1945683e-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 1 of 1 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,496 | A System for Specification and Verification of Interactive, Data-driven Web Applications | 2006 | SIGMOD | 8.6474041e-05 |
Previous
Page 1 / 1
Next