YAPA
From MaRDI portal
Publication:2946688
DOI10.1145/2422085.2422089zbMath1353.68019OpenAlexW1991537775MaRDI QIDQ2946688
Mathieu Baudet, Stéphanie Delaune, Véronique Cortier
Publication date: 17 September 2015
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2422085.2422089
Cryptography (94A60) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42) Network protocols (68M12)
Related Items (6)
Stateful applied pi calculus: observational equivalence and labelled bisimilarity ⋮ Computing knowledge in equational extensions of subterm convergent theories ⋮ A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols ⋮ Intruder deduction problem for locally stable theories with normal forms and inverses ⋮ YAPA ⋮ YAPA: A Generic Tool for Computing Intruder Knowledge
Uses Software
This page was built for publication: YAPA
