All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Automata-Based Termination Proofs

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F09%3APU82664" target="_blank" >RIV/00216305:26230/09:PU82664 - isvavai.cz</a>

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Automata-Based Termination Proofs

  • Original language description

    This paper proposes a framework for detecting termination of programs<br>handling infinite and complex data domains, such as pointer structures. In<br>this framework, the user has to specify a finite number of well-founded relations<br>on the data domainmanipulated by these programs. Our tool then builds an initial<br>abstraction of the program, which is checked for existence of potential infinite<br>runs, by testing emptiness of its intersection with a predefined Buchi automaton.<br>If the intersection is non-empty, a lasso-shaped counterexample is found. This<br>counterexample is checked for spuriousness by a domain-specific procedure, and<br>in case it is found to be spurious, the abstraction is refined, again by intersection<br>with the complementof the Buchi automaton representing the lasso. We have instantiated<br>the framework for programs handling tree-like data structures, which<br>allowed us to prove termination of programs such as the depth-first tree traversal,<br>the Deu

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    JC - Computer hardware and software

  • OECD FORD branch

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2009

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Implementation and Application of Automata

  • ISBN

    978-3-642-02978-3

  • ISSN

  • e-ISSN

  • Number of pages

    13

  • Pages from-to

  • Publisher name

    Springer Verlag

  • Place of publication

    Berlin

  • Event location

    Sydney

  • Event date

    Apr 14, 2009

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article