A case for compressing traces with BDDs

IEEE Computer Architecture Letters

Volumn 5, Issue 2, 2006, Pages

  Price, Graham D ^a   Vachharajani, Manish ^a  

^a University of Colorado   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY DECISION DIAGRAMS (BDD); DATA-DEPENDENCE GRAPHS; HARDWARE ANALYSIS; PROGRAM TRACES;

COMPUTATIONAL COMPLEXITY; COMPUTER HARDWARE; DECISION THEORY; GRAPH THEORY; INTERACTIVE COMPUTER SYSTEMS; SUPERVISORY AND EXECUTIVE PROGRAMS;

DATA COMPRESSION;

EID: 33846709121     PISSN: 15566056     EISSN: None     Source Type: Journal    
DOI: 10.1109/L-CA.2006.17     Document Type: Article

References (14)

1. R. K. Brayton, G. D. Hachtel, A. Sangiovanni-Vincentelli, F. Somenzi, A. Aziz, S.-T. Cheng, S. Edwards, S. Khatri, Y. Kukimoto, A. Pardo, S. Qadeer, R. K. Ranjan, S. Sarwary, T. R. Shiple, G. Swamy, and T. Villa. Vis: A system for verification and synthesis. In T. Henzinger and R. Alur, editors, Eigth Conference on Computer Aided Verification (CAV'96), pages 428-432. Springer-Verlag, Rutgers University, 1996. LNCS 1102.
2. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transaction on Computers, C-35(8):677-691, August 1986.
3. M. Burtscher and N. Sam. Automatic generation of high-performance trace compressors. In Proceedings of the 2005 International Conference on Code Generation and Optimization, pages 229-240, 2005.
4. J. H. III and F. Brglez. Design of experiments in bdd variable ordering:lessons learned. In Computer-Aided Design, 1998. ICCAD 98. Digest of Technical Papers. 1998 IEEE/ACM International Conference on, pages 646-652, 1998.
5. J. Jain, A. Narayan, C. Coelho, S. P. Khatri, A. L. Sangiovanni- Vincentelli, R. K. Brayton, and M. Fujita. Decomposition techniques for efficient robdd construction. In Lecture Notes In Computer Science; Vol. 1166; Proceedings of the First International Conference on Formal Methods in Computer-Aided Design, pages 419-434, 1996.
6. S.-W. Jeong, B. Plessier, G. Hachtel, and F. Somenzi. Variable ordering for binary decision diagrams. In Proceedings of the 3rd European Design Automation Conference, pages 447-451, 1992.
7. J. R. Larus. Whole program paths. In Proceedings of the SIGPLAN '99 Conference on Programming Languages Design and Implementation (PLDI99), pages 259-269, May 1999.
8. R. Rudell. Dynamic variable ordering for ordered binary decision diagrams. In ICCAD '93: Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design, pages 42-47, Los Alamitos, CA, USA, 1993. IEEE Computer Society Press.
9. F. Somenzi. CUDD: Colorado University Decision Diagram package, release 2.30, 1998.
10. F. Somenzi, K. Ravi, K. L. McMillan, and T. R. Shiple. Approximation and decomposition of binary decision diagrams. In Annual ACM IEEE Design Automation Conference Proceedings of the 35th annual conference on Design automation, pages 445-450, 1998.
11. J. Whaley and M. S. Lam. Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. In PLDI '04: Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation, pages 131-144, New York, NY, USA, 2004. ACM Press.
12. Y. Wu and J. R. Larus. Static branch prediction and program profile analysis. In Proceedings of the 27th Annual International Symposium on Microarchitecture, pages 1-11, December 1994.
13. X. Zhang and R. Gupta. Whole execution traces. In 37th International Symposium on Microarchitecture (MICRO-37), pages 105-116, 2004.
14. X. Zhang, R. Gupta, and Y. Zhang. Efficient forward computation of dynamic slices using reduced ordered binary decision diagrams. In 26th International conference on Software Engineering (ICSE-26), pages 502-511, 2004.