Path Constraint Solving

Path Constraint Solving is a computational method in symbolic execution that determines the satisfiability of symbolic path conditions to identify feasible execution paths through a program.

70

Publications

6.3K

Citations

174

Authors

93

Institutions

Publications per year

2017–2026

10

Authors

174

  1. YD
    Yves Deville

    UCLouvain, Belgium

    4 publications · 85 citations

    4

    h-index

  2. AG
    Arnaud Gotlieb

    Simula Research Laboratory, Norway

    3 publications · 107 citations

    3

    h-index

  3. ST
    Spyros Tragoudas

    Southern Illinois University Carbondale, United States

    3 publications · 116 citations

    3

    h-index

  4. TK
    Turgay Korkmaz

    The University of Texas at San Antonio, United States

    3 publications · 116 citations

    3

    h-index

  5. MP
    Marco Pistoia

    JPMorgan Chase & Co (United States), United States

    3 publications · 104 citations

    3

    h-index

1–5 of 174

Venues

  1. Software Practice and Experience

    2 publications · 232 citations

    2

    h-index

  2. Journal of Computer and System Sciences

    2 publications · 141 citations

    2

    h-index

  3. ACM SIGSOFT Software Engineering Notes

    SEN · 2 publications · 315 citations

    2

    h-index

  4. Software Testing Verification and Reliability

    STVR · 1 publications · 78 citations

    1

    h-index

  5. ACM SIGPLAN Notices

    1 publications · 10 citations

    1

    h-index

1–5