Using run time traces in automated programming tutoring

ITiCSE'11 - Proceedings of the 16th Annual Conference on Innovation and Technology in Computer Science

Volumn , Issue , 2011, Pages 303-307

  Striewe, Michael ^a   Goedicke, Michael ^a  

^a UNIVERSITY OF DUISBURG ESSEN   (Germany)

Author keywords

automated tutoring; intelligent tutoring systems; trace analysis

Indexed keywords

AUTOMATED PROGRAMMING; AUTOMATED TUTORING; BLACK BOXES; COMPLETE SYSTEM; INTELLIGENT TUTORING SYSTEM; PROGRAMMING ASSIGNMENTS; RUNNING TESTS; RUNTIMES; TRACE GENERATION;

AUTOMATION; COMPUTER AIDED INSTRUCTION; ENGINEERING RESEARCH; INNOVATION; STUDENTS; TRACE ANALYSIS;

COMPUTER PROGRAMMING;

EID: 79960334970     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1999747.1999832     Document Type: Conference Paper

References (12)

1. A. v. D. Bas Cornelissen, Andy Zaidman. A controlled experiment for program comprehension through trace visualization. Technical Report TUD-SERG-2009-001, Delft University of Technology, 2009.
2. J. Burnim, N. Jalbert, C. Stergiou, and K. Sen. Looper: Lightweight detection of infinite loops at runtime. In Automated Software Engineering, 2009. ASE '09. 24th IEEE/ACM International Conference on, pages 161-169, 2009.
3. A. Gupta, T. A. Henzinger, R. Majumdar, A. Rybalchenko, and R.-G. Xu. Proving non-termination. In POPL '08: Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 147-158, New York, NY, USA, 2008. ACM.
4. D. Gusfield. Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge University Press, New York, NY, USA, 1997.
5. D. Jackson and M. Usher. Grading student programs using assyst. SIGCSE Bull., 29(1):335-339, 1997. (Pubitemid 127575467)
6. Java™Debug Interface API. http://java.sun.com/javase/6/docs/jdk/ api/jpda/jdi/index.html.
7. C. KÄollmann and M. Goedicke. A Specification Language for Static Analysis of Student Exercises. In Proceedings of the International Conference on Automated Software Engineering, 2008.
8. S. Maoz. Using model-based traces as runtime models. Computer, 42(10):28-36, 2009.
9. A. Pnueli. The temporal logic of programs. In Proceedings of the 18th Annual Symposium on Foundations of Computer Science, pages 46-57, Washington, DC, USA, 1977. IEEE Computer Society.
10. M. Striewe, M. Balz, and M. Goedicke. A flexible and modular software architecture for computer aided assessments and automated marking. In Proceedings of the First International Conference on Computer Supported Eductation (CSEDU), 23-26 March 2009, Lisboa, Portugal, volume 2, pages 54-61. INSTICC, 2009.
11. P. Ulam, A. Goel, and J. Jones. Re° ection in action: Model-based self-adaptation in game playing agents. In Challenges in Game Artificial Intelligence: Papers from the AAAI Workshop. AAAI Press, 2004.
12. W. Visser, K. Havelund, G. Brat, S. Park, and F. Lerda. Model Checking Programs. Automated Software Engineering Journal, 10(2), 2003.