A Synchronization Calculus for Message Oriented Programming.

TL;DR: This paper formalizes the notion of the synchronization structure of concurrent programs that use the rendezvous (or similar) mechanism for achieving synchronization and presents complexity results which indicate what may be expected and shed light on the difficulty of correctly constructing concurrent systems.

TL;DR: Three new reduction strategies for conventional reachability analysis, as used in automated protocol validation algorithms, are shown to have a potential for substantially improving the performance of a conventional search.

TL;DR: A simple symbolic execution method based on vector addition is extended into a full protocol validator, carefully avoiding known performance bottlenecks and allows validation of protocol systems up to 10 6 states in only minutes of CPU time on a medium size computer.

TL;DR: This paper sketches a verification method, based on automated model extraction, that was first applied in the verification of the call processing software for a new Lucent Technologies’ system called PathStar.