Preface / 1: |
Introduction / 2: |
Motivation / 2.1: |
Applications for Symbolic Analysis of Programs / 2.2: |
Contributions / 2.3: |
Symbolic Analysis Framework / 2.3.1: |
Symbolic Analysis for Parallelizing Compilers / 2.3.2: |
Organization / 2.4: |
Symbolic Analysis of Programs / 3: |
Initializations, Assignments, and Input/Output Operations / 3.1: |
Conditional Statements / 3.3: |
Loops and Recurrences / 3.4: |
Arrays / 3.5: |
Procedures / 3.6: |
Dynamic Data Structures / 3.7: |
Summary / 3.8: |
Generating Program Contexts / 4: |
Extended Control Flow Graph / 4.1: |
Algorithm / 4.3: |
Symbolic Analysis Algorithms and Transformations / 4.4: |
Preliminaries / 5.1: |
Symbolic Expression Evaluation / 5.3: |
Compute Lower and Upper Bounds of Symbolic Ex- pressions / 5.3.1: |
Rewrite ?-Expressions / 5.3.2: |
Rewrite Policies / 5.3.3: |
Simplify Expressions / 5.3.4: |
Determine Result / 5.3.5: |
Count Solutions to a System of Constraints / 5.4: |
Symbolic Sum Computation / 5.4.1: |
The Algorithm / 5.4.2: |
Algebraic Sum / 5.4.3: |
Miscellaneous / 5.4.4: |
Simplify Systems of Constraints / 5.5: |
Experiments / 5.6: |
Eliminate Redundant Constraints / 5.6.1: |
Counting Solutions to a System of Constraints / 5.6.2: |
Optimizing FTRVMT / 5.6.3: |
Programming DMMPs / 5.7: |
Data Dependence Analysis / 6.3: |
Vienna High Performance Compiler / 6.4: |
Implementation / 6.5: |
Symbolic Analysis to Optimize OLDA / 6.6: |
Symbolic Analysis to Optimize HNS / 6.7: |
Related Work / 6.8: |
Advanced Symbolic Analysis Algorithms / 7.1: |
Parallelizing Compilers / 7.2: |
Conclusion / 8: |
Appendix / 9: |
Control Flow Graphs / 9.1: |
Denotational Semantics / 9.2: |
Notation / 9.3: |
Denotational Semantic: Notation / 9.4: |
References |
Index |
Preface / 1: |
Introduction / 2: |
Motivation / 2.1: |
Applications for Symbolic Analysis of Programs / 2.2: |
Contributions / 2.3: |
Symbolic Analysis Framework / 2.3.1: |