Reasoning about Universal Cubes in MCMT - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

Reasoning about Universal Cubes in MCMT

270-285

Abstract

The Model Checking Modulo Theories (MCMT) framework is a powerful model checking technique for verifying safety properties of parameterized transition systems. In MCMT, logical formulas are used to represent both transitions and sets of states and safety properties are verified by an SMT-based backward reachability analysis. To be fully automated , the class of formulas handled in MCMT is restricted to cubes, i.e. existentially quantified conjunction of literals. While being very expressive , cubes cannot define properties with a global termination condition , usually described by a universally quantified formula. In this paper we describe BRWP, an extension of the backward reach-ability of MCMT for reasoning about validity properties expressed as universal cubes, that is formulas of the form ∃i∀j.C(i, j), where C(i, j) is a conjunction of literals. Our approach consists in a tight cooperation between the backward reachability loop and a deductive verification engine based on weakest-precondition calculus (WP). To provide evidence for the applicability of our new algorithm, we show how to make Cubicle, a model checker based on MCMT, cooperates with the Why3 platform for deductive program verification.
Fichier principal
Vignette du fichier
main.pdf (510.93 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02420588 , version 1 (20-12-2019)

Identifiers

  • HAL Id : hal-02420588 , version 1

Cite

Sylvain Conchon, Mattias Roux. Reasoning about Universal Cubes in MCMT. ICFEM 2019 - 21st International Conference on Formal Engineering Methods, Nov 2019, Shenzhen, China. pp.270--285. ⟨hal-02420588⟩
49 View
95 Download

Share

Gmail Facebook X LinkedIn More