BibTeX
@INCOLLECTION{
         Utke2005FBB,
       author = "Jean Utke",
       title = "Flattening Basic Blocks",
       editor = "H. M. B{\"u}cker and G. Corliss and P. Hovland and U. Naumann and B.
         Norris",
       booktitle = "Automatic Differentiation: {A}pplications, Theory, and Implementations",
       series = "Lecture Notes in Computational Science and Engineering",
       volume = "50",
       publisher = "Springer",
       year = "2005",
       abstract = "Preaccumulation of Jacobians of low-level code sections is beneficial in certain
         automatic differentiation application scenarios. Cross-country vertex, edge, or face elimination can
         produce highly efficient Jacobian preaccumulation code but requires the code section's
         computational graph to be known. Such graphs can easily be derived for straight-line codes with
         scalar variables. Practical codes in languages such as Fortran, C, and C++ with array indexing,
         pointers, and references introduce ambiguities. Constructing unambiguous computational graphs is
         necessary to realize the full potential of cross-country elimination. We give a practical solution
         and investigate theoretical options for graph construction.",
       crossref = "Bucker2005ADA",
       ad_tools = "OpenAD",
       ad_theotech = "Computational Graph",
       pages = "121--133",
       doi = "10.1007/3-540-28438-9_11"
}