Computational Tree Logic

Computational Tree Logic is a branching-time temporal logic used in formal verification, distinguished from linear-time logics by its ability to express properties over tree-structured computational paths through quantification over future states.

135

Publications

4.3K

Citations

369

Authors

187

Institutions

Publications per year

2017–2026

20

Authors

369

  1. YL
    Yongming Li

    Shaanxi Normal University, China

    5 publications · 204 citations

    5

    h-index

  2. ZM
    Zhanyou Ma

    Shaanxi Normal University, China

    4 publications · 172 citations

    4

    h-index

  3. PP
    P. P. Chakrabarti

    Indian Institute of Technology Kharagpur, India

    4 publications · 66 citations

    4

    h-index

  4. FM
    Francesco M. Donini

    Polytechnic University of Bari, Italy

    3 publications · 97 citations

    3

    h-index

  5. LC
    Lorenzo Capra

    University of Milan, Italy

    3 publications · 47 citations

    3

    h-index

1–5 of 369

Venues

  1. Theoretical Computer Science

    4 publications · 97 citations

    4

    h-index

  2. Electronic Notes in Theoretical Computer Science

    ENTCS · 4 publications · 106 citations

    4

    h-index

  3. 3

    h-index

  4. IEEE Transactions on Software Engineering

    TSE · 3 publications · 90 citations

    3

    h-index

  5. Pure and Applied Geophysics

    PAGEOPH · 2 publications · 243 citations

    3

    h-index

1–5