Recovering memory access patterns of executable programs

W. Amme, P. Braun, E. Zehendner, F. Thomasset, Data dependence analysis of assembly code, in: Parallel Architectures and Compilation Techniques, 1998, Oct 1998, pp. 340–347. Appel, 2004 Balakrishnan, 2004, Analyzing memory accesses in x86 executables, 5 Bondhugula, 2008, A practical automatic polyhedral parallelizer and locality optimizer, SIGPLAN Notices, 43, 101, 10.1145/1379022.1375595 C. Cifuentes, A. Fraboulet, Intraprocedural static slicing of binary executables, in: IEEE International Conference on Software Maintenance, 1997, p. 188. Cytron, 1991, Efficiently computing static single assignment form and the control dependence graph, ACM TOPLAS, 13, 451, 10.1145/115372.115320 Feautrier, 1988, Parametric integer programming, RAIRO Recherche Opérationnelle, 22 Gerlek, 1995, Beyond induction variables: detecting and classifying sequences using a demand-driven ssa form, ACM TOPLAS, 17, 85, 10.1145/200994.201003 Havlak, 1997, Nesting of reducible and irreducible loops, ACM TOPLAS, 19, 557, 10.1145/262004.262005 Intel Corp. Intel 64 and IA-32 architectures software developer’s manual, 2009. http://www.intel.com. Janssen, 1997, Making graphs reducible with controlled node splitting, ACM TOPLAS, 19, 1031, 10.1145/267959.269971 Kennedy, 2002 Ketterlin, 2011, Efficient memory tracing by program skeletonization, 97 Larus, 1993, Efficient program tracing, Computer, 26, 52, 10.1109/2.211900 Lengauer, 1979, A fast algorithm for finding dominators in a flowgraph, ACM TOPLAS, 1, 121, 10.1145/357062.357071 Luk, 2005, Pin: building customized program analysis tools with dynamic instrumentation, 190 Moseley, 2007, Identifying potential parallelism via loop-centric profiling, 143 Moseley, 2007, Shadow profiling: hiding instrumentation costs with parallelism, 198 Muchnick, 1997 Pradelle, 2012, Polyhedral parallelization of binary code, ACM Transactions on Architecture and Code Optimization (TACO), 8, 39:1 Pugh, 1998, Constraint-based array dependence analysis, ACM TOPLAS, 20, 635, 10.1145/291889.291900 Ramalingam, 2000, On loops, dominators, and dominance frontier, 233 Ramalingam, 1999, Aggregate structure identification and its application to program analysis, 119 B. Scholz, C. Zhang, C. Cifuentes, User-input dependence analysis via graph reachability, in: SCAM’08, 2008, pp. 25–34. The Standard Performance Evaluation Corporation (SPEC). The spec OpenMP and SPEC CPU2006 benchmark suites, 2009. http://www.spec.org. Unger, 2002, Handling irreducible loops: optimized node splitting versus DJ-graphs, ACM TOPLAS, 24, 299, 10.1145/567097.567098 Wolfe, 1995