Concepedia

Nontermination Analysis

Nontermination Analysis is a static program analysis technique that belongs to the class of formal methods for reasoning about computational behavior, specifically distinguished by its focus on identifying and proving the conditions under which programs fail to terminate.

41

Publications

5.8K

Citations

63

Authors

41

Institutions

Publications per year

2017–2026

0

Parents

Publications

41

Guarded commands, nondeterminacy and formal derivation of programs

Edsger W. Dijkstra · Communications of the ACM · 1975 · 1.9K citations · Full text

, , +14

Analysis terminable and interminable.

Sophie Freud · The International Journal of Psychoanalysis · 1937 · 1.5K citations

, , +3

Termination detection for diffusing computations

Edsger W. Dijkstra, Carel S. Schölten · Information Processing Letters · 1980 · 687 citations

, , +5

Development methods for computer programs including a notion of interference

CB Jones · 1981 · 265 citations

, , +14

Proving non-termination

Ashutosh Gupta, Thomas A. Henzinger, Rupak Majumdar et al. · 2008 · 155 citations

, , +15

1–5 of 41

Authors

63

  1. EW
    Edsger W. Dijkstra

    Eindhoven University of Technology, Netherlands

    4 publications · 2.7K citations

    4

    h-index

  2. RM
    Rupak Majumdar

    Max Planck Institute for Software Systems, Germany

    2 publications · 201 citations

    2

    h-index

  3. DV
    Dennis Volpano

    Naval Postgraduate School, United States

    2 publications · 299 citations

    2

    h-index

  4. BC
    Byron Cook

    Microsoft Research (United Kingdom), United Kingdom

    2 publications · 130 citations

    2

    h-index

  5. JB
    Josh Berdine

    Queen Mary University of London, United Kingdom

    2 publications · 130 citations

    2

    h-index

1–5 of 63

Institutions

41

  1. Microsoft Research (United Kingdom)

    Cambridge, United Kingdom

    2 h-index

    4 publications

    260 citations

  2. University of Pennsylvania

    Philadelphia, United States

    2 h-index

    2 publications

    32 citations

  3. University of the Sciences

    Philadelphia, United States

    2 h-index

    2 publications

    32 citations

  4. École Polytechnique Fédérale de Lausanne

    Lausanne, Switzerland

    2 h-index

    2 publications

    201 citations

  5. Universidad Politécnica de Madrid

    Madrid, Spain

    2 h-index

    3 publications

    41 citations

  6. Queen Mary University of London

    London, United Kingdom

    2 h-index

    6 publications

    390 citations

  7. UtopiaCompression (United States)

    Los Angeles, United States

    2 h-index

    4 publications

    402 citations

  8. Observatoire des Sciences de l'Univers de la Réunion

    Saint-Denis, Réunion

    2 h-index

    3 publications

    77 citations

1–8 of 41

Venues

  1. Theoretical Computer Science

    5 publications · 94 citations

    5

    h-index

  2. ACM SIGPLAN Notices

    3 publications · 187 citations

    3

    h-index

  3. Lirias (KU Leuven)

    Repository · 2 publications · 32 citations

    2

    h-index

  4. Acta Informatica

    2 publications · 142 citations

    2

    h-index

  5. Information Processing Letters

    2 publications · 698 citations

    2

    h-index

1–5