Termination Of Imperative Programs

Termination of Imperative Programs is a formal method in program analysis that determines whether a given imperative program will always halt under all possible execution paths by analyzing its control flow and loop structures to ensure finite execution.

29

Publications

1.3K

Citations

54

Authors

32

Institutions

Publications per year

2017–2026

5

Authors

54

  1. KC
    Krishnendu Chatterjee

    Institute of Science and Technology Austria, Austria

    3 publications · 126 citations

    3

    h-index

  2. YT
    Yih-Kuen Tsay

    National Taiwan University, Taiwan

    2 publications · 91 citations

    2

    h-index

  3. SQ
    Shengchao Qin

    Teesside University, United Kingdom

    2 publications · 51 citations

    2

    h-index

  4. PL
    Peter Lee

    Imperial College London, United Kingdom

    2 publications · 91 citations

    2

    h-index

  5. SA
    Sheshansh Agrawal

    Indian Institute of Technology Bombay, India

    2 publications · 98 citations

    2

    h-index

1–5 of 54

Venues

  1. ACM SIGPLAN Notices

    4 publications · 95 citations

    4

    h-index

  2. Proceedings of the ACM on Programming Languages

    PACMPL · 2 publications · 94 citations

    2

    h-index

  3. Formal Aspects of Computing

    1 publications · 31 citations

    1

    h-index

  4. HAL (Le Centre pour la Communication Scientifique Directe)

    Repository · 1 publications · 16 citations

    1

    h-index

  5. Electronic Notes in Theoretical Computer Science

    ENTCS · 1 publications · 13 citations

    1

    h-index

1–5