ABSTRACT
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.
- Mikołaj Bojańczyk, Laurent Braud, Bartek Klin, and Slawomir Lasota. Towards nominal computation. In Symp. on Principles of Programming Languages (POPL), pages 401--412, 2012. Google Scholar
Digital Library
- Mikołaj Bojańczyk, Bartek Klin, and Slawomir Lasota. Automata with group actions. In Symp. on Logic in Computer Science (LICS), pages 355--364, 2011. Google Scholar
Digital Library
- Stĉphane Demri and Ranko Lazic. LTL with the freeze quantifier and register automata. In Symp. on Logic in Computer Science (LICS), pages 17--26, 2006. Google Scholar
Digital Library
- Alin Deutsch, Richard Hull, Fabio Patrizi, and Victor Vianu. Automatic verification of data-centric business processes. In Intl. Conf. on Database Theory (ICDT), 2009. Google Scholar
Digital Library
- Alin Deutsch, Liying Sui, and Victor Vianu. Specification and verification of data-driven web applications. J. Comput. Syst. Sci., 73(3):442--474, 2007. Google Scholar
Digital Library
- Alin Deutsch, Liying Sui, Victor Vianu, and Dayou Zhou. A system for specification and verification of interactive, data-driven web applications. In Intl. Conf. on Management of Data (SIGMOD), 2006. Google Scholar
Digital Library
- W. Hodges. A shorter model theory. Cambridge Univerity Press, 1997. Google Scholar
Digital Library
- Sheila A. McIlraith, Tran Cao Son, and Honglei Zeng. Semantic web services. IEEE Intelligent Systems, 16(2):46--53, 2001. Google Scholar
Digital Library
- Luc Segoufin and Szymon Toruńczyk. Automata based verification over linearly ordered data domains. In Intl. Symp. on Theoretical Aspects of Computer Science (STACS), 2011.Google Scholar
- Victor Vianu. Automatic verification of database-driven systems: a new frontier. In Intl. Conf. on Database Theory (ICDT), pages 1--13, 2009. Google Scholar
Digital Library
Index Terms
Verification of database-driven systems via amalgamation
Recommendations
The Containment Problem for Unambiguous Register Automata and Unambiguous Timed Automata
AbstractWe investigate the complexity of the containment problem “Does hold?” for register automata and timed automata, where is assumed to be unambiguous and is arbitrary. We prove that the problem is decidable in the case of register ...
Fresh-register automata
POPL '11: Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languagesWhat is a basic automata-theoretic model of computation with names and fresh-name generation? We introduce Fresh-Register Automata (FRA), a new class of automata which operate on an infinite alphabet of names and use a finite number of registers to ...
On Computability of Data Word Functions Defined by Transducers
Foundations of Software Science and Computation StructuresAbstractIn this paper, we investigate the problem of synthesizing computable functions of infinite words over an infinite alphabet (data -words). The notion of computability is defined through Turing machines with infinite inputs which can produce the ...






Comments