A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit <a rel="external noopener" href="https://arxiv.org/pdf/1806.11459v2.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Verification of Data-Aware Processes via Array-Based Systems (Extended Version)
[article]
<span title="2019-02-27">2019</span>
<i >
arXiv
</i>
<span class="release-stage" >pre-print</span>
Preserved Fulltext
Other Versions
<span title="2018-06-29">2018</span>
<span class="release-stage" >pre-print</span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1806.11459v1">arXiv:1806.11459v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ws4oxmpj2vffrizv3cqjy3jk2m">fatcat:ws4oxmpj2vffrizv3cqjy3jk2m</a> </span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1806.11459v1">arXiv:1806.11459v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ws4oxmpj2vffrizv3cqjy3jk2m">fatcat:ws4oxmpj2vffrizv3cqjy3jk2m</a> </span>
We study verification over a general model of artifact-centric systems, to assess (parameterized) safety properties irrespectively of the initial database instance. We view such artifact systems as array-based systems, which allows us to check safety by adapting backward reachability, establishing for the first time a correspondence with model checking based on Satisfiability-Modulo-Theories (SMT). To do so, we make use of the model-theoretic machinery of model completion, which surprisingly
<span class="external-identifiers">
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1806.11459v2">arXiv:1806.11459v2</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/j3iv2rnwuvbpzdp6mnlcfie2mq">fatcat:j3iv2rnwuvbpzdp6mnlcfie2mq</a>
</span>
more »
... ns out to be an effective tool for verification of relational systems, and represents the main original contribution of this paper. In this way, we pursue a twofold purpose. On the one hand, we reconstruct (restricted to safety) the essence of some important decidability results obtained in the literature for artifact-centric systems, and we devise a genuinely novel class of decidable cases. On the other, we are able to exploit SMT technology in implementations, building on the well-known MCMT model checker for array-based systems, and extending it to make all our foundational results fully operational.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200907110550/https://arxiv.org/pdf/1806.11459v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/b6/4e/b64ec7e5e66c50e8d2d40123048ce46e1ea7bb45.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1806.11459v2" title="arxiv.org access">
<button class="ui compact blue labeled icon button serp-button">
<i class="file alternate outline icon"></i>
arxiv.org
</button>
</a>