Affiliation:
1. University of Oxford, Oxford, UK
2. CNRS LIFL University of Lille I and INRIA Lille Nord Europe, France
Abstract
We study verification of systems whose transitions consist of
accesses to a Web-based data source
. An access is a lookup on a relation within a relational database, fixing values for a set of positions in the relation. For example, a transition can represent access to a Web form, where the user is restricted to filling in values for a particular set of fields. We look at verifying properties of a schema describing the possible accesses of such a system. We present a language where one can describe the properties of an access path and also specify additional restrictions on accesses that are enforced by the schema. Our main property language, AccessLTL, is based on a first-order extension of linear-time temporal logic, interpreting access paths as sequences of relational structures. We also present a lower-level automaton model, A-automata, into which AccessLTL specifications can compile. We show that AccessLTL and A-automata can express static analysis problems related to “querying with limited access patterns” that have been studied in the database literature in the past, such as whether an access is relevant to answering a query and whether two queries are equivalent in the accessible data they can return. We prove decidability and complexity results for several restrictions and variants of AccessLTL and explain which properties of paths can be expressed in each restriction.
Funder
EPSRC EP/H017690/1
Engineering and Physical Sciences Research Council UK
INRIA project Northern European associate teams between INRIA Lille and University of Oxford
Publisher
Association for Computing Machinery (ACM)
Reference26 articles.
1. S. Abiteboul R. Hull and V. Vianu. 1995. Foundations of Databases. Addison-Wesley. S. Abiteboul R. Hull and V. Vianu. 1995. Foundations of Databases. Addison-Wesley.
2. Relational Transducers for Electronic Commerce
3. Determining relevance of accesses at runtime
4. Dynamic query optimization under access limitations and dependencies;Calì A.;J. Univer. Comput. Sci.,2009
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献