Pushdown System Verification

Pushdown System Verification is a formal method for analyzing and ensuring the correctness of software and computational systems modeled as pushdown automata by verifying that their infinite-state behaviors satisfy specified temporal logic properties.

21

Publications

940

Citations

46

Authors

37

Institutions

Publications per year

2017–2026

0

Authors

46

  1. TT
    Tayssir Touili

    Université Paris Cité, France

    3 publications · 107 citations

    3

    h-index

  2. FS
    Fu Song

    ShanghaiTech University, China

    2 publications · 36 citations

    2

    h-index

  3. AM
    Aniello Murano

    University of Naples Federico II, Italy

    2 publications · 40 citations

    2

    h-index

  4. TR
    Thomas Reps

    University of Wisconsin–Madison, United States

    2 publications · 107 citations

    2

    h-index

  5. PW
    Pierre Wolper

    University of Liège, Belgium

    2 publications · 326 citations

    2

    h-index

1–5 of 46

Venues

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

    Repository · 2 publications · 54 citations

    2

    h-index

  2. Lecture notes in computer science

    LNCS · Book series · 1 publications · 71 citations

    1

    h-index

  3. Journal of Computer Security

    1 publications · 12 citations

    1

    h-index

  4. Journal of the ACM

    JACM · 1 publications · 18 citations

    1

    h-index

  5. Journal of Applied Mathematics

    1 publications · 14 citations

    1

    h-index

1–5