DMCA
Tool Presentation: FAST Extended Release
| Citations: | 1 - 0 self |
BibTeX
@MISC{Bardin_toolpresentation:,
author = {Sébastien Bardin and Jérôme Leroux and Gérald Point and Labri Uni Bordeaux},
title = {Tool Presentation: FAST Extended Release},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. Fast is a tool designed for the analysis of counter systems, i.e. automata extended with unbounded integer variables. Despite the reachability set is not recursive in general, Fast implements several innovative techniques such as acceleration and circuit selection to solve this problem in practice. In its latest version, the tool is built upon an open architecture: the Presburger library is manipulated through a clear and convenient interface, thus any Presburger arithmetics package can be plugged to the tool. We provide four implementations of the interface using Lash, Mona, Omega and a new shared automata package with computation cache. Finally new features are available, like different acceleration algorithms.
Keyphrases
tool presentation presburger arithmetic package computation cache different acceleration algorithm automaton package convenient interface open architecture reachability set unbounded integer variable presburger library counter system circuit selection several innovative technique new feature
