https://wiki.hh.se/ceres/index.php?action=history&feed=atom&title=Publications%3AA_Methodology_for_Generating_Verified_Combinatorial_CircuitsPublications:A Methodology for Generating Verified Combinatorial Circuits - Revision history2026-05-22T12:53:02ZRevision history for this page on the wikiMediaWiki 1.22.6https://wiki.hh.se/ceres/index.php?title=Publications:A_Methodology_for_Generating_Verified_Combinatorial_Circuits&diff=4274&oldid=prevSlawek: Created page with "<div style='display: none'> == Do not edit this section == </div> {{PublicationSetupTemplate|Author=Oleg Kiselyov, Kedar N. Swadi, Walid Taha |PID=588274 |Name=Kiselyov, Oleg ..."2014-06-26T03:44:55Z<p>Created page with "<div style='display: none'> == Do not edit this section == </div> {{PublicationSetupTemplate|Author=Oleg Kiselyov, Kedar N. Swadi, Walid Taha |PID=588274 |Name=Kiselyov, Oleg ..."</p>
<p><b>New page</b></p><div><div style='display: none'><br />
== Do not edit this section ==<br />
</div><br />
{{PublicationSetupTemplate|Author=Oleg Kiselyov, Kedar N. Swadi, Walid Taha<br />
|PID=588274<br />
|Name=Kiselyov, Oleg (Fleet Numerical Meteorology and Oceanography Center, Monterey, CA 93943);Swadi, Kedar N. (Department of Computer Science Rice University);Taha, Walid [waltah] (Department of Computer Science Rice University)<br />
|Title=A Methodology for Generating Verified Combinatorial Circuits<br />
|PublicationType=Conference Paper<br />
|ContentType=Refereegranskat<br />
|Language=eng<br />
|Journal=<br />
|JournalISSN=<br />
|Status=<br />
|Volume=<br />
|Issue=<br />
|HostPublication=<br />
|Conference=EMSOFT'04. International Conference on Embedded Software and Systems.<br />
|StartPage=<br />
|EndPage=<br />
|Year=2004<br />
|Edition=<br />
|Pages=<br />
|City=<br />
|Publisher=<br />
|Series=<br />
|SeriesISSN=<br />
|ISBN=<br />
|Urls=<br />
|ISRN=<br />
|DOI=<br />
|ISI=<br />
|PMID=<br />
|ScopusId=<br />
|NBN=urn:nbn:se:hh:diva-20975<br />
|LocalId=<br />
|ArchiveNumber=<br />
|Keywords=Multi-stage programming;abstract interpretation<br />
|Categories=Datorsystem (20206)<br />
|ResearchSubjects=<br />
|Projects=<br />
|Notes=<br />
|Abstract=<p>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.</p><br />
|Opponents=<br />
|Supervisors=<br />
|Examiners=<br />
|Patent=<br />
|ThesisLevel=<br />
|Credits=<br />
|Programme=<br />
|Subject=<br />
|Uppsok=<br />
|DefencePlace=<br />
|DefenceLanguage=<br />
|DefenceDate=<br />
|CreatedDate=2013-01-14<br />
|PublicationDate=2013-01-15<br />
|LastUpdated=2014-01-24<br />
|diva=http://hh.diva-portal.org/smash/record.jsf?searchId=1&pid=diva2:588274}}<br />
<div style='display: none'><br />
<br />
== Keep all hand-made modifications below ==<br />
</div>{{PublicationDisplayTemplate}}</div>Slawek