Design and implementation of the UW Illustrated compiler
PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
LLparse and LRparse: visual and interactive tools for parsing
SIGCSE '94 Proceedings of the twenty-fifth SIGCSE symposium on Computer science education
Parser visualizations for developing grammars with yacc
SIGCSE '95 Proceedings of the twenty-sixth SIGCSE technical symposium on Computer science education
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
SIGCSE '98 Proceedings of the twenty-ninth SIGCSE technical symposium on Computer science education
VCOCO: a visualisation tool for teaching compilers
ITiCSE '98 Proceedings of the 6th annual conference on the teaching of computing and the 3rd annual conference on Integrating technology into computer science education: Changing the delivery of computer science education
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
The unified software development process
The unified software development process
CUPV—a visualization tool for generated parsers
Proceedings of the thirty-first SIGCSE technical symposium on Computer science education
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
Proceedings of the 11th annual SIGCSE conference on Innovation and technology in computer science education
A tool for teaching LL and LR parsing algorithms
Proceedings of the 13th annual conference on Innovation and technology in computer science education
Procedural Abstraction with Reverse Prefix Trees
Proceedings of the 7th annual IEEE/ACM International Symposium on Code Generation and Optimization
Visualizing Program Analysis with the Soot-Eclipse Plugin
Electronic Notes in Theoretical Computer Science (ENTCS)
An educational tool for teaching compiler construction
IEEE Transactions on Education
| Hi-index | 0.00 |
There is an active research community concentrating on visualizations of algorithms taught in CS1 and CS2 courses. These visualizations can help students to create concrete visual images of the algorithms and their underlying concepts. Not only fundamental algorithms can be visualized, but also algorithms used in compilers. Visualizations that exist for use in compiler courses are mostly for the frontend, though. In this article we propose the use of visualizations for understanding optimization passes. Optimization passes are complex algorithms that operate on large amounts of code and it is not obvious when, where and how often each optimization is applied to the code. We show in this article how visualizations for a procedural abstraction optimization pass can capture the effect of all instances of this optimization over an entire program to make it easier for students to comprehend procedural abstraction.