Alexsa — Algorithm Explanation by Shape Analysis
Extensions to the TVLA System
Diploma thesis by Ronald Bieber
Subject provided by Prof. Dr. Reinhard Wilhelm
Algorithm explanation visualizes programs for teaching, debugging,optimization, and verification purposes. In this thesis we use shape analysis with 3-valued Kleene logic and the TVLA implementation of this analysis to analyze programs with respect to dynamic data structures. Our tool Alexsa features an easy to use interface for the visualization, with simultaneous code view and heap content representation. We implement an automatic pseudo code generation for improved readability, a well-defined algorithm for presenting the visual execution of programs in an interesting way, smooth transitions between the single states, and a number of additional tools for verification and debugging of the analyzed programs.
Access to my thesis
- The thesis in full text is available from SciDok, the Science Document Archiv of Universität des Saarlandesv. Available formats are Postscript and PDF. Thanks go to Christoph for creating the PDF file for me.
BibTeX Entry for this thesis.
- alexsa.tgz (621k)
The complete Alexsa-software, including source code, compiled class files and examples. Requires Java 2 and CPreProcessorstream from IBM Alphaworks. See alexsa/INSTALL for details.