EXPLOITING SYMMETRIES FOR TESTING EQUIVALENCE VERIFICATION IN THE SPI CALCULUS

DOI10.1142/S0129054106004121MaRDI QIDQ5484904zbMATH OpenFDO

Authors Ivan Cibrario Bertolotti, Luca Durante, Riccardo Sisto, Adriano Valenzano

Publication date 21 August 2006

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054106004121

zbMATH Keywords

cryptographic protocolsmodel checkingspi calculustesting equivalence

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Automated Technology for Verification and Analysis
• scientific article; zbMATH DE number 1507234
• A complete symbolic bisimilarity for an extended spi calculus
• CONCUR 2004 - Concurrency Theory
• On bisimulations for the spi calculus
• On bisimulations for the spi calculus
• Employing symmetry reductions in model checking
• scientific article; zbMATH DE number 1418460

Cites work

• A calculus of mobile processes. I
• A logic of authentication
• scientific article; zbMATH DE number 750184 (Why is no real title available?)
• Proof techniques for cryptographic processes
• Using encryption for authentication in large networks of computers

Cited in

(1)

• Automated Technology for Verification and Analysis

Describes a project that uses

Uses Software

• Casper

This page was built for publication: EXPLOITING SYMMETRIES FOR TESTING EQUIVALENCE VERIFICATION IN THE SPI CALCULUS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5484904)