| 書目名稱 | Reasoning About Program Transformations | | 副標(biāo)題 | Imperative Programmi | | 編輯 | Jean-Fran?ois Collard | | 視頻video | http://file.papertrans.cn/823/822468/822468.mp4 | | 圖書封面 |  | | 描述 | Overview The motivation of this text lies in what we believe is the inadequacy of current frameworks to reason about the ?ow of data in imperative programs. This inadequacy clearly shows up when dealing with the individual side effects of loop iterations. - deed, we face a paradoxical situation where, on the one hand, a typical program spends most of its execution time iterating or recursing on a few lines of codes, and, on the other hand, current optimization frameworks are clumsy when trying to capture the effects of each incarnation of these few lines—frameworks we inherited from designs made decades ago. The reasons are manyfold, but one of them stands out: The same concepts have been used, on the one hand, to represent and manipulate programs internally in compilers and, on the other hand, to allow us humans to reason about optimizations. Unfortunately, these two uses have different aims and constraints. An example of such a situation is given by control-?ow graphs of basic blocks, which have been - tremely useful in practice as an internal representation of programs, but which are not always adequate or convenient to formally think about programs and specify their transformat | | 出版日期 | Book 2003 | | 關(guān)鍵詞 | algorithm; algorithms; compiler; design; language; optimization; programming; software; software engineering | | 版次 | 1 | | doi | https://doi.org/10.1007/b97654 | | isbn_softcover | 978-1-4419-2981-5 | | isbn_ebook | 978-0-387-22461-9 | | copyright | Springer Science+Business Media New York 2003 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2026-1-23 03:25
發(fā)表于 2025-3-21 19:03:10
