Titlebook: Reasoning About Program Transformations; Imperative Programmi Jean-Fran?ois Collard Book 2003 Springer Science+Business Media New York 2003

泥土謙卑

同音

Applications of Reaching Definition Analysis are. However, data flow and value flow are tightly related, and this relation is leveraged in this chapter. We first examine when values are provably equal, in Section 6.1. We then show that this piece of information can be useful to program verification (Section 6.3) or even to a second iteration of reaching definition analysis (Section 6.2).

虛構(gòu)的東西

Single-Assignment Forms of values implements the data-flow graph, but not in a clear fashion. One way to expose the data flow is to transform the data structures of the program so that memory locations are less often reused, or perhaps even used only once. This clearly implies that data structures contain more elements.

調(diào)味品

Conclusion: Toward Algorithm Recognitionboth the program and the target computer, then it could ideally translate the former into the best possible code for the latter, couldn’t it? So what is the best possible understanding of a program? Wouldn’t it be to extract the algorithm the programmer had in mind when he or she originally wrote his or her program?

Anticonvulsants

Describing Program ExecutionsSince this book deals with reasoning about program transformations, we intend to analyze and manipulate program texts to enhance certain properties of their execution: leaving more freedom to the computing devices in ordering the individual operations, reducing the number of auxiliary memory locations needed during execution, and so on.

Ccu106

孤僻

BLOT

不能根除

Parallel LanguagesAfter decades of parallel processing, few programming languages can claim to be used on a wide range of parallel machines. One of the reasons probably lies in the difficulty of efficiently compiling a general language on an ever-widening spectrum of architectures.

overreach

http://image.papertrans.cn/r/image/822468.jpg