Difference between revisions of "Publications:A Methodology for Generating Verified Combinatorial Circuits"

Latest revision as of 04:44, 26 June 2014

Title	A Methodology for Generating Veriﬁed Combinatorial Circuits
Author	Oleg Kiselyov and Kedar N. Swadi and Walid Taha
Year	2004
PublicationType	Conference Paper
Journal
HostPublication
DOI
Conference	EMSOFT'04. International Conference on Embedded Software and Systems.
Diva url	http://hh.diva-portal.org/smash/record.jsf?searchId=1&pid=diva2:588274
Abstract	High-level programming languages offer signiﬁcant 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.