A shorter model theory
IEEE Intelligent Systems
A system for specification and verification of interactive, data-driven web applications
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
LTL with the Freeze Quantifier and Register Automata
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Specification and verification of data-driven Web applications
Journal of Computer and System Sciences
Automatic verification of database-driven systems: a new frontier
Proceedings of the 12th International Conference on Database Theory
Automatic verification of data-centric business processes
Proceedings of the 12th International Conference on Database Theory
LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
| Hi-index | 0.00 |
We describe a general framework for static verification of systems that base their decisions upon queries to databases. The database is specified using constraints, typically a schema, and is not modified during a run of the system. The system is equipped with a finite number of registers for storing intermediate information from the database and the specification consists of a transition table described using quantifier-free formulas that can query either the database or the registers. Our main result concerns systems querying XML databases -- modeled as data trees -- using quantifier-free formulas with predicates such as the descendant axis or comparison of data values. In this scenario we show an ExpSpace algorithm for deciding reachability. Our technique is based on the notion of amalgamation and is quite general. For instance it also applies to relational databases (with an optimal PSpace algorithm). We also show that minor extensions of the model lead to undecidability.