Extrapolation-Based Path Invariants for Abstraction Refinement of Fifo Systems

Alexander Heussner (1) , Grégoire Sutre (1) , Tristan Le Gall (2)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique
2 ULB - Université libre de Bruxelles

The technique of counterexample-guided abstraction refinement (CEGAR) has been successfully applied in the areas of software and hardware verification. Automatic abstraction refinement is also desirable for the safety verification of complex infinite-state models. This paper investigates CEGAR in the context of formal models of network protocols, in our case, the verification of FIFO systems. Our main contribution is the introduction of extrapolation-based path invariants for abstraction refinement. We develop a range of algorithms that are based on this novel theoretical notion, and which are parametrized by different extrapolation operators. These are utilized as subroutines in the refinement step of our CEGAR semi-algorithm that is based on recognizable partition abstractions. We give sufficient conditions for the termination of CEGAR by constraining the extrapolation operator.

Mots clés: fifo systems; verification; path invariants; refinement; CEGAR

Domaines: Autre [cs.OH]

Alexander Heussner, Grégoire Sutre, Tristan Le Gall. Extrapolation-Based Path Invariants for Abstraction Refinement of Fifo Systems. SPIN 2009, Jun 2009, Grenoble, France. pp.107--124, ⟨10.1007/978-3-642-02652-2_11⟩. ⟨hal-00403437⟩