Jump to content

Algorithmic program debugging

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 109.64.70.244 (talk) at 07:07, 13 February 2014. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Algorithmic debugging is a debugging technique that has been extended to practically all programming paradigms. Roughly speaking, the technique constructs an internal representation of all (sub)computations performed during the execution of a buggy program; and then, it asks the programmer about the correctness of such computations. [1]

References

  1. ^ Silva, Josep. "A survey on algorithmic debugging strategies." Advances in Engineering Software 42.11 (2011): 976-991.