Communicating Sequential Processes. The First 25 Years

DOI10.1007/B136154MaRDI QIDQ5709372zbMATH OpenOpenAlexFDO

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

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)

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

Cited in

(7)

• Using CSP to verify sequential consistency
• Validating Security Protocols under the General Attacker
• scientific article; zbMATH DE number 1864587 (Why is no real title available?)
• scientific article; zbMATH DE number 1304002 (Why is no real title available?)
• The symbiosis of concurrency and verification: teaching and case studies
• Verifying security protocols with PVS: widening the rank function approach
• scientific article; zbMATH DE number 1948405 (Why is no real title available?)

Describes a project that uses

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)