论文信息 - Automation of Java Code Analysis for Programming Exercises

Automation of Java Code Analysis for Programming Exercises

In this paper we present a tool environment for semi-automatic verification of basic programming exercises. We describe how graph transformation can be used for analysis of code structures and present an example from a current course.

Michael Goedicke | Carsten Köllmann

[1] Christian M. Stracke,et al. Process-oriented Quality Management , 2006 .

[2] Hartmut Ehrig,et al. Handbook of graph grammars and computing by graph transformation: vol. 2: applications, languages, and tools , 1999 .

[3] Yann-Gaël Guéhéneuc,et al. Instantiating and detecting design patterns: putting bits and pieces together , 2001, Proceedings 16th Annual International Conference on Automated Software Engineering (ASE 2001).

[4] Dirk Janssens,et al. Extending Graph Rewriting for Refactoring , 2004, ICGT.

[5] Gabriele Taentzer. AGG: A Tool Environment for Algebraic Graph Transformation , 1999, AGTIVE.

[6] Paul Roe,et al. Static Analysis of Students' Java Programs , 2004, ACE.

[7] Reiko Heckel,et al. Algebraic Approaches to Graph Transformation - Part II: Single Pushout Approach and Comparison with Double Pushout Approach , 1997, Handbook of Graph Grammars.