Analysis of Schemas with Access Restrictions

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.

[1]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[2]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[3]  Gerhard Weikum,et al.  ACM Transactions on Database Systems , 2005 .

[4]  Moshe Y. Vardi,et al.  The Implication Problem for Functional and Inclusion Dependencies is Undecidable , 1985, SIAM J. Comput..

[5]  Andrea Calì,et al.  Dynamic Query Optimization under Access Limitations and Dependencies , 2009, J. Univers. Comput. Sci..

[6]  Jeffrey D. Uuman.  Principles of database and knowledge- base systems , 1989 .

[7]  Serge Abiteboul,et al.  Relational transducers for electronic commerce , 1998, J. Comput. Syst. Sci..

[8]  Surajit Chaudhuri,et al.  On the equivalence of recursive and nonrecursive datalog programs , 1992, J. Comput. Syst. Sci..

[9]  Alin Deutsch,et al.  Rewriting queries using views with access patterns under integrity constraints , 2005, Theor. Comput. Sci..

[10]  Alin Deutsch,et al.  Specification and verification of data-driven Web applications , 2007, J. Comput. Syst. Sci..

[11]  Edward Y. Chang,et al.  Answering queries with useful bindings , 2001, TODS.

[12]  D. Gabbay,et al.  Many-Dimensional Modal Logics: Theory and Applications , 2003 .

[13]  Alin Deutsch,et al.  Automatic verification of data-centric business processes , 2009, ICDT '09.

[14]  Georg Gottlob,et al.  Determining relevance of accesses at runtime , 2011, PODS.

[15]  Marc Spielmann,et al.  Verification of relational transducers for electronic commerce , 2003, J. Comput. Syst. Sci..

[16]  Frank Wolter,et al.  Decidable fragment of first-order temporal logics , 2000, Ann. Pure Appl. Log..

[17]  Andrea Calì,et al.  Conjunctive Query Containment under Access Limitations , 2008, ER.

[18]  Alin Deutsch,et al.  Artifact systems with data dependencies and arithmetic , 2012, TODS.

[19]  Jeffrey D. Ullman,et al.  Principles of Database and Knowledge-Base Systems, Volume II , 1988, Principles of computer science series.

[20]  Diego Calvanese,et al.  Verification of relational data-centric dynamic systems with external services , 2012, PODS.

[21]  Alessio Lomuscio,et al.  An Abstraction Technique for the Verification of Artifact-Centric Systems , 2012, KR.

[22]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[23]  Frank Wolter,et al.  Modal Description Logics: Modalizing Roles , 1999, Fundam. Informaticae.

[24]  Bertram Ludäscher,et al.  Processing first-order queries under limited access patterns , 2004, PODS '04.

[25]  Chen Li,et al.  Computing complete answers to queries in the presence of limited access patterns , 2003, The VLDB Journal.

[26]  Anand Rajaraman,et al.  Answering queries using templates with binding patterns (extended abstract) , 1995, PODS.

[27]  Jeffrey D. Ullman,et al.  Answering queries using templates with binding patterns (extended abstract) , 1995, PODS '95.

[28]  Hubert Comon,et al.  Tree automata techniques and applications , 1997 .

[29]  Jianwen Su,et al.  Automatic construction of simple artifact-based business processes , 2009, ICDT '09.