Abstract
Automatic Differentiation (AD) is a program transformation that yields derivatives. Building efficient derivative programs requires complex and specific static analysis algorithms to reduce run time and memory usage. Focusing on the reverse mode of AD, which computes adjoint programs, we specify jointly the central static analyses that are required to generate an efficient adjoint code. We use a set-based formalization from classical data-flow analysis to specify Adjoint Liveness, Adjoint Write, and To Be Recorded analyses, and their mutual influences, taking into account the specific structure of adjoint programs. We give illustrations on examples taken from real numerical programs, that we differentiate with our AD tool tapenade, which implements these analyses.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2006 Springer
About this paper
Cite this paper
HascoĆ«et, L., Araya-Polo, M. (2006). The Adjoint Data-Flow Analyses: Formalization, Properties, and Applications. In: BĆ¼cker, M., Corliss, G., Naumann, U., Hovland, P., Norris, B. (eds) Automatic Differentiation: Applications, Theory, and Implementations. Lecture Notes in Computational Science and Engineering, vol 50. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-28438-9_12
Download citation
DOI: https://doi.org/10.1007/3-540-28438-9_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28403-1
Online ISBN: 978-3-540-28438-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)