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”

Reachability Analysis for Multiloop Programs Using Transition Power Abstraction

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F24%3A10490643" target="_blank" >RIV/00216208:11320/24:10490643 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1007/978-3-031-71162-6_29" target="_blank" >https://doi.org/10.1007/978-3-031-71162-6_29</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-031-71162-6_29" target="_blank" >10.1007/978-3-031-71162-6_29</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Reachability Analysis for Multiloop Programs Using Transition Power Abstraction

  • Original language description

    A wide variety of algorithms is employed for the reachability analysis of programs with loops but most of them are restricted to single loop programs. Recently a new technique called Transition Power Abstraction (TPA) showed promising results for safety checks of software. In contrast to many other techniques TPA efficiently handles loops with a large number of iterations. This paper introduces an algorithm that enables the effective use of TPA for analysis of multiloop programs. The TPA-enabled loop analysis reduces the dependency on the number of possible iterations. Our approach analyses loops in a modular manner and both computes and uses transition invariants incrementally, making program analysis efficient. The new algorithm is implemented in the Golem solver. Conducted experiments demonstrate that this approach outperforms the previous implementation of TPA and other competing tools on a wide range of multiloop benchmarks.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/GA23-06506S" target="_blank" >GA23-06506S: Advanced Analysis and Verification for Advanced Software</a><br>

  • Continuities

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

Others

  • Publication year

    2024

  • 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

    FORMAL METHODS, PT I, FM 2024

  • ISBN

    978-3-031-71161-9

  • ISSN

    0302-9743

  • e-ISSN

    1611-3349

  • Number of pages

    19

  • Pages from-to

    558-576

  • Publisher name

    SPRINGER INTERNATIONAL PUBLISHING AG

  • Place of publication

    CHAM

  • Event location

    Milan

  • Event date

    Sep 9, 2024

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    001336893300029