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
Generating Heap-bounded Programs in a Functional Setting
Rice University, Houston, TX, USA.
Rice University, Houston, TX, USA.
Boston University, Boston, MA, USA.
2003 (English)In: Embedded Software: Third International Conference, EMSOFT 2003, Philadelphia, PA, USA, October 13-15, 2003. Proceedings / [ed] Rajeev Alur & Insup Lee, Berlin: Springer Berlin/Heidelberg, 2003, 340-355 p.Conference paper, Published paper (Refereed)
Abstract [en]

High-level programming languages offer significant expressivity but provide little or no guarantees about resource utilization. Resource-bounded languages provide strong guarantees about the runtime behavior of programs but often lack mechanisms that allow programmers to write more structured, modular, and reusable programs. To overcome this basic tension in language design, this paper advocates taking into account the natural distinction between the development platform and the deployment platform for resource-sensitive software.

To illustrate this approach, we develop the meta-theory for GeHB, a two-level language in which first stage computations can involve arbitrary resource consumption, but the second stage can only involve functional programs that do not require new heap allocations. As an example of a such a second-stage language we use the recently proposed first-order functional language LFPL. LFPL can be compiled directly to malloc-free, imperative C code. We show that all generated programs in GeHB can be transformed into well-typed LFPL programs, thus ensuring that the results established for LFPL are directly applicable to GeHB. © Springer-Verlag Berlin Heidelberg 2003.

Place, publisher, year, edition, pages
Berlin: Springer Berlin/Heidelberg, 2003. 340-355 p.
Series
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743 ; 2855
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:hh:diva-20977DOI: 10.1007/978-3-540-45212-6_22ISI: 000187498400022Scopus ID: 2-s2.0-0142249983Libris ID: 9466788ISBN: 978-3-540-20223-3 ISBN: 978-3-540-45212-6 OAI: oai:DiVA.org:hh-20977DiVA: diva2:588276
Conference
EMSOFT'03 – International Conference on Embedded Software and Systems, Philadelphia, PA, USA, October 13-15, 2003
Note

Supported by NSF grants ITR-0113569, CCR-0224244 and CCR-0229480.

Available from: 2013-01-15 Created: 2013-01-14 Last updated: 2015-08-05Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Taha, Walid
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 75 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