Model Completeness, Uniform Interpolants and Superposition Calculus (With Applications to Verification of Data-Aware Processes)

J. of Automated Reasoning. 65(7):941--969 2021.

Uniform interpolants have been largely studied in non-classical propositional logics since the nineties; a successive research line within the automated reasoning community investigated uniform quantifier-free interpolants (sometimes referred to as "covers") in first-order theories. This further research line is motivated by the fact that uniform interpolants offer an effective solution to tackle quantifier elimination and symbol elimination problems, which are central in model checking infinite state systems. This was first pointed out in ESOP 2008 by Gulwani and Musuvathi, and then by the authors of the present contribution in the context of recent applications to the verification of data-aware processes. In this paper, we show how covers are strictly related to model completions, a well-known topic in model theory. We also investigate the computation of covers within the Superposition Calculus, by adopting a constrained version of the calculus and by defining appropriate settings and reduction strategies. In addition, we show that computing covers is computationally tractable for the fragment of the language used when tackling the verification of data-aware processes. This observation is confirmed by analyzing the preliminary results obtained using the MCMT tool to verify relevant examples of data-aware process. These examples can be found in the last version of the tool distribution.

@article{JAR-2021,
   title = "Model Completeness, Uniform Interpolants and Superposition
Calculus (With Applications to Verification of Data-Aware Processes)",
   year = "2021",
   author = "Diego Calvanese and Silvio Ghilardi and Alessandro Gianola and
Marco Montali and Andrey Rivkin",
   journal = "J. of Automated Reasoning",
   pages = "941--969",
   number = "7",
   volume = "65",
   doi = "10.1007/s10817-021-09596-x",
}