Automatic Program Debugging for Intelligent Tutoring SystemsPitman, 1988 - 347 pages |
From inside the book
Try this search over all volumes: Pausanias
Results 1-1 of 0
Other editions - View all
Common terms and phrases
algorithm recognition analysis ATOM CAR TREE ATOM TREE binary tree bug correction bug detection bug edits Bug fix buggy algorithms CAR and CDR CAR TR CAR TREE code fragment computational semantics counterexample Data Set debugging DEFUN dialect E-frame edit inversion EQUAL CAR EQUAL L LIST EQUAL X CAR example FLAT CDR TREE FLATTEN formal variables function calls function definitions function mapping implementation IMPLIES induction intelligent tutoring systems ITEM CAR LESSP LISP LIST-LEFT LISTP TREE loop invariants match MCFLATTEN MEM X L MEMTREE-FLATTEN missing conditional tests NLISTP NLISTP L node paired partition predicate PROG PROGN program simplification program transformations program verification recursive calls recursive functions REF CDR ref-code reference code reference function replaced RPLACD s-expression SETQ SEXP side effects simplified SINGLETONS SMASH SO-FAR stored student code student function student programs student's solution SUB1 symbolic evaluation tail recursive Talus task representation termination verification conditions theorem prover updates well-founded relation ZEROP