Using run time traces in automated programming tutoring

Authors:
Michael Striewe;Michael Goedicke
Affiliations:
University of Duisburg-Essen, Essen, Germany;University of Duisburg-Essen, Essen, Germany
Venue:
Proceedings of the 16th annual joint conference on Innovation and technology in computer science education
Year:
2011

Citing 8
Cited 1

Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Grading student programs using ASSYST

SIGCSE '97 Proceedings of the twenty-eighth SIGCSE technical symposium on Computer science education
Model Checking Programs

Automated Software Engineering
Proving non-termination

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The temporal logic of programs

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Using Model-Based Traces as Runtime Models

Computer
A Specification Language for Static Analysis of Student Exercises

ASE '08 Proceedings of the 2008 23rd IEEE/ACM International Conference on Automated Software Engineering
Looper: Lightweight Detection of Infinite Loops at Runtime

ASE '09 Proceedings of the 2009 IEEE/ACM International Conference on Automated Software Engineering

Adaptively identifying non-terminating code when testing student programs

Proceedings of the 45th ACM technical symposium on Computer science education

Quantified Score

Hi-index	0.00

Visualization

Abstract

Running test cases against a student's solution of a programming assignment is one of the easiest ways to generate feedback. If black-box tests are used, students may have difficulties to retrace the complete system behaviour and to find erroneous programming statements. This paper discusses the use of automated trace generation for assisting students in this task. Both manual and automated trace interpretation is discussed and evaluated by examples.