Guarded Recursion

Guarded Recursion is a syntactic restriction in process algebra that ensures recursive process definitions are well-defined by requiring recursion to occur only under the scope of a prefixing action, thereby preventing immediate self-replication and guaranteeing unique solutions to recursive equations.

40

Publications

2.5K

Citations

54

Authors

36

Institutions

Publications per year

2017–2026

10

Authors

54

  1. RE
    Rasmus Ejlers Møgelberg

    IT University of Copenhagen, Denmark

    7 publications · 173 citations

    7

    h-index

  2. LB
    Lars Birkedal

    Aarhus University, Denmark

    7 publications · 173 citations

    7

    h-index

  3. AB
    Aleš Bizjak

    Aarhus University, Denmark

    3 publications · 51 citations

    3

    h-index

  4. DG
    Daniel Gratzer

    Aarhus University, Denmark

    3 publications · 91 citations

    3

    h-index

  5. SI
    Sorin Istrail

    Brown University, United States

    3 publications · 568 citations

    3

    h-index

1–5 of 54

Venues

  1. Electronic Notes in Theoretical Computer Science

    ENTCS · 5 publications · 119 citations

    5

    h-index

  2. Mathematical Structures in Computer Science

    MSCS · 3 publications · 78 citations

    3

    h-index

  3. Logical Methods in Computer Science

    LMCS · 3 publications · 45 citations

    3

    h-index

  4. ACM SIGPLAN Notices

    3 publications · 111 citations

    3

    h-index

  5. 1

    h-index

1–5