A Methodology for Generating Verified Combinatorial Circuits

@techreport{citeulike:2622858, abstract = {High-level programming languages offer significant expressivity but 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 write more structured, modular, and reusable programs. To overcome this basic tension in language design, recent work advocated the use of Resource-aware Programming (RAP) languages, which take into account the natural distinction between the development platform and 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 encounter is 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 this problem. The approach is illustrated using an in-depth analysis of the Fast Fourier Transform (FFT). The generated computations are comparable to those generated by FFTW.}, author = {Kiselyov, Oleg and Swadi, Kedar N. and Taha, Waild }, citeulike-article-id = {2622858}, keywords = {compiler, functional, numerical, optimization}, posted-at = {2008-04-02 11:06:28}, priority = {3}, title = {A Methodology for Generating Verified Combinatorial Circuits} }

TY - RPRT ID - citeulike:2622858 L3 - citeulike-article-id:2622858 TI - A Methodology for Generating Verified Combinatorial Circuits N2 - High-level programming languages offer significant expressivity but 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 write more structured, modular, and reusable programs. To overcome this basic tension in language design, recent work advocated the use of Resource-aware Programming (RAP) languages, which take into account the natural distinction between the development platform and 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 encounter is 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 this problem. The approach is illustrated using an in-depth analysis of the Fast Fourier Transform (FFT). The generated computations are comparable to those generated by FFTW. KW - compiler KW - functional KW - numerical KW - optimization AU - Kiselyov, Oleg AU - Swadi, Kedar AU - Taha, Waild ER -