A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
This paper treats Knuth and Szwarcfiter's topological sorting program, presented in their paper "A Structured Program to Generate All Topological Sorting Arrangements" (Knuth and Szwarcfiter 1974), as a case study for the analysis of a program by formal transformations. This algorithm was selected for the case study because it is a particularly challenging program for any reverse engineering method. Besides a complex control flow, the program uses arrays to represent various linked lists anddoi:10.1093/comjnl/39.7.598 fatcat:3ma4zd3znngyln4wlunrejb2ru