p2b: A Translation Utility for Linking Promela and Symbolic Model Checking (Tool Paper)

p2b is a research tool that translates Promela programs to boolean representations of the automata associated with them. These representations conform to the input syntax of the widely–used symbolic model checker SMV; it is then possible to verify the automata with SMV, as opposed to enumerative model checking with SPIN, the classical Promela verifier. SMV and SPIN are focussed on verifying branching or linear time temporal properties, respectively, and often exhibit different performance on problems that are expressible within both frameworks. Hence we envisage that p2b will provide the missing link in establishing a verification scenario that is based on Promela as modeling language, and where one chooses different logics and verification methods as needed. The

• Type: Conference
• Year: 2001
• Where: SPIN
• Authors: Michael Baldamus, Jochen Schröder-Babo
• Keywords: Classical Promela Verifier, SPIN 2001, Symbolic Model Checker, Theoretical Computer Science, Time Temporal Properties