 Decidable Inductive Invariants for Verification of Cryptographic
Protocols with Unbounded SessionsInternational Conference on Concurrency Theory (CONCUR), 2019 |
 Logic of Intuitionistic Interactive Proofs (Formal Theory of Perfect
Knowledge Transfer)ACM Transactions on Computational Logic (TOCL), 2013 |
 Elementary Deduction Problem for Locally Stable Theories with Normal
FormsWorkshop on Logical and Semantic Frameworks with Applications (LSFA), 2013 |
 |
