Parosh Aziz Abdulla
ABSTRACT
A prominent research direction of the database theory community is to develop techniques for verification of database-driven systems operating over relational and numerical data. Along this line, we lift the framework of database manipulating systems \citeAbdullaAAMR-pods-16 which handle relational data to also accommodate numerical data and the natural order on them. We study an under-approximation called recency bounding under which the most basic verification problem --reachability, is decidable. Even under this under-approximation the reachability space is infinite in multiple dimensions -- owing to the unbounded sizes of the active domain, the unbounded numerical domain it has access to, and the unbounded length of the executions. We show that, nevertheless, reachability is ExpTime complete. Going beyond reachability to LTL model checking renders verification undecidable.
- Parosh Aziz Abdulla, C. Aiswarya, and Mohamed Faouzi Atig. 2017. Data Multi-Pushdown Automata. In CONCUR (LIPIcs), Vol. 85. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 38:1--38:17.Google Scholar
- P. A. Abdulla, M. F. Atig, G. Delzanno, and A. Podelski. 2013. Push-Down Automata with Gap-Order Constraints. In FSEN (LNCS), Vol. 8161. Springer, 199--216.Google Scholar
- Parosh Aziz Abdulla, C. Aiswarya, Mohamed Faouzi Atig, Marco Montali, and Othmane Rezine. 2016. Recency-Bounded Verification of Dynamic Database-Driven Systems. In PODS. ACM, 195--210.Google Scholar
- Parosh Aziz Abdulla, C. Aiswarya, Mohamed Faouzi Atig, Marco Montali, and Othmane Rezine. 2018. Complexity of Reachability for Data-Aware Dynamic Systems. In ACSD. IEEE Computer Society, 11--20.Google Scholar
- Babak Bagheri Hariri, Diego Calvanese, Giuseppe De Giacomo, Alin Deutsch, and Marco Montali. 2013. Verification of Relational Data-Centric Dynamic Systems with External Services. In PODS . Google ScholarDigital Library
- Francesco Belardinelli, Alessio Lomuscio, and Fabio Patrizi. 2012. Verification of GSM-Based Artifact-Centric Systems through Finite Abstraction. In ICSOC (LNCS), Vol. 7636. Springer, 17--31. Google ScholarDigital Library
- Francesco Belardinelli, Alessio Lomuscio, and Fabio Patrizi. 2014. Verification of Agent-Based Artifact Systems. J. Artif. Intell. Res., Vol. 51 (2014), 333--376. Google ScholarDigital Library
- Mikolaj Boja'n czyk, Anca Muscholl, Thomas Schwentick, and Luc Segoufin. 2009. Two-variable logic on data trees and XML reasoning. J. ACM, Vol. 56, 3 (2009), 13:1--13:48. Google ScholarDigital Library
- Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin, and Claire David. 2006. Two-Variable Logic on Words with Data. In LICS. 7--16. Google ScholarDigital Library
- Mikolaj Bojanczyk, Luc Segoufin, and Szymon Torunczyk. 2013. Verification of Database-Driven Systems via Amalgamation. In PODS .Google Scholar
- B. Bollig, A. Cyriac, P. Gastin, and K. Narayan Kumar. 2012. Model Checking Languages of Data Words. In FoSSaCS'12 (LNCS), Vol. 7213. Springer, 391--405. Google ScholarDigital Library
- Diego Calvanese, Giuseppe De Giacomo, and Marco Montali. 2013. Foundations of Data-Aware Process Analysis: A Database Theory Perspective. In PODS . ACM Press. Google ScholarDigital Library
- Diego Calvanese, Giuseppe De Giacomo, Marco Montali, and Fabio Patrizi. 2018. First-order (?) -calculus over generic transition systems and applications to the situation calculus. Inf. Comput., Vol. 259, 3 (2018), 328--347.Google ScholarCross Ref
- Diego Calvanese, Giorgio Delzanno, and Marco Montali. 2015. Verification of Relational Multiagent Systems with Data Types. In AAAI. AAAIP. Google ScholarDigital Library
- Diego Calvanese, Marco Montali, Fabio Patrizi, and Michele Stawowy. 2016. Plan Synthesis for Knowledge and Action Bases. In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9--15 July 2016, Subbarao Kambhampati (Ed.). IJCAI/AAAI Press, 1022--1029. http://www.ijcai.org/Abstract/16/149 Google ScholarDigital Library
- Lorenzo Clemente and Slawomir Lasota. 2015. Reachability Analysis of First-order Definable Pushdown Systems. In CSL 2015, (LIPIcs), Vol. 41. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 244--259.Google Scholar
- E. Damaggio, A. Deutsch, and V. Vianu. 2011. Artifact Systems with Data Dependencies and Arithmetic. In ICDT . Google ScholarDigital Library
- Giuseppe De Giacomo, Riccardo De Masellis, and Riccardo Rosati. 2012. Verification of Conjunctive Artifact-Centric Services. Int. J. Cooperative Inf. Syst., Vol. 21, 2 (2012), 111--140.Google ScholarCross Ref
- Stéphane Demri and Ranko Lazi?. 2009. LTL with the freeze quantifier and register automata. ACM TOCL, Vol. 10, 3 (2009). Google ScholarDigital Library
- Alin Deutsch, Richard Hull, Fabio Patrizi, and Victor Vianu. 2009. Automatic verification of data-centric business processes. In ICDT . Google ScholarDigital Library
- A. Deutsch, Y. Li, and V. Vianu. 2016. Verification of Hierarchical Artifact Systems. In Proc. of PODS. ACM Press, 179--194. Google ScholarDigital Library
- Jö rg Hoffmann, Piergiorgio Bertoli, Malte Helmert, and Marco Pistore. 2009. Message-Based Web Service Composition, Integrity Constraints, and Planning under Uncertainty: A New Connection. J. Artif. Intell. Res., Vol. 35 (2009), 49--117. Google ScholarDigital Library
- Yuliang Li, Alin Deutsch, and Victor Vianu. 2017. VERIFAS: A Practical Verifier for Artifact Systems. Proc. VLDB Endow., Vol. 11, 3 (Nov. 2017), 283--296. Google ScholarDigital Library
- Riccardo De Masellis, Chiara Di Francescomarino, Chiara Ghidini, Marco Montali, and Sergio Tessaris. 2017. Add Data into Business Process Verification: Bridging the Gap between Theory and Practice. In AAAI . Google ScholarDigital Library
- Shaz Qadeer and Jakob Rehof. 2005. Context-Bounded Model Checking of Concurrent Software. In TACAS. Springer Berlin Heidelberg, 93--107. Google ScholarDigital Library
- Victor Vianu. 2009. Automatic Verification of Database-Driven Systems: a New Frontier. In Proc. of ICDT . 1--13.Google ScholarDigital Library
Index Terms
- Reachability in Database-driven Systems with Numerical Attributes under Recency Bounding
Recommendations
Recency-Bounded Verification of Dynamic Database-Driven Systems
PODS '16: Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database SystemsWe propose a formalism to model database-driven systems, called database manipulating systems (DMS). The actions of a (DMS) modify the current instance of a relational database by adding new elements into the database, deleting tuples from the relations ...
Verification of database-driven systems via amalgamation
PODS '13: Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systemsWe 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 ...
Eliminating the storage tape in reachability constructions
A discrete pushdown timed automaton is a pushdown machine with integer-valued clocks. It has been shown recently that the binary reachability of a discrete pushdown timed automaton can be accepted by a two-tape pushdown acceptor with reversal-bounded ...
Comments