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”

Fast Error Detection with Hybrid Analyses of Future Accesses

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F16%3A10322813" target="_blank" >RIV/00216208:11320/16:10322813 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1145/2851613.2851935" target="_blank" >https://doi.org/10.1145/2851613.2851935</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1145/2851613.2851935" target="_blank" >10.1145/2851613.2851935</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Fast Error Detection with Hybrid Analyses of Future Accesses

  • Original language description

    Systematic state space traversal is a popular approach for detecting errors in multithreaded programs. Nevertheless, it is very expensive because any non-trivial program exhibits a huge number of possible interleavings. Some kind of guided and bounded search is often used to achieve good performance. We present two heuristics that are based on a hybrid static-dynamic analysis that can identify possible accesses to shared objects. One heuristic changes the order in which transitions are explored, and the second heuristic prunes selected transitions. Results of experiments on several Java programs, which we performed using our prototype implementation in Java Pathfinder, show that the hybrid analysis together with heuristics significantly improves the performance of error detection.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GA14-11384S" target="_blank" >GA14-11384S: Automatic Formal Analysis and Verification of Programs with Complex Unbounded Data and Control Structures</a><br>

  • Continuities

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

Others

  • Publication year

    2016

  • 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

    Proceedings of the ACM Symposium on Applied Computing

  • ISBN

    978-1-4503-3739-7

  • ISSN

  • e-ISSN

  • Number of pages

    4

  • Pages from-to

    1251-1254

  • Publisher name

    ACM

  • Place of publication

    New York, NY, USA

  • Event location

    Pisa, Italy

  • Event date

    Apr 4, 2016

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article