Verification of database-driven systems via amalgamation

@inproceedings{Bojanczyk2013VerificationOD,
  title={Verification of database-driven systems via amalgamation},
  author={Mikolaj Bojanczyk and Luc Segoufin and Szymon Toruńczyk},
  booktitle={PODS '13},
  year={2013}
}
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… 

Figures from this paper

Recency-Bounded Verification of Dynamic Database-Driven Systems
TLDR
The 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.
Complexity of Reachability for Data-Aware Dynamic Systems
TLDR
This work provides tight complexity bounds for different combinations of schema and query language, by reductions to/from standard formalism of infinite state systems such as Petri nets and counter systems.
Verification of Data-Aware Processes via Array-Based Systems (Extended Version)
TLDR
This work relies on an encoding into array-based systems, which allows it to check safety by adapting backward reachability, establishing for the first time a correspondence with model checking based on Satisfiability-Modulo-Theories (SMT).
Reachability in Database-driven Systems with Numerical Attributes under Recency Bounding
TLDR
This work studies an under-approximation called recency bounding under which the most basic verification problem --reachability, is decidable, and shows that, nevertheless, reachability is ExpTime complete.
Quantifier Elimination for Database Driven Verification
TLDR
This paper shows how covers are strictly related to model completions, a well-known topic in model theory, and investigates the computation of covers within the Superposition Calculus, by adopting a constrained version of the calculus, equipped with appropriate settings and reduction strategies.
From Model Completeness to Verification of Data Aware Processes
TLDR
This paper studies verification over a general model of so-called artifact-centric systems, which are used to capture business processes by giving equal important to the control-flow and data-related aspects, and establishes a correspondence with model checking based on Satisfiability-Modulo-Theories (SMT).
SMT-based verification of data-aware processes: a model-theoretic approach
TLDR
It is shown how SMT techniques can be used for the first time to empower algorithmic techniques for the verification of infinite-state systems based on arrays, so as to make such techniques applicable to the timely, challenging settings of data-aware processes.
Projection Views of Register Automata
TLDR
This paper carries out a formal investigation of views of register automata by considering simple views that project away some of the registers, showing useful properties of these automata such as closure under projection and decidability of verifying temporal properties of their runs.
Formal Modeling and SMT-Based Parameterized Verification of Multi-Case Data-Aware BPMN
TLDR
This work takes inspiration from the literature on verification of artifact systems, and considers verification problems where safety properties are checked irrespectively of the content of the read-only catalog, possibly considering an unbounded number of active cases and tuples in the catalog and repository.
Model checking Petri nets with names using data-centric dynamic systems
TLDR
Decidability and undecidability results are obtained via a translation to data-centric dynamic systems, a recently devised framework for the formal specification and verification of data-aware business processes working over full-fledged relational databases with constraints.
...
1
2
...

References

SHOWING 1-10 OF 13 REFERENCES
Automatic verification of database-driven systems: a new frontier
TLDR
A novel approach to verification of software systems centered around an underlying database is described, which identifies restricted but reasonably expressive classes of applications and properties for which sound and complete verification can be performed in a fully automatic way.
A system for specification and verification of interactive, data-driven web applications
  • L. Sui
  • Computer Science
    SIGMOD Conference
  • 2006
TLDR
For some complex queries against a real-world database, it is shown that MAXENT improves selectivity estimates by orders of magnitude relative to the current DB2 optimizer, and also how these improved estimate influence plan choices as well as query execution times.
Specification and verification of data-driven Web applications
Automata based verification over linearly ordered data domains
TLDR
It is shown that emptiness for such automata is decidable, both over finite and infinite words, under reasonable computability assumptions on the linear order.
LTL with the Freeze Quantifier and Register Automata
TLDR
It is proved that surprisingly, over infinite data words, LTLdarr without the 'until' operator, as well as nonemptiness of one-way universal register automata, are undecidable even when there is only 1 register.
Tree automata techniques and applications
TLDR
The goal of this book is to provide a textbook which presents the basics ofTree automata and several variants of tree automata which have been devised for applications in the aforementioned domains.
Automatic verification of data-centric business processes
TLDR
This investigation builds upon previous work on verification of data-driven Web services and ASM transducers, while addressing significant new technical challenges raised by the artifact model.
Towards nominal computation
TLDR
This paper presents a rudimentary programming language, called Nlambda, that includes a native type for finite sets in the nominal sense, and writes short programs that process automata on data words.
Automata with Group Actions
TLDR
A framework for studying infinite alphabets whose letters can be compared only for equality, where the key role is played by the automorphism group of the alphabet is developed, and automata equivalent in expressive power to finite memory automata are obtained.
A Shorter Model Theory
TLDR
The first order case: compactness 6. The countable case 7. The existential case 8. Structure and categoricity.
...
1
2
...