How to Compose Presburger-Accelerations: Applications to Broadcast Protocols
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Fast verification of the class of stop-and-wait protocols modelled by coloured Petri nets
Nordic Journal of Computing
The Petri net markup language: concepts, technology, and tools
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
Flat acceleration in symbolic model checking
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Flat counter automata almost everywhere!
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
A BDD-Like implementation of an automata package
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Discovering properties about arrays in simple programs
Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
Convex Hull of Arithmetic Automata
SAS '08 Proceedings of the 15th international symposium on Static Analysis
T(O)RMC: A Tool for (ω)-Regular Model Checking
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Reversal-Bounded Counter Machines Revisited
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Don't care words with an application to the automata-based approach for real addition
Formal Methods in System Design
TaPAS: The Talence Presburger Arithmetic Suite
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Symbolic Execution Based Model Checking of Open Systems with Unbounded Variables
TAP '09 Proceedings of the 3rd International Conference on Tests and Proofs
LIRA: handling constraints of linear arithmetics over the integers and the reals
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Ehrenfeucht--Fraïssé goes automatic for real addition
Information and Computation
Constrained monotonic abstraction: a CEGAR for parameterized verification
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
On the use of non-deterministic automata for presburger arithmetic
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Fast acceleration of ultimately periodic relations
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Computing minimal separating DFAs and regular invariants using SAT and SMT solvers
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
| Hi-index | 0.00 |
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.