About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 119. Chapters: Abstract interpretation, Compiler optimizations, Control-flow analysis, Data-flow analysis, Software metrics, Static program analysis, Control flow graph, Lazy evaluation, Code coverage, Partial evaluation, Constant folding, Galois connection, Dead code, Source lines of code, Java performance, Type system, Strength reduction, Frameworks supporting the polyhedral model, Loop unwinding, Cyclomatic complexity, Vectorization, Interprocedural optimization, GQM+Strategies, Software pipelining, Inline expansion, Inline caching, Loop optimization, Loop nest optimization, Definite assignment analysis, Coupling, Register allocation, Duplicate code, Aliasing, Bauhaus Project, Use-define chain, Linear Code Sequence and Jump, Return value optimization, Shape analysis, Termination analysis, Cohesion, Instruction scheduling, Program slicing, Dead code elimination, Automatic parallelization, Ohloh, Function point, Basic block, NDepend, Alias analysis, Polytope model, Live variable analysis, Peephole optimization, Dynamic program analysis, Weighted Micro Function Points, Unreachable code, Programming complexity, Copy elision, Object code optimizer, Software package metrics, Effect system, Dependence analysis, Scalable locality, MK II FPA, Strictness analysis, Symbolic execution, Escape analysis, Loop tiling, Partial redundancy elimination, Essential complexity, Induction variable, Instruction selection, Loop splitting, Bounds-checking elimination, Reaching definition, Loop interchange, Design predicates, Scalable parallelism, Common subexpression elimination, Cockburn Scale, Software Quality Model, Loop-invariant code motion, Pointer analysis, Global value numbering, Manifest expression, Rematerialization, Adaptive optimization, Cpuinfo falsification, Loop inversion, Sparse conditional constant propagation, Control flow analysis, ..
