Show simple item record

dc.contributor.authorNaumann, Uwe
dc.contributor.authorRiehme, Jan
dc.contributor.editorGanzha, M.
dc.date.accessioned2014-12-01T14:44:33Z
dc.date.available2014-12-01T14:44:33Z
dc.date.issued2007
dc.identifier.citationNaumann , U & Riehme , J 2007 , An L-Attributed Grammar for Adjoint Code . in M Ganzha (ed.) , Procs of IMCSIT'07 . PTI , pp. 1133-1146 . < http://www.stce.rwth-aachen.de/twiki/pub/Projects/CompFinance/WebHome/L-Adjoints.pdf >
dc.identifier.urihttp://hdl.handle.net/2299/14845
dc.description.abstractGradients of high-dimensional functions can be computed efficiently and with machine accuracy by so-called adjoint codes. We present an L-attributed grammar for the single-pass generation of intraprocedural adjoint code for a simple imperative language (a subset of C). Our ideas can easily be applied to any programming language that is suitable for syntax-directed translation.Moreover the conceptual insights are useful in the context of multi-pass generation of adjoint code. Our focus is on correctness. The necessary domain-specific code optimizations are beyond the scope of this paper. We give references to corresponding work in this areaen
dc.language.isoeng
dc.publisherPTI
dc.relation.ispartofProcs of IMCSIT'07
dc.titleAn L-Attributed Grammar for Adjoint Codeen
dc.contributor.institutionSchool of Computer Science
dc.identifier.urlhttp://www.stce.rwth-aachen.de/twiki/pub/Projects/CompFinance/WebHome/L-Adjoints.pdf
rioxxterms.typeOther
herts.preservation.rarelyaccessedtrue


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record