DMCA
Experimenting Acceleration Methods for the Validation of Infinite State Systems (2000)
| Venue: | In International Workshop on Distributed System Validation and Verification (DSVV'2000 |
| Citations: | 2 - 0 self |
BibTeX
@INPROCEEDINGS{Bodeveix00experimentingacceleration,
author = {Jean-paul Bodeveix and Mamoun Filali and Irit Universite and Paul Sabatier},
title = {Experimenting Acceleration Methods for the Validation of Infinite State Systems},
booktitle = {In International Workshop on Distributed System Validation and Verification (DSVV'2000},
year = {2000}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In this paper, we present a generic validation tool, called FMona. We illustrate its use through the expression of iterative and abstraction methods. These methods are applied for the validation of infinite or parameterized space problems. We propose two techniques to enhance iterative methods by accelerating their convergence. These techniques are expressed in FMona and applied on some examples. Keywords: Verification Technique, Validation tools, parameterized systems. 1. Introduction In recent years, important work has been done in the design and implementation of general specification languages and validation systems. Usually, we distinguish three families of tools: model checkers (SMV [6], SPIN [11]) to build a finite model and check its temporal properties; automatic proof tools (Mona [10] for the WSnS logic, its extension to structured types Lisa [2]), and proof assistants (Coq [3], HOL [8] and PVS [16]) which offer an expressive higher order logic (and thus not decidable) and...
Keyphrases
acceleration method infinite state system verification technique parameterized system important work generic validation tool recent year temporal property model checker type lisa general specification language abstraction method order logic wsns logic finite model parameterized space problem iterative method validation system automatic proof tool proof assistant
