Certifying the Fast Fourier Transform with coq
In: TPHOLs 2001 : theorem proving in higher order logics (Edinburgh, 3-6 September 2001)Lecture notes in computer science :154-168
Konferenz
- print, 11 ref
Zugriff:
We program the Fast Fourier Transform in type theory, using the tool Coq. We prove its correctness and the correctness of the Inverse Fourier Transform. A type of trees representing vectors with interleaved elements is defined to facilitate the definition of the transform by structural recursion. We define several operations and proof tools for this data structure, leading to a simple proof of correctness of the algorithm. The inverse transform, on the other hand, is implemented on a different representation of the data, that makes reasoning about summations easier. The link between the two data types is given by an isomorphism. This work is an illustration of the two-level approach to proof development and of the principle of adapting the data representation to the specific algorithm under study. CtCoq, a graphical user interface of Coq, helped in the development. We discuss the characteristics and usefulness of this tool.
Titel: |
Certifying the Fast Fourier Transform with coq
|
---|---|
Autor/in / Beteiligte Person: | CAPRETTA, Venanzio |
Link: | |
Quelle: | TPHOLs 2001 : theorem proving in higher order logics (Edinburgh, 3-6 September 2001)Lecture notes in computer science :154-168 |
Veröffentlichung: | Berlin: Springer, 2001 |
Medientyp: | Konferenz |
Umfang: | print, 11 ref |
ISSN: | 0302-9743 (print) |
Schlagwort: |
|
Sonstiges: |
|