Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Design and validation of computer protocols
Design and validation of computer protocols
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Symbolic Model Checking
Protocol Verification as a Hardware Design Aid
ICCD '92 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
Static Partial Order Reduction
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Partial-Order Reduction in Symbolic State Space Exploration
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Generating BDDs for Symbolic Model Checking in CCS
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
The BDD Space Complexity of Different Forms of Concurrency
ACSD '01 Proceedings of the Second International Conference on Application of Concurrency to System Design
Generating Compact MTBDD-Representations from Probmela Specifications
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
Type inference and strong static type checking for Promela
Science of Computer Programming
S2N: model transformation from SPIN to NuSMV
SPIN'12 Proceedings of the 19th international conference on Model Checking Software
| Hi-index | 0.00 |
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 present paper provides an introduction to p2b, a description of how it works and two benchmark examples.