Take the 2-minute tour ×
Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. It's 100% free, no registration required.

In protocol analysis, formal verification is a very important tool. What are the major differences between CSP, Promela, ...? What are their pros and cons for what specific usage cases? What do you think about graphical representations of communicating systems (gCSP, v-Promela, ...)? What other lesser known/used process calculi do you recommend?

share|improve this question
add comment

closed as too broad by Gilles, DrLecter, figlesquidge, AFS, rath Feb 28 at 21:53

There are either too many possible answers, or good answers would be too long for this format. Please add details to narrow the answer set or to isolate an issue that can be answered in a few paragraphs.If this question can be reworded to fit the rules in the help center, please edit the question.

1 Answer

Is your question regarding the verification of cryptographic protocols or protocols in general?

I do not know much about the field and cannot answer all your questions. I do know that applied Pi calculus is quite popular for cryptographic protocols (especially in cryptographic voting protocols) and the ProVerif tool is often used.

share|improve this answer
I've marked this as not an answer PulpSpy. Probably you did not have enough rep. back in the day. You may want to delete this brand spanking old post :)' –  owlstead Mar 3 at 20:07
add comment

Not the answer you're looking for? Browse other questions tagged or ask your own question.