Abstract
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.
Michael Baldamus’s work is supported by the Deutsche Forschungsgemeinschaft within the Project Design and Design Methodology of Embedded Systems. M.B. Dwyer (Ed.): SPIN 2001, LNCS 2057, pp. 183-191, 2001.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R. Alur, R. Brayton, T. Henzinger, S. Qadeer, and S. Rajmani. Partial-Order Reduction in Symbolic State Space Exploration. In Computer-Aided Verification, pages 340–351. Springer-Verlag, 1997. Proceedings CAV’ 97.
M. Baldamus and K Schneider. The BDD Space Complexity of Different Forms of Concurrency, 2001. Accepted for ICACSD’ 01.
R. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, C-35(8):677–691, 1986.
J. Burch, E. Clarke, K. McMillan, D. Dill, and L. Hwang. Symbolic Model Checking: 1020 States and Beyond. In Logic in Computer Science, pages 1–33. IEEE Computer Society Press, 1990. Proceedings LICS’ 90 symposium.
D. Dill, A. Drexler, A. Hu, and C. Han Yang. Protocol Verification as a Hardware Design Aid. In Computer Design: VLSI in Computers and Processors, pages 522–525, 1992. IEEE Conference Proceedings.
R. Enders, T. Filkorn, and D. Taubner. Generating BDDs for Symbolic Model Checking in CCS. In Computer-Aided Verification, LNCS 575, pages 203–213. Springer-Verlag, 1991. Proceedings CAV’ 91 conference.
G. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1991.
G. Holzmann. The Model Checker SPIN. IEEE Transactions on Computer Engineering, 23:279–295, 1997.
Kurshan, R. and Levin, V. and Peled, D. and Yenigün, H. Static Partial Order Reduction. In Tools and Algorithms for the Construction and Analysis of Systems, LNCS 1384, pages 345–357. Springer-Verlag, 1998. Proceedings TACAS’ 98 conference.
K. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baldamus, M., Schröder-Babo, J. (2001). p2b: A translation utility for linking promela and symbolic model checking (tool paper). In: Dwyer, M. (eds) Model Checking Software. SPIN 2001. Lecture Notes in Computer Science, vol 2057. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45139-0_11
Download citation
DOI: https://doi.org/10.1007/3-540-45139-0_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42124-5
Online ISBN: 978-3-540-45139-6
eBook Packages: Springer Book Archive