Invariant-based Verification

Invariant-Based Verification is a formal method in security protocol verification that belongs to the class of deductive verification techniques, distinguished by its reliance on identifying and proving inductive invariants—logical properties preserved across all protocol execution states—to establish the correctness of security properties.

70

Publications

3.6K

Citations

203

Authors

118

Institutions

Publications per year

2017–2026

16

Authors

203

  1. TN
    Thanh-Hung Nguyen

    Hanoi University of Science and Technology, Vietnam

    3 publications · 114 citations

    3

    h-index

  2. PM
    Péter Müller

    ETH Zurich, Switzerland

    3 publications · 165 citations

    3

    h-index

  3. JS
    Joseph Sifakis

    Verimag, France

    3 publications · 114 citations

    3

    h-index

  4. AL
    Axel Legay

    Institut national de recherche en sciences et technologies du numérique, France

    3 publications · 114 citations

    3

    h-index

  5. SB
    Saddek Bensalem

    Verimag, France

    3 publications · 114 citations

    3

    h-index

1–5 of 203

Venues

  1. IEEE Transactions on Software Engineering

    TSE · 4 publications · 257 citations

    4

    h-index

  2. ACM SIGPLAN Notices

    3 publications · 87 citations

    3

    h-index

  3. Proceedings of the ACM on Programming Languages

    PACMPL · 2 publications · 72 citations

    2

    h-index

  4. Science of Computer Programming

    2 publications · 159 citations

    2

    h-index

  5. ACM Transactions on Embedded Computing Systems

    TECS · 2 publications · 33 citations

    2

    h-index

1–5