Visualization of Procedural Abstraction

Authors:
Stefan Schaeckeler;Weijia Shang;Ruth Davis
Affiliations:
Department of Computer Engineering, Santa Clara University, Santa Clara, CA 95053, USA;Department of Computer Engineering, Santa Clara University, Santa Clara, CA 95053, USA;Department of Computer Engineering, Santa Clara University, Santa Clara, CA 95053, USA
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 8
Cited 0

MediaBench: a tool for evaluating and synthesizing multimedia and communicatons systems

MICRO 30 Proceedings of the 30th annual ACM/IEEE international symposium on Microarchitecture
A text-compression-based method for code size minimization in embedded systems

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Enhanced code compression for embedded RISC processors

Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
Compiler techniques for code compaction

ACM Transactions on Programming Languages and Systems (TOPLAS)
Analyzing and compressing assembly code

SIGPLAN '84 Proceedings of the 1984 SIGPLAN symposium on Compiler construction
3D representations for software visualization

Proceedings of the 2003 ACM symposium on Software visualization
Reducing code size with echo instructions

Proceedings of the 2003 international conference on Compilers, architecture and synthesis for embedded systems
Software Visualization: Visualizing the Structure, Behaviour, and Evolution of Software

Software Visualization: Visualizing the Structure, Behaviour, and Evolution of Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

Visualizing impacts of an optimization pass helps to reason about, and to gain insight into, the inner workings of the optimization pass. In this paper, we visualize the impacts of two procedural abstraction passes. For this, we modified two procedural abstraction post pass optimizers to visualize for each the difference in machine code before and after optimization by drawing abstracted fragments in the original program. We then explain how the generated visualizations aid in better understanding the optimization passes.