Non-deterministic Execution Analysis

Non-Deterministic Execution Analysis is a formal method for identifying and assessing race condition vulnerabilities by examining program behaviors that arise from unpredictable interleavings of concurrent operations, distinguishing it from deterministic analysis techniques through its focus on non-repeatable, timing-dependent execution paths.

42

Publications

2K

Citations

128

Authors

54

Institutions

Publications per year

2017–2026

5

Authors

128

  1. TB
    Tom Bergan

    University of Oslo, Norway

    4 publications · 443 citations

    4

    h-index

  2. JD
    Joseph Devietti

    University of Washington, United States

    4 publications · 444 citations

    4

    h-index

  3. DG
    Dan Grossman

    University of Washington, United States

    3 publications · 417 citations

    3

    h-index

  4. LC
    Luís Ceze

    University of Washington, United States

    3 publications · 417 citations

    3

    h-index

  5. OT
    Owen T. Anderson

    University of Washington, United States

    3 publications · 417 citations

    3

    h-index

1–5 of 128

Venues

  1. Communications of the ACM

    2 publications · 74 citations

    2

    h-index

  2. Science of Computer Programming

    1 publications · 54 citations

    1

    h-index

  3. Bell Labs Technical Journal

    1 publications · 16 citations

    1

    h-index

  4. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 1 publications · 15 citations

    1

    h-index

  5. Journal of Computer Science and Technology

    1 publications · 26 citations

    1

    h-index

1–5