Skip to main content

A Generic Network on Chip Model

  • Conference paper
Theorem Proving in Higher Order Logics (TPHOLs 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3603))

Included in the following conference series:

Abstract

We present a generic network on chip model (named GeNoC) intended to serve as a reference for the design and the validation of high level specifications of communication virtual modules. The definition of the model relies on three independent groups of constrained functions: routing and topology, scheduling, interfaces. The model identifies the sufficient constraints that these functions must satisfy in order to prove the correctness of GeNoC. Hence, one can concentrate his efforts on the design and the verification of one group. As long as the constraints are satisfied the overall system correctness is still valid. We show some concrete instances of GeNoC. One of them is a state-of-the-art network taken from industry.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aagaard, M.: A Hazards-Based Correctness Statement for Pipelined Circuits. In: Geist, D., Tronci, E. (eds.) CHARME 2003. LNCS, vol. 2860, pp. 66–80. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  2. Amjad, H.: Model Checking the AMBA Protocol in HOL. Technical Report, University of Cambridge, Computer Laboratory (September 2004)

    Google Scholar 

  3. Beyer, S., Jacobi, C., Kroening, D., Leinenbach, D., Paul, W.J.: Instantiating Uninterpreted Functional Units and Memory System: Functional Verification of the VAMP. In: Geist, D., Tronci, E. (eds.) CHARME 2003. LNCS, vol. 2860, pp. 51–65. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Bharadwaj, R., Felty, A., Stomp, F.: Formalizing Inductive Proofs of Network Algorithms. In: Kanchanasut, K., Levy, J.-J. (eds.) ACSC 1995. LNCS, vol. 1023. Springer, Heidelberg (1995)

    Google Scholar 

  5. Clarke, E.M., Grumberg, O., Jha, S.: Verifying Parameterized Networks. ACM Transactions on Programming Languages and Systems (TOPLAS) 19(5), 726–750 (1997)

    Article  Google Scholar 

  6. Clarke, E.M., Grumberg, O., Hiraishi, H., Jha, S., Long, D.E., McMillan, K.L.: Verification of the Futurebus+ Cache Coherence Protocol. In: Proc. of CHDL 1993, pp. 15–30 (1993)

    Google Scholar 

  7. Dally, W.J., Seitz, C.L.: Deadlock Free Message Routing in Multiprocessor Interconnection Networks. IEEE Transactions on Computers 36(5), 547–553 (1987)

    Article  MATH  Google Scholar 

  8. Fox, A.C.J.: Formal Specification and Verification of ARM6. In: Basin, D., Wolff, B. (eds.) TPHOLs 2003. LNCS, vol. 2758, pp. 25–40. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  9. Gordon, M.J.C., Melham, T.F. (eds.): Introduction to HOL: A Theorem-Proving Environment for Higher-Order Logic. Cambridge University Press, Cambridge (1993)

    MATH  Google Scholar 

  10. Havelung, K., Shankar, N.: Experiments in Theorem Proving and Model Checking for Protocol Verification. In: Gaudel, M.-C., Woodcock, J.C.P. (eds.) FME 1996. LNCS, vol. 1051. Springer, Heidelberg (1996)

    Google Scholar 

  11. Hunt Jr, W.A.: Microprocessors Design Verification. Journal of Automated Reasoning 5(4), 429–460 (1989)

    Article  Google Scholar 

  12. Jain, J., Mohanram, K., Moundanos, D., Wegener, I., Lu, Y.: Analysis of Composition Complexity and How to Obtain Smaller Canonical Graphs. In: Proceedings of IEEE-ACM Design Automaction Conference (DAC 2000), pp. 681–686 (2000)

    Google Scholar 

  13. Karim, F., Nguyen, A., Dey, S., Rao, R.: On-Chip Communication Architecture for OC-768 Network Processor. In: Design Automation Conference (2001)

    Google Scholar 

  14. Kaufmann, M., Manolios, P., Moore, J.S.: Computer-Aided Reasoning: An Approach. Kluwer Academic Publisher, Dordrecht (2000)

    Google Scholar 

  15. McMillan, K.L.: Symbolic Model Checking. Kluwer Academic Publishers, Dordrecht (1993)

    MATH  Google Scholar 

  16. Moore, J.S.: A Formal Model of Asynchronous Communication and Its Use in Mechanically Verifying a Biphase Mark Protocol. In: Formal Aspects of Computing (1993)

    Google Scholar 

  17. Owre, S., Rushby, J.B., Shankar, N.: PVS: A Prototype Verication System. In: Kapur, D. (ed.) CADE 1992. LNCS, vol. 607, pp. 748–752. Springer, Heidelberg (1992)

    Google Scholar 

  18. Pike, L., Maddalon, J., Milner, P., Geser, A.: Abstractions for Fault-Tolerant Distributed System Verification. In: Slind, K., Bunker, A., Gopalakrishnan, G.C. (eds.) TPHOLs 2004. LNCS, vol. 3223, pp. 257–270. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  19. Roesner, W.: What is Beyond the RTL Horizon for Microprocessor and System Design. In: Geist, D., Tronci, E. (eds.) CHARME 2003. LNCS, vol. 2860, pp. 1–1. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  20. Roychoudhury, A., Mitra, T., Karri, S.R.: Using Formal Techniques to Debug the AMBA System-on-Chip Bus Protocol. In: Design Automation and Test Europe (DATE 2003), pp. 828–833 (2003)

    Google Scholar 

  21. Rowson, J.A., Sangiovanni-Vincentelli, A.: Interface-Based Design. In: Design Automation Conference (1997)

    Google Scholar 

  22. Russinoff, D.: A Mechanically Checked Proof of IEEE Compliance of a Register Transfer Level Specification of the AMD-K7 Floating-Point Multiplication, Division and Square Root Instructions. London Mathematical Society Journal of Computation and Mathematics 1, 148–200 (1998)

    MATH  MathSciNet  Google Scholar 

  23. Sawada, J., Hunt Jr., W.A.: Processor Verification with Precise Exceptions and Speculative Execution. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, Springer, Heidelberg (1997)

    Google Scholar 

  24. Schmaltz, J., Borrione, D.: A Functional Approach to the Formal Specification of Networks on Chip. In: Hu, A.J., Martin, A.K. (eds.) FMCAD 2004. LNCS, vol. 3312, pp. 52–66. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  25. Spirakis, G.: Beyond Verification: Formal Methods in Design. Invited Speake. In: Hu, A.J., Martin, A.K. (eds.) FMCAD 2004. LNCS, vol. 3312. Springer, Heidelberg (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schmaltz, J., Borrione, D. (2005). A Generic Network on Chip Model. In: Hurd, J., Melham, T. (eds) Theorem Proving in Higher Order Logics. TPHOLs 2005. Lecture Notes in Computer Science, vol 3603. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11541868_20

Download citation

  • DOI: https://doi.org/10.1007/11541868_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28372-0

  • Online ISBN: 978-3-540-31820-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics