Automatic verification of data-centric business processes
We formalize and study business process systems that are centered around" business
artifacts", or simply" artifacts". Artifacts are used to represent (real or conceptual) key …
artifacts", or simply" artifacts". Artifacts are used to represent (real or conceptual) key …
Artifact systems with data dependencies and arithmetic
E Damaggio, A Deutsch, V Vianu - ACM Transactions on Database …, 2012 - dl.acm.org
We study the static verification problem for data-centric business processes, specified in a
variant of IBM's “business artifact” model. Artifacts are records of variables that correspond to …
variant of IBM's “business artifact” model. Artifacts are records of variables that correspond to …
Automatic verification of database-centric systems
We present an overview of results on verification of temporal properties of infinite-state
transition systems arising from processes that carry and manipulate unbounded data. The …
transition systems arising from processes that carry and manipulate unbounded data. The …
Automatic verification of database-driven systems: a new frontier
V Vianu - Proceedings of the 12th International Conference on …, 2009 - dl.acm.org
We describe a novel approach to verification of software systems centered around an
underlying database. Instead of applying general-purpose techniques with only partial …
underlying database. Instead of applying general-purpose techniques with only partial …
Automatic verification of database-centric systems
A Deutsch, R Hull, V Vianu - ACM SIGMOD Record, 2014 - dl.acm.org
Software systems centered around a database are pervasive in numerous applications.
They are encountered in areas as diverse as electronic commerce, e-government, scientific …
They are encountered in areas as diverse as electronic commerce, e-government, scientific …
What else is decidable about integer arrays?
We introduce a new decidable logic for reasoning about infinite arrays of integers. The logic
is in the ∃^*∀^* first-order fragment and allows (1) Presburger constraints on existentially …
is in the ∃^*∀^* first-order fragment and allows (1) Presburger constraints on existentially …
Automatic verification of data-centric business processes
Recent years have witnessed the evolution of business process specification frameworks
from the traditional process-centric approach towards data-awareness. Process-centric …
from the traditional process-centric approach towards data-awareness. Process-centric …
Automata based verification over linearly ordered data domains
L Segoufin, S Toruńczyk - … on Theoretical Aspects of Computer Science …, 2011 - hal.science
In this paper we work over linearly ordered data domains equipped with finitely many unary
predicates and constants. We consider nondeterministic automata processing words and …
predicates and constants. We consider nondeterministic automata processing words and …
Rewriting Systems with Data: A Framework for Reasoning about Systems with Unbounded Structures over Infinite Data Domains
We introduce a uniform framework for reasoning about infinite-state systems with
unbounded control structures and unbounded data domains. Our framework is based on …
unbounded control structures and unbounded data domains. Our framework is based on …
Model checking freeze LTL over one-counter automata
We study complexity issues related to the model-checking problem for LTL with registers
(aka freeze LTL) over one-counter automata. We consider several classes of one-counter …
(aka freeze LTL) over one-counter automata. We consider several classes of one-counter …