hh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A Methodology for Generating Verified Combinatorial Circuits
Fleet Numerical Meteorology and Oceanography Center, Monterey, USA.
Department of Computer Science, Rice University, Houston, TX, USA.
Department of Computer Science, Rice University, Houston, TX, USA.
2004 (English)In: EMSOFT '04: Proceedings of the 4th ACM international conference on Embedded software, New York, NY: ACM Press, 2004, p. 249-258Conference paper, Published paper (Refereed)
Abstract [en]

High-level programming languages offer significant expressivity but provide little or no guarantees about resource use. Resource-bounded 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.

Place, publisher, year, edition, pages
New York, NY: ACM Press, 2004. p. 249-258
Keyword [en]
Multi-stage programming, abstract interpretation
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:hh:diva-20975DOI: 10.1145/1017753.1017794Libris ID: 12438821ISBN: 1-58113-860-1 OAI: oai:DiVA.org:hh-20975DiVA, id: diva2:588274
Conference
EMSOFT'04 – International Conference on Embedded Software and Systems, Pisa, Italy, September 27-29, 2004
Available from: 2013-01-15 Created: 2013-01-14 Last updated: 2018-03-22Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Taha, Walid

Search in DiVA

By author/editor
Taha, Walid
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 114 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf