Proving hybrid protocols correct

DOI10.1007/3-540-44755-5_9MaRDI QIDQ4790655zbMATH OpenFDO

Authors Mark Bickford, Christoph Kreitz, Robbert van Renesse, Xiaoming Liu

Publication date 4 February 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2152/21520105

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• A proof of protocol correctness
• Protocol Verification via Projections
• An algorithmic technique for protocol verification
• Verification of parameterized protocols
• Protocol Verification Via Rigid/Flexible Resolution
• Towards the correctness of security protocols
• scientific article; zbMATH DE number 2086169

Cited in

(2)

• A proof of protocol correctness
• Innovations in computational type theory using Nuprl

Describes a project that uses

Uses Software

• PVS
• Nuprl
• HOL
• Isabelle
• Horus
• ACL2

This page was built for publication: Proving hybrid protocols correct

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