LAURA, a system to debug student programs
Anne Adam,Jean-Pierre Laurent +1 more
Reads0
Chats0
TLDR
An effort to automate the debugging of real programs is presented and the main characteristics of LAURA are the representation of programs by graphs, which gets rid of many syntactical variations, the use of program transformations, realized on the graphs, and its heuristic strategy to identify step by step the elements of the graphs.About:Â
This article is published in Artificial Intelligence.The article was published on 1980-11-01 and is currently open access. It has received 116 citations till now. The article focuses on the topics: Algorithmic program debugging & Debugging.read more
Citations
More filters
Proceedings ArticleDOI
Automated feedback generation for introductory programming assignments
TL;DR: A simple language for describing error models in terms of correction rules is introduced, and a rule-directed translation strategy is formally defined that reduces the problem of finding minimal corrections in an incorrect program to the problems of synthesizing a correct program from a sketch.
ReportDOI
Automated program recognition by graph parsing
TL;DR: A graph parsing approach to automating program recognition in which programs are represented as attributed dataflow graphs and a library of cliches is encoded as an attributed graph grammar is developed and studied.
Journal ArticleDOI
A Systematic Literature Review of Automated Feedback Generation for Programming Exercises
TL;DR: It is found that feedback mostly focuses on identifying mistakes and less on fixing problems and taking a next step, and teachers cannot easily adapt tools to their own needs.
Journal ArticleDOI
Automated program recognition: a feasibility demonstration
TL;DR: A prototype recognition system which demonstrates the feasibility of automating program recognition, and is built on two previous advances: a graphical, programming-language-independent representation for programs, called the Plan Calculus, and an efficient graph parsing algorithm.
Journal ArticleDOI
Understanding and debugging novice programs
TL;DR: A system called PROUST is described which performs intention-based diagnosis of errors in novice PASCAL programs and achieves high performance in finding bugs in nontrivial student programs.
References
More filters
Journal ArticleDOI
A Transformation System for Developing Recursive Programs
Rod M. Burstall,John Darlington +1 more
TL;DR: A system of rules for transforming programs, with the programs in the form of recursion equations, are described, with an initially very simple, lucid, and hopefully correct program transformed into a more efficient one by altering the recursion structure.
Book
Structured Programming
TL;DR: The first monograph has suggested that in analysing a problem and groping towards a solution, a programmer should take advantage of abstract concepts such as sets, sequences, and mappings; and judiciously postpone decisions on representation until he is constructing the more detailed code of the program.
Journal ArticleDOI
Structured Programming with go to Statements
TL;DR: For serious students of structured programming, and also for language designers, Knuth's "Structured Programming with go to Statements" is probably the paper to read.
Book
Structured programming with go to statements
TL;DR: For instance, Knuth's "Structured Programming with Go-To Statements" as discussed by the authors is probably the most complete description of structured programming of all the selections in this book, and it can be used as a good starting point for a discussion of the role of gotos in structured programming.