Abstract
This article presents a formal specification and validation environment to prove safety and liveness properties of parametric -- unbounded -- NoCs architectures described at a high-level of abstraction. The environment improves the GeNoC approach with two new theorems, proving evacuation and starvation freedom. The application of the validation methodology is illustrated on a HERMES NoC with adaptive west-first routing and wormhole switching. This case study illustrates the strong compositional aspect of the GeNoC environment. The complete specification of this HERMES instance, together with the proof that the specification is deadlock-free, starvation free, and all messages eventually leave the network at their correct destination, could be achieved in about a week. Approximately 86% of this proof is automatically derived from the GeNoC model.
- Amjad, H. 2004. Model checking the AMBA protocol in HOL. Tech. rep., Computer Laboratory, University of Cambridge.Google Scholar
- Baier, C. and Katoen, J.-P. 2008. Principles of Model Checking. MIT Press. Cambridge, MA. Google ScholarDigital Library
- Benini, L. and Micheli, G. D. 2002. Networks on chips: A new SoC paradigm. Computer 35, 1, 70--78. Google ScholarDigital Library
- Borrione, D., Helmy, A., Pierre, L., and Schmaltz, J. 2007. A generic model for formally verifying noc communication architectures: A case study. In Proceedings of the First International Symposium on Networks-on-Chip (NOCS’07). IEEE, Los Alamitos, CA, 127--136. Google ScholarDigital Library
- Borrione, D., Helmy, A., Pierre, L., and Schmaltz, J. 2008. Executable formal specification and validation of NoC communication infrastructures. In Proceedings of the 21st Annual Symposium on Integrated Circuits and System Design (SBCCI’08). ACM, New York, 176--181. Google ScholarDigital Library
- Borrione, D., Helmy, A., Pierre, L., and Schmaltz, J. 2009. A formal approach to the verification of networks on chip. EURASIP J. Embed. Syst., Article ID 548324. Google ScholarDigital Library
- Chatterjee, S. and Kishinevsky, M. 2010. Automatic generation of inductive invariants from high-level microarchitectural models of communication fabrics. In Proceedings of the of Computer Aided Verification Conference (CAV’10). 321--338. Google ScholarDigital Library
- Chatterjee, S., Kishinevsky, M., and Ogras, U. 2010. Quick formal modeling of communication fabrics to enable verification. In Proceedings of the High Level Design Validation and Test Workshop (HLDVT’10). 42--49.Google Scholar
- Cormen, T., Leiserson, C., and Rivest, R. 1990. Introduction to Algorithms. MIT Press and McGraw Hill. Google ScholarDigital Library
- Dally, W. 2009. The end of denial architecture. In Proceedings of the Design Automation Conference (DAC’09).Google Scholar
- Dally, W. and Seitz, C. 1987. Deadlock-free message routing in multiprocessor interconnection networks. IEEE Trans. Computers 36. Google ScholarDigital Library
- Dally, W. J. and Towles, B. 2001. Route packets, not wires: On-chip interconnection networks. In Proceedings of the Design Automation Conference. ACM, New York, 684--689. Google ScholarDigital Library
- Duato, J. 1995. A necessary and sufficient condition for deadlock-free adaptive routing in wormhole networks. IEEE Trans. Parall. Distrib. Syst. 6, 10 (10), 1055--1067. Google ScholarDigital Library
- Duato, J. 1996. A necessary and sufficient condition for deadlock-free routing in cut-through and store-and-forward networks. IEEE Trans. Parall. Distrib. Syst. 7, 8, 841--854. Google ScholarDigital Library
- Duato, J., Yalamanchili, S., and Ni, L. 2003. Interconnection Networks, An Engineering Approach. Morgan Kaufmann. Google ScholarDigital Library
- Fleury, E. and Fraigniaud, P. 1998. A general theory for deadlock avoidance in wormhole routed networks. IEEE Trans. Parall. Distrib. Syst. 9, 7, 626--638. Google ScholarDigital Library
- Gebremichael, B., Vaandrager, F., Zhang, M., Goossens, K., Rijpkema, E., and Radulescu, A. 2005. Deadlock prevention in the Æthereal protocol. In Correct Hardware Design and Verification Methods 3725/2005. 345--348. Google ScholarDigital Library
- Glass, C. J. and Ni, L. M. 1994. The turn model for adaptive routing. J. ACM 41, 5, 874--902. Google ScholarDigital Library
- Hajek, B. 1991. Bounds on evacuation time for deflection routing. Distrib. Comput. 5, 1, 1--6. Google ScholarDigital Library
- Helmy, A., Pierre, L., and Jantsch, A. 2010. Theorem proving techniques for the formal verification of NoC communications with non-minimal adaptive routing. In Proceedings of the IEEE Symposium on Design and Diagnostics of Electronic System (DDECS’10).Google Scholar
- Kaufmann, M., Manolios, P., and Moore, J. S. 2000. ACL2 Computer-Aided Reasoning: An Approach. Kluwer Academic Press.Google Scholar
- Keutzer, K., Newton, A. R., Rabaey, J. M., and Sangiovanni-Vincentelli, A. L. 2000. System-level design: orthogonalization of concerns and platform-based design. IEEE Trans. CAD Integrat. Circuits Syst. 19, 12, 1523--1543. Google ScholarDigital Library
- Moraes, F., Calazans, N., Mello, A., Möller, L., and Ost, L. 2004. HERMES: An infrastructure for low area overhead packet-switching networks on chip. Integration, VLSI J. 38, 1, 69--93. Google ScholarDigital Library
- Ni, L. and McKinley, P. 1993. A survey of wormhole routing techniques in direct networks. IEEE Computer 26, 62--76. Google ScholarDigital Library
- Roychoudhury, A., Mitra, T., and Karri, S. 2003. Using formal techniques to debug the AMBA System-on-Chip bus protocol. In Proceedings of the Design Automation and Test Europe Conference (DATE’03). 828--833. Google ScholarDigital Library
- Schmaltz, J. 2006. Une formalisation fonctionnelle des communications sur la puce. Ph.D. dissertation,, Joseph Fourier University, Grenoble. www.cs.ru.nl/~julien/. (In French.)Google Scholar
- Schmaltz, J. and Borrione, D. 2004. A functional approach to the formal specification of networks on chip. In Proceedings of Formal Methods in Computer-Aided Design (FMCAD’04). Lecture Notes in Computer Science, vol. 3312, A. Hu and A. Martin Eds., Springer, Berlin, 52--66.Google Scholar
- Schmaltz, J. and Borrione, D. 2006. Towards a formal theory of on chip communications in the ACL2 logic. In Proceedings of the 6th International Workshop on the ACL2 Theorem Prover and its Applications (part of FloC’06). ACM, New York. Google ScholarDigital Library
- Schmaltz, J. and Borrione, D. 2008. A functional formalization of on chip communications. Formal Aspects Comput. 20, 241--258. Google ScholarCross Ref
- Silla, F., Malumbres, M. P., Robles, A., Lopez, P., and Duato, J. 1997. Efficient adaptive routing in networks of workstations with irregular topology. In Proceedings of the 1st International Workshop on Communication and Architectural Support for Network-Based Parallel Computing (CANPC’97). Springer, Berlin, 46--60. Google ScholarDigital Library
- Taktak, S., Encrenaz, E., and Desbarbieux, J.-L. 2010. A polynomial algorithm to prove deadlock-freeness of wormhole networks. In Proceedings of the 18th Euromicro International Conference on Parallel, Distributed and Network-Based Computing (PDP’10). Google ScholarDigital Library
- Verbeek, F. and Schmaltz, J. 2010a. A formal proof of a necessary and sufficient condition for deadlock-free adaptive networks. In Interactive Theorem Proving. M. Kaufmann and L. Paulson Eds., Lecture Notes in Computer Science, vol. 6172, Springer, Berlin, 67--82. Google ScholarDigital Library
- Verbeek, F. and Schmaltz, J. 2010b. Formal specification of networks-on-chips: Deadlock and evacuation. In Proceedings of the Design, Automation and Test in Europe Conference (DATE). 1701--1706. Google ScholarDigital Library
- Verbeek, F. and Schmaltz, J. 2010c. Proof pearl: A formal proof of Dally and Seitz’ necessary and sufficient condition for deadlock-free routing in interconnection networks. J. Automat. Reason. 1--21. Google ScholarDigital Library
- Verbeek, F. and Schmaltz, J. 2011a. A comment on “A necessary and sufficient condition for deadlock-free adaptive routing in wormhole networks”. IEEE Trans. Parall. Distrib. Syst. 99, Preprints. Google ScholarDigital Library
- Verbeek, F. and Schmaltz, J. 2011b. A fast and verified algorithm for proving store-and-forward networks deadlock-free. In Proceedings of the 19th Euromicro International Conference on Parallel, Distributed and Network-based Computing (PDP’11). Google ScholarDigital Library
- Verbeek, F. and Schmaltz, J. 2011c. On necessary and sufficient conditions for deadlock-free routing in wormhole networks. IEEE Trans. Parall. Distrib. Syst. 99, Preprints. Google ScholarDigital Library
Index Terms
Easy Formal Specification and Validation of Unbounded Networks-on-Chips Architectures
Recommendations
Automatic verification for deadlock in Networks-on-Chips with adaptive routing and wormhole switching
NOCS '11: Proceedings of the Fifth ACM/IEEE International Symposium on Networks-on-ChipWormhole switching is a switching technique nowadays commonly used in networks-on-chips (NoCs). It is efficient but prone to deadlock. The design of a deadlock-free adaptive routing function constitutes an important challenge. We present a novel ...
Towards the formal verification of cache coherency at the architectural level
Special section on verification challenges in the concurrent worldCache coherency is one of the major issues in multicore systems. Formal methods, in particular model-checking, have been successful at verifying high-level protocols, but, to the best of our knowledge, the verification of cache coherency at the ...
A formal specification strategy for electronic commerce
IDEAS '97: Proceedings of the 1997 International Symposium on Database Engineering & ApplicationsMost current Web applications perform operations that are basically read-only (retrieval of data/documents), so conflicts between transactions do not arise. However as Web applications increasingly become more sophisticated, permitting both concurrent ...
Comments