ABSTRACT
This paper is devoted to the expression for a formal theory of communication networks in the ACL2 logic. More precisely, we have developed a generic model called GeNoC, in a general mathematical notation, with the use of quantification over variables as well as over functions. We present here its expression in the first order quantifier free logic of the ACL2 theorem prover. We describe our systematic approach to cast it into ACL2, especially how we use the encapsulation principle to obtain a systematic methodology to specify and validate on chip communications architectures. We summarize the different instances of GeNoC developed so far in ACL2, some come from industrial designs. We illustrate our approach on an XY routing algorithm.
- H. Amjad. Model Checking the AMBA Protocol in HOL. Technical report, University of Cambridge, Computer Laboratory, September 2004.Google Scholar
- W. Dally and B. Towles. Principles and Practices of Interconnection Networks. Morgan-Kaufmann Publisher, 2004. Google ScholarDigital Library
- B. Gebremichael, F. Vaandrager, M. Zhang, K. Goossens, E. Rijpkema, and A. Rădulescu. Deadlock Prevention in the Æthereal protocol. In D. Borrione and W. Paul, editors, Correct Hardware Design and Verification Methods (CHARME'05), volume 3725 of LNCS, pages 345--348, 2005. Google ScholarDigital Library
- K. Karim, A. Nguyen, and S. Dey. An Interconnect Architecture for Networking Systems On Chip. IEEE Micro, pages 36--45, September-October 2002. Google ScholarDigital Library
- J. S. Moore. A Formal Model of Asynchronous Communications and Its Use in Mechanically Verifying a Biphase Mark Protocol. Formal Aspects of Computing, 6(1):60--91, 1993.Google ScholarCross Ref
- J. Rowson and A. Sangiovanni-Vincentelli. Interface-Based Design. In 34th Design Automation Conference (DAC'96), pages 178--183, 1997. Google ScholarDigital Library
- A. Roychoudhury, T. Mitra, and S. Karri. Using Formal Techniques to Debug the AMBA System-on-Chip Bus Protocol. In Design Automation and Test Europe (DATE'03), pages 828--833, 2003. Google ScholarDigital Library
- J. Schmaltz. Une formalisation fonctionnelle des communications sur la puce. PhD thesis, Joseph Fourier University, Grenoble, France, January 2006. In French. A partial translation is available upon request to the first author.Google Scholar
- J. Schmaltz and D. Borrione. Verification of a Parameterized Bus Architecture Using ACL2. In Proceedings of the Fourth International Workshop on the ACL2 Theorem Prover and its Applications, April 2003.Google Scholar
- J. Schmaltz and D. Borrione. A Functional Approach to the Formal Specification of Networks on Chip. In A. Hu and A. Martin, editors, Formal Methods in Computer-Aided Design (FMCAD'04), volume 3312 of LNCS, pages 52--66, Austin, Tx, USA, November 2004. Springer-Verlag.Google Scholar
- J. Schmaltz and D. Borrione. A Generic Network on Chip Model. In T. Melham and J. Hurd, editors, Theorem Proving in Higher Order Logics (TPHOLs'05), volume 3603 of LNCS, pages 310--325, Oxford, UK, August 2005. Springer-Verlag. Google ScholarDigital Library
- G. Spirakis. Beyond Verification: Formal Methods in Design. In A. Hu and A. Martin, editors, Formal Methods in Computer-Aided Design (FMCAD'04), volume 3312 of LNCS, Austin, Texas, USA, November 2004. Springer-Verlag. Invited Speaker.Google Scholar
Index Terms
- Towards a formal theory of on chip communications in the ACL2 logic
Recommendations
Completeness and Cut-elimination in the Intuitionistic Theory of Types
In this paper we define a model theory and give a semantic proof of cut-elimination for ICTT, an intuitionistic formulation of Church's theory of types defined by Miller et al. and the basis for the λProlog programming language. Our approach, extending ...
Formal Proofs About Rewriting Using ACL2
We present an application of the ACL2 theorem prover to reason about rewrite systems theory. We describe the formalization and representation aspects of our work using the first-order, quantifier-free logic of ACL2 and we sketch some of the main points ...
Theory Extension in ACL2(r)
AbstractACL2(r) is a modified version of the theorem prover ACL2 that adds support for the irrational numbers using nonstandard analysis. It has been used to prove basic theorems of analysis, as well as the correctness of the implementation of ...
Comments