Proof producing synthesis of arithmetic and cryptographic hardware

Formal Aspects of Computing

Volumn 19, Issue 3, 2007, Pages 343-362

  Slind, Konrad ^a   Owens, Scott ^a   Iyoda, Juliano ^b   Gordon, Mike ^b  

^a Department of Electrical and Computer Engineering   (United States)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Compiling; Cryptography; Hardware synthesis; High assurance; Theorem proving

Indexed keywords

DIGITAL ARITHMETIC; PROGRAM COMPILERS; PUBLIC KEY CRYPTOGRAPHY; THEOREM PROVING;

HARDWARE SYNTHESIS; HIGH ASSURANCE;

COMPUTER HARDWARE;

EID: 34547544266     PISSN: 09345043     EISSN: 1433299X     Source Type: Journal    
DOI: 10.1007/s00165-007-0028-5     Document Type: Article

References (32)

1. Bjesse P, Claessen K, Sheeran M, Singh S (1999) Lava: Hardware design in Haskell. ACM SIGPLAN Notices 34(1):174-184
2. Blumenröhr C, Eisenbiegler D (1998) Performing high-level synthesis via program transformations within a theorem prover. In: Proceedings of the Digital System Design Workshop at the Euromicro 98 Conference, Västeras, Sweden, pp 34-37, Universität Karlsruhe, Institut für Rechnerentwurf und Felllertoleranz
3. Bowen JP, He J (2001) Au approach to the specification and verification of a hardware compilation scheme. J Supercomput 19(1):23-39
4. Brock B, Hunt Jr WA (1997) The DUAL-EVAL hardware description language and its use in the formal specification and verification of the fm9001 microprocessor. Formal Methods Syst Des 11(1):71-104
5. Blumenröhr C (1999) A formal approach to specify and synthesize at the system level. In: GI Workshop Modellierung und Verifikation von Systemen. Shaker-Verlag, Braunschweig, Germany, pp 11-20
6. Chin S-K (1992) Verified functions for generating signed-binary arithmetic hardware. IEEE Trans Comput-Aided Des Integ Circ Syst 11(12):1529-1558
7. Common criteria, for information security evaluation, 2004. Part 3: Security Assurance Requirements, http://niap.nist.gov/ cc-scheme/cc_docs/ cc_v22_part3.pdf.
8. Duan J, Hurd J, Li G, Owens S, Slind K, Zhang J (2005) Functional correctness proofs of encryption algorithms. In: Proceedings of 12th conference on logic for programming artificial intelligence and reasoning (LPAR 2005), number 3835 in LNAI, Springer, Heidelberg, pp 519-533
9. Finn S, Fourman MP, Francis M, Harris R (1989) Formal system design - interactive synthesis based on computer-assisted formal reasoning. In: Luc Claesen (ed) IMEC-IFIP international workshop on applied formal methods for correct VLSI Design, Vol 1, pp 97-110, Houthalen, Belgium, November 1989. Elsevier Science Publishers, B.V. North-Holland, Amsterdam
10. Fox A Verifying ARM6 multiplication, http://www.cl.cam.ac.uk/users/acjf3.
11. Hauck S (1995) Asynchronous design methodologies: an overview. Proc IEEE 83(1):69-93
12. Herbert JMJ (1988) Temporal abstraction of digital designs. In: George J. Milne (ed) The fusion of hardware design and verification: proceedings of the IFIP WG 10.2 Working conference on the fusion of hardware design and verification: Glasgow, Scotland, North-Holland, pp 4-6
13. Hanna FK, Longley M, Daeche N (1989) Formal synthesis of digital systems. In: Claesen L. (ed) Applied, formal methods for correct VLSI Design, North-Holland, pp 153-170
14. Hennessy JL, Patterson DA (1992) Computer architecture. A quantitative approach. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA
15. Johnson SD, Bose B (1990) DDD - A system for mechanized digital design derivation. Technical Report TR323, Indiana University, IU Computer Science Department
16. Jones G, Sheeran M (1990) Circuit design in Ruby. In: Staunstrup J. (ed) Formal methods for VLSI design. Elsevier Science Publications, North-Holland, pp 13-70
17. Jones G, Sheeran M (1990) Circuit design in Ruby. Lecture notes on Ruby from a summer school in Lyngby, Denmark., September
18. Jones G, Sheeran M (1991) Relations and refinement in circuit design. In: Morgan C. (ed) BCS FACS Workshop on Refinement. Springer, Heidelberg
19. Melham TF (1993) Higher order logic and hardware verification. Cambridge University Press, Cambridge, England, 1993. Cambridge Tracts in Theoretical Computer Science 31
20. Mycroft A, Sharp R (2001) Hardware synthesis using SAFL and application to processor design. In: Proceedings of the 11th advanced research working conference on correct hardware design and verification methods (CHARME'01), Livingston, Scotland, September 2001. Springer, Heidelberg. Invited Talk. LNCS Vol 2144
21. Norrish M, Slind K (project administrators). The HOL4 System. SourceForge website, http://hol.sourceforge.net/.
22. O'Donnell J (2002) Overview of Hydra: A concurrent language for synchronous digital circuit design. In: Proceedings of the 16th international parallel and distributed processing symposium. IEEE Computer Society Press
23. Page I (1996) Constructing hardware-software systems from a single description. J VLSI Signal Process 12(1):87-107 citeseer.ist.psu.edu/ page96constructing.html
24. Pnueli A, Siegel M, Singerman E (1998) Translation validation. In: Proceedings of TACAS'98, Vol 1384 of Lecture Notes in Computer Science, Springer, Heidelberg, pp 151-166
25. Kumar R, Blumenroehr C, Eisenbiegler D, Schmid D (1996) Formal synthesis in circuit design-A classification and survey. In: Srivas M., Camilleri A. (ed) First international conference on formal methods in computer-aided design, Vol 1166, Springer, Heidelberg, pp 294-299, Palo Alto, CA, USA
26. Rivest R, Robshae M, Sidney R, Yin YL(1998) The RC6 block cipher. Available at http://www.rsasecurity.com/r8alabs/rc6, August
27. Sheeran M (1984) μFP, A language for VLSI design. In: Proceedings of the ACM symposium on LISP and functional programming, ACM Press, Austin, Texas, pp 104-112
28. Sheeran M (1984) muFP, A language for VLSI design. In: Conference record, of the 1984 ACM symposium on lisp and functional programming, ACM, New York, pp 104-112
29. Slind K (1996) Function definition in higher order logic. In: Theorem proving in higher order logics, number 1125 in lecture notes in computer science, Springer, Heidelberg, pp 381-398, Turku, Finland
30. Slind K (2000) Wellfounded schematic definitions. In: David McAllester (ed) In: Proceedings of the seventeenth international conference on automated deduction CADE-17, Vol 1831 of Lecture Notes in Computer Science, Springer, Heidelberg, pp 45-63, Pittsburgh, Pennsylvania
31. van Berkel K(1993) Handshake circuits: an asynchronous architecture for VLSI programming. Cambridge University Press, New York, NY, USA
32. Wheeler D, Needham R (1999) TEA, a tiny encryption algorithm. In Fast Software Encryption: Second International Workshop, Vol 1008 of LNCS, Springer, Heidelberg, pp 363-366