Communicating Sequential Processes. The First 25 Years

DOI10.1007/B136154zbMATH Open1081.68656OpenAlexW4213168192MaRDI QIDQ5709372FDOQ5709372

Authors: Rob Delicata, S. A. Schneider 

Publication date: 29 November 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b136154

Recommendations

• Verifying security protocols with PVS: widening the rank function approach
• Models and Proofs of Protocol Security: A Progress Report
• Model Checking Security Protocols
• scientific article; zbMATH DE number 2087629
• scientific article; zbMATH DE number 1860614

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Authentication, digital signatures and secret sharing (94A62)

Cited In (7)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Verifying security protocols with PVS: widening the rank function approach
• Validating Security Protocols under the General Attacker
• Using CSP to verify sequential consistency
• The symbiosis of concurrency and verification: teaching and case studies

Uses Software

• Casper

This page was built for publication: Communicating Sequential Processes. The First 25 Years

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