EXPLOITING SYMMETRIES FOR TESTING EQUIVALENCE VERIFICATION IN THE SPI CALCULUS

DOI10.1142/S0129054106004121zbMATH Open1096.68048MaRDI QIDQ5484904FDOQ5484904

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)

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
• Publication:4942017

zbMATH Keywords

model checkingcryptographic protocolstesting equivalencespi calculus

Mathematics Subject Classification ID

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

Cites Work

• A calculus of mobile processes. I
• Using encryption for authentication in large networks of computers
• A logic of authentication
• Proof techniques for cryptographic processes
• Title not available (Why is that?)

Cited In (1)

• Automated Technology for Verification and Analysis

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)