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”

Model Checking of Concurrent Programs with Static Analysis of Field Accesses

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F15%3A10281099" target="_blank" >RIV/00216208:11320/15:10281099 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1016/j.scico.2014.10.008" target="_blank" >http://dx.doi.org/10.1016/j.scico.2014.10.008</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.scico.2014.10.008" target="_blank" >10.1016/j.scico.2014.10.008</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Model Checking of Concurrent Programs with Static Analysis of Field Accesses

  • Original language description

    Systematic exploration of all possible thread interleavings is a popular approach to detect errors in multi-threaded programs. A common strategy is to use a partial order reduction technique and perform a non-deterministic thread scheduling choice only when the next instruction to be executed may possibly read or modify the global state. However, some verification frameworks and software model checkers, including Java Pathfinder (JPF), construct the program state space on-the-fly during traversal. The partial order reduction technique built into such a tool can use only the information available in the current state to determine whether the execution of a given instruction is globally-relevant. For example, the reduction technique has to make a threadchoice at every field access on a heap object reachable from multiple threads, even in the case of fields that are really accessed only by a single thread during program execution, because it does not have any information about what may h

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GP13-12121P" target="_blank" >GP13-12121P: Practical Program Verification Using Combination of Static and Dynamic Analysis</a><br>

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2015

  • 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

  • Name of the periodical

    Science of Computer Programming

  • ISSN

    0167-6423

  • e-ISSN

  • Volume of the periodical

    98

  • Issue of the periodical within the volume

    4

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    29

  • Pages from-to

    735-763

  • UT code for WoS article

    000347741400012

  • EID of the result in the Scopus database

    2-s2.0-84954370475