Publications:A Methodology for Generating Verified Combinatorial Circuits

Jump to: navigation, search

Do not edit this section

Keep all hand-made modifications below

Title A Methodology for Generating Verified Combinatorial Circuits
Author Oleg Kiselyov and Kedar N. Swadi and Walid Taha
Year 2004
PublicationType Conference Paper
Conference EMSOFT'04. International Conference on Embedded Software and Systems.
Diva url
Abstract High-level programming languages offer significant expressivitybut provide little or no guarantees about resource use. Resourcebounded languages — such as hardware-description languages —provide strong guarantees about the runtime behavior of computations but often lack mechanisms that allow programmers to writemore structured, modular, and reusable programs. To overcomethis basic tension in language design, recent work advocated the useof Resource-aware Programming (RAP) languages, which take intoaccount the natural distinction between the development platformand the deployment platform for resource-constrained software.This paper investigates the use of RAP languages for the generation of combinatorial circuits. The key challenge that we encounteris that the RAP approach does not safely admit a mechanism to express a posteriori (post-generation) optimizations. The paper proposes and studies the use of abstract interpretation to overcome thisproblem. The approach is illustrated using an in-depth analysis ofthe Fast Fourier Transform (FFT). The generated computations arecomparable to those generated by FFTW.