Abstract
With the development of ASIC designs, simulation cannot cover all the corner cases in a complicated design. Model checking is a fully automatic approach to verify a finite state machine against its temporal specifications. However, its application is limited by the size of the system to be verified. Compositional verification and model reduction are two possible methods to tackle this problem. In this paper, we propose a verification framework based on assume-guarantee compositional model checking, where we can apply model checking to do exhaustive verification at the module level and conduct global properties via compositional reasoning. In this framework, temporal specifications are synthesized into Verilog modules. In case a module under verification is beyond the capability of model checking, the proposed model reduction algorithm is used. We implemented the framework on top of the VIS tool and applied it on an ATM switch fabric from Nortel Networks.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arora, A., Attie, P.C., Emerson, E.A.: Synthesis of fault-tolerant concurrent programs. In: Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing, Puerto Vallarta, Mexico, June 1998, pp. 173–182 (1998)
Brayton, R.K., et al.: VIS: A system for verification and synthesis. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 428–432. Springer, Heidelberg (1996)
Cadence Design Systems. Technical manual of FormalCheck, v2.3 edn. (1987-1999)
Clarke, E.M., Grumberg, O., Long, D.: Model checking and abstraction. ACM Transactions on Programming Languages and Systems 16(5), 1512–1542 (1994)
Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Conference Record of the Fourth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Los Angeles, California, USA, pp. 238–252 (1977)
Emerson, E.A., Clarke, E.M.: Using branching time temporal logic to synthesize synchronization skeletons. Science of Computer Programming 2(3), 241–266 (1982)
Grumberg, O., Long, D.E.: Model checking and modular verification. ACM Transactions on Programming Languages and Systems 16(3), 843–871 (1994)
Holzmann, G.J.: Design and validation of computer protocols. Prentice-Hall, Englewood Cliffs (1991)
Kesten, Y., Pnueli, A.: Modularization and abstraction: the key to practical formal verification. In: 23rd Int. Symp. Mathematical Foundations of Computer Science, Brno, Czech Republic (1998)
Kurshan, R.P.: Computer-aided verification of coordinating processes. Princeton University Press, Princeton (1994)
Long, D.E.: Model Checking, Abstraction, and Compositional Verification. PhD thesis, CMU (1993)
Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems: Safety. Springer, New York (1991)
McMillan, K.L.: Symbolic Model Checking. Kluwer, Dordrecht (1993)
Peng, H., Mokhtari, Y., Tahar, S.: Environment synthesis for compositional model checking. In: Proceeding of IEEE International Conference on Computer Design, Freiburg, Germany. IEEE computer society Press, Los Alamitos (September 2002)
Namjoshi, K.S., Kurshan, R.P.: Syntactic program transformations for automatic abstraction. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 433–449. Springer, Heidelberg (2000)
Pasareanu, C.S., Dwyer, M.B., Huth, M.: Assume-guarantee model checking of software: A comparative case study. In: Dams, D.R., Gerth, R., Leue, S., Massink, M. (eds.) SPIN 1999. LNCS, vol. 1680, pp. 168–183. Springer, Heidelberg (1999)
Peng, H., Mokhtari, Y., Tahar, S.: Model reduction based on value dependency. In: Proceeding of IEEE International ASIC/SOC Conference, Washigton, DC, USA (September 2001)
Peng, H., Tahar, S.: Compositional verification of IP based designs. In: Proceedings of IFIP International Workshop on IP Based Synthesis and System Design, Grenoble, France (December 1999)
Pnueli, A.: In transition for global to modular temporal reasoning about programs. In: Kurshan, K.R. (ed.) Logics and Models of Concurrent Systems. NATO ASI series. Series F, vol. 13. Springer, Heidelberg (1984)
Northern Telecom. Specification of a 4*4 ATM switch (November 1998)
Yorav, K.: Exploiting syntactic structure for automatic verification. PhD thesis, Israel institute of technology (June 2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Peng, H., Tahar, S., Mokhtari, Y. (2003). Compositional Verification of a Switch Fabric from Nortel Networks. In: Dong, J.S., Woodcock, J. (eds) Formal Methods and Software Engineering. ICFEM 2003. Lecture Notes in Computer Science, vol 2885. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39893-6_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-39893-6_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20461-9
Online ISBN: 978-3-540-39893-6
eBook Packages: Springer Book Archive