Download PDFOpen PDF in browser

Tool Demonstration of the FLATA Counter Automata Toolset

1 pagesPublished: June 22, 2012

Abstract

We demonstrate the FLATA tool for checking reachability in counter automata using techniques which have recently been developed (such as precise acceleration of self-loops labelled by DBMs or octagons) and/or which are still under development. Apart from analysing counter automata, FLATA allows one to also reduce the given counter automata while preserving reachability of designated control locations. For demonstrating the tool, we use counter automata obtained, e.g., by translation from list manipulating programs or hardware components.

Keyphrases: acceleration, counter automata, reachability

In: Andrei Voronkov, Laura Kovacs and Nikolaj Bjorner (editors). WING 2010. Workshop on Invariant Generation 2010, vol 1, pages 75.

BibTeX entry
@inproceedings{WING2010:Tool_Demonstration_FLATA_Counter,
  author    = {Marius Bozga and Radu Iosif and Filip Konecny and Tomas Vojnar},
  title     = {Tool Demonstration of the FLATA Counter Automata Toolset},
  booktitle = {WING 2010. Workshop on Invariant Generation 2010},
  editor    = {Andrei Voronkov and Laura Kovacs and Nikolaj Bjorner},
  series    = {EPiC Series in Computing},
  volume    = {1},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/hz},
  doi       = {10.29007/5qkv},
  pages     = {75},
  year      = {2012}}
Download PDFOpen PDF in browser