ABSTRACT
We 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 and adding tuples to the relations. The elements which are modified by an action are chosen by (full) first-order queries. (DMS) is a highly expressive model and can be thought of as a succinct representation of an infinite state relational transition system, in line with similar models proposed in the literature. We propose monadic second order logic (MSO-FO) to reason about sequences of database instances appearing along a run. Unsurprisingly, the linear-time model checking problem of (DMS) against (MSO-FO) is undecidable. Towards decidability, we propose under-approximate model checking of (DMS), where the under-approximation parameter is the "bound on recency". In a k-recency-bounded run, only the most recent k elements in the current active domain may be modified by an action. More runs can be verified by increasing the bound on recency. Our main result shows that recency-bounded model checking of (DMS) against (MSO-FO) is decidable, by a reduction to the satisfiability problem of MSO over nested words.
- P. A. Abdulla. Well (and better) quasi-ordered transition systems. Bulletin of Symbolic Logic, 16(4):457--515, 2010.Google ScholarCross Ref
- P. A. Abdulla, C. Aiswarya, M. F. Atig, M. Montali, and O. Rezine. Recency-bounded verification of dynamic database-driven systems (extended version). Corr technical report, arXiv.org e-Print archive, 2016.Google Scholar
- S. Abiteboul, V. Vianu, B. Fordham, and Y. Yesha. Relational transducers for electronic commerce. JCSS, 61(2):236--269, 2000. Google ScholarDigital Library
- R. Alur and P. Madhusudan. Adding nesting structure to words. J. ACM, 56(3), 2009. Google ScholarDigital Library
- B. Bagheri Hariri, D. Calvanese, G. De Giacomo, R. De Masellis, and P. Felli. Foundations of relational artifacts verification. In BPM, 2011. Google ScholarDigital Library
- B. Bagheri Hariri, D. Calvanese, G. De Giacomo, A. Deutsch, and M. Montali. Verification of relational data-centric dynamic systems with external services. In PODS, 2013. Google ScholarDigital Library
- F. Belardinelli, A. Lomuscio, and F. Patrizi. Verification of deployed artifact systems via data abstraction. In ICSOC, 2011. Google ScholarDigital Library
- F. Belardinelli, A. Lomuscio, and F. Patrizi. An abstraction technique for the verification of artifact-centric systems. In KR, 2012.Google Scholar
- M. Bojanczyk, L. Segoufin, and S. Torunczyk. Verification of database-driven systems via amalgamation. In PODS, 2013. Google ScholarDigital Library
- D. Calvanese, G. De Giacomo, and M. Montali. Foundations of data-aware process analysis: A database theory perspective. In PODS. ACM Press, 2013. Google ScholarDigital Library
- P. Cangialosi, G. De Giacomo, R. De Masellis, and R. Rosati. Conjunctive artifact-centric services. In ICSOC, 2010.Google ScholarCross Ref
- D. Cohn and R. Hull. Business artifacts: A data-centric approach to modeling business operations and processes. IEEE Data Engineering Bullettin, 32(3), 2009.Google Scholar
- E. Damaggio, A. Deutsch, and V. Vianu. Artifact systems with data dependencies and arithmetic. In ICDT, 2011. Google ScholarDigital Library
- E. Damaggio, R. Hull, and R. Vaculín. On the equivalence of incremental and fixpoint semantics for business artifacts with guard-stage-milestone lifecycles. In BPM, 2011. Google ScholarDigital Library
- A. Deutsch, R. Hull, F. Patrizi, and V. Vianu. Automatic verification of data-centric business processes. In ICDT, pages 252--267, 2009. Google ScholarDigital Library
- A. Deutsch, L. Sui, and V. Vianu. Specification and verification of data-driven web applications. JCSS, 73(3):442--474, 2007. Google ScholarDigital Library
- R. Hull. Artifact-centric business process models: Brief survey of research results and challenges. In OTM Confederated Int.\ Conf., 2008. Google ScholarDigital Library
- V. Künzle and M. Reichert. Philharmonicflows: towards a framework for object-aware process management. Journal of Software Maintenance, 23(4):205--244, 2011. Google ScholarDigital Library
- V. Künzle, B. Weber, and M. Reichert. Object-aware business processes: Fundamental requirements and their support in existing approaches. Int. J. of Information System Modeling and Design, 2(2):19--46, 2011. Google ScholarDigital Library
- C. Lautemann, T. Schwentick, and D. Thérien. Logics for context-free languages. In CSL, volume 933 of LNCS, pages 205--216. Springer, 1995. Google ScholarDigital Library
- A. Lomuscio and J. Michaliszyn. Model checking unbounded artifact-centric systems. In KR. AAAIP, 2014.Google Scholar
- A. Meyer, S. Smirnov, and M. Weske. Data in business processes. Technical Report 50, Hasso-Plattner-Institut for IT Systems Engineering, Universität Potsdam, 2011.Google Scholar
- M. Montali and D. Calvanese. Soundness of data-aware, case-centric processes. International Journal on Software Tools for Technology Transfer, pages 1--24, 2016.Google ScholarDigital Library
- A. Nigam and N. S. Caswell. Business artifacts: An approach to operational specification. IBM Systems Journal, 42(3), 2003. Google ScholarDigital Library
- M. Reichert. Process and data: Two sides of the same coin? In O™, volume 7565 of LNCS, pages 2--19. Springer, 2012.Google Scholar
- D. Solomakhin, M. Montali, S. Tessaris, and R. De Masellis. Verification of artifact-centric systems: Decidability and modeling issues. In ICSOC, 2013. Google ScholarDigital Library
- M. Y. Vardi. Model checking for database theoreticians. In ICDT, volume 3363 of LNCS, pages 1--16. Springer, 2005. Google ScholarDigital Library
Index Terms
- Recency-Bounded Verification of Dynamic Database-Driven Systems
Recommendations
Formal verification of ASMs using MDGs
We present a framework for the formal verification of abstract state machine (ASM) designs using the multiway decision graphs (MDG) tool. ASM is a state based language for describing transition systems. MDG provides symbolic representation of transition ...
Formal Verification of Database Applications Using Predicate Abstraction
AbstractFormal verification has gained paramount attention from both academia and industry over more than 4 decades. Intensive research in this direction has resulted in many verification approaches, covering almost all mainstream languages. Unfortunately,...
The Complexity of Model Checking Multi-stack Systems
LICS '13: Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer ScienceWe consider the linear-time model checking problem for boolean concurrent programs with recursive procedure calls. While sequential recursive programs are usually modeled as pushdown automata, concurrent recursive programs involve several processes and ...
Comments