Equational Abstraction Refinement for Certified Tree Regular Model Checking

Yohan Boichut 1 Benoît Boyer 2 Thomas Genet 2 Axel Legay 3
2 CELTIQUE - Software certification with semantic analysis
Inria Rennes – Bretagne Atlantique , IRISA-D4 - LANGAGE ET GÉNIE LOGICIEL
3 S4 - System synthesis and supervision, scenarios
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : Tree Regular Model Checking (TRMC) is the name of a family of techniques for analyzing in nite-state systems in which states are represented by trees and sets of states by tree automata. The central problem is to decide whether a set of bad states belongs to the set of reachable states. An obstacle is that this set is in general neither regular nor computable in nite time. This paper proposes a new CounterExample Guided Abstraction Re- nement (CEGAR) algorithm for TRMC. Our approach relies on a new equational-abstraction based completion algorithm to compute a regular overapproximation of the set of reachable states in nite time. This set is represented by R=E-automata, a new extended tree automaton formalism whose structure can be exploited to detect and remove false positives in an e cient manner. Our approach has been implemented in TimbukCEGAR, a new toolset that is capable of analyzing Java programs by exploiting an elegant translation from the Java byte code to term rewriting systems. Experiments show that TimbukCEGAR outperforms existing CEGAR-based completion algorithms. Contrary to existing TRMC toolsets, the answers provided by TimbukCEGAR are certi- ed by Coq, which means that they are formally proved correct.
Document type :
Liste complète des métadonnées

Cited literature [35 references]  Display  Hide  Download

Contributor : Benoît Boyer <>
Submitted on : Friday, May 11, 2012 - 11:03:43 AM
Last modification on : Thursday, February 7, 2019 - 3:45:24 PM
Document(s) archivé(s) le : Thursday, December 15, 2016 - 6:10:37 AM


Files produced by the author(s)


  • HAL Id : inria-00501487, version 2


Yohan Boichut, Benoît Boyer, Thomas Genet, Axel Legay. Equational Abstraction Refinement for Certified Tree Regular Model Checking. [Technical Report] 2010. ⟨inria-00501487v2⟩



Record views


Files downloads