48 citations · 91 across the 10 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.LO2019★ 2 cited
Decidable Inductive Invariants for Verification of Cryptographic Protocols with Unbounded Sessions
Emanuele D'Osualdo, Felix Stutz
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 cryptographi…
cs.PL2019★ 17 cited
TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Programs
Emanuele D'Osualdo, Azadeh Farzan, Philippa Gardner +1
We present TaDA Live, a concurrent separation logic for reasoning compositionally about the termination of blocking fine-grained concurrent programs. The crucial challenge is how t…