informal Formal Methods Meetings
iFM2 is a series of informal talks held at the University of Udine on everything about Formal Methods. The series has seen a great number of talks from people all around Italy and beyond. Here you find the slides for almost all the talks held so far.
The current health crysis has forced iFM2 to stop, but it will resume very soon (virtually). Stay tuned!
We develop a theory of decidable inductive invariants for an infinite-state variant of the Applied pi-calculus, with applications to automatic verification of stateful cryptographic protocols with unbounded sessions/nonces. Since the problem is undecidable in general, we introduce depth-bounded protocols, a strict generalisation of a class from the literature, for which our decidable analysis is sound and complete. Our core contribution is a procedure to check that an invariant is inductive, which implies that every reachable configuration satisfies it. Our invariants can capture security properties like secrecy, can be inferred automatically, and represent an independently checkable certificate of correctness. We provide a prototype implementation and we report on its performance on some textbook examples.