Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 687152, 8 pages
http://dx.doi.org/10.1155/2015/687152
Research Article

The Formalization of Discrete Fourier Transform in HOL

1Beijing Key Laboratory of Electronic System Reliability Technology, Capital Normal University, Beijing 100048, China
2College of Information Science and Technology, Beijing University of Chemical Technology, Beijing 100029, China

Received 6 March 2015; Revised 7 June 2015; Accepted 25 June 2015

Academic Editor: Jean-François Monin

Copyright © 2015 Zhiping Shi et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. S. W. Smith, Digital Signal Processing: A Practical Guide for Engineers and Scientists, Newnes, 2002.
  2. E. O. Brigham, The Fast Fourier Transform and Its Applications, Prentice Hall, Englewood Cliffs, NJ, USA, 1988.
  3. A. Adams, M. Dunstan, H. Gottliebsen, T. Kelsey, U. Martin, and S. Owre, “Computer algebra meets automated theorem proving: integrating maple and PVS,” in Theorem Proving in Higher Order Logics, R. J. Boulton and P. B. Jackson, Eds., vol. 2152 of Lecture Notes in Computer Science, pp. 27–42, Springer, Berlin, Germany, 2001. View at Publisher · View at Google Scholar
  4. K. Homann and J. Calmet, “Combining theorem proving and symbolic mathematical computing,” in Integrating Symbolic Mathematical Computation and Artificial Intelligence: Second International Conference, AISMC-2 Cambridge, United Kingdom, August 3-5, 1994 Selected Papers, J. Calmet and J. A. Campbell, Eds., vol. 958 of Lecture Notes in Computer Science, pp. 18–29, Springer, Berlin, Germany, 1995. View at Publisher · View at Google Scholar
  5. M. J. C. Gordon, “Mechanizing programming logics in higher-order logic,” in Current Trends in Hardware Verification and Automated Theorem Proving, pp. 387–439, Springer, 1989. View at Google Scholar
  6. L. Liu, O. Hasan, and S. Tahar, “Formal reasoning about finite-state discrete-time Markov chains in HOL,” Journal of Computer Science and Technology, vol. 28, no. 2, pp. 217–231, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. P. Bjesse, “Automatic verification of combinational and pipelined FFT circuits,” in Computer Aided Verification, vol. 1633 of Lecture Notes in Computer Science, pp. 380–393, Springer, Berlin, Germany, 1999. View at Publisher · View at Google Scholar
  8. V. Capretta, “Certifying the fast fourier transform with Coq,” in Theorem Proving in Higher Order Logics, vol. 2152 of Lecture Notes in Computer Science, pp. 154–168, Springer, 2001. View at Publisher · View at Google Scholar · View at MathSciNet
  9. R. A. Gamboa, “The Correctness of the Fast Fourier Transform: A Structural Proof in ACL2,” Formal Methods in System Design, Special Issue on UNITY, 2002.
  10. B. Akbarpour and S. Tahar, “A methodology for the formal verification of FFT algorithms in HOL,” in Proceedings of the 5th International Conference on Formal Methods in Computer-Aided Design (FMCAD '04), pp. 37–51, Austin, Tex, USA, November 2004.
  11. J. Harrison, “Constructing the real numbers in HOL,” Formal Methods in System Design, vol. 5, no. 1-2, pp. 35–59, 1994. View at Publisher · View at Google Scholar
  12. Z. Shi, L. Li, Y. Guan, X. Song, M. Wu, and J. Zhang, “Formalization of the complex number theory in HOL4,” Applied Mathematics & Information Sciences, vol. 7, no. 1, pp. 279–286, 2013. View at Publisher · View at Google Scholar
  13. Z. Shi, Y. Zhang, Z. Liu et al., “Formalization of matrix theory in HOL4,” Advances in Mechanical Engineering, vol. 6, Article ID 195276, 16 pages, 2014. View at Publisher · View at Google Scholar
  14. Z. Shi, Z. Liu, Y. Guan, S. Ye, J. Zhang, and H. Wei, “Formalization of function matrix theory in HOL,” Journal of Applied Mathematics, vol. 2014, Article ID 201214, 10 pages, 2014. View at Publisher · View at Google Scholar