Reverse Engineering through Formal Transformation: Knuth's 'Polynomial Addition' Algorithm | Zendy

Martin Ward | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Reverse Engineering through Formal Transformation: Knuth's 'Polynomial Addition' Algorithm

Author(s) -

Martin Ward

Publication year - 1994

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/37.9.795

Subject(s) - transformation (genetics) , computer science , program transformation , algorithm , semantics (computer science) , programming language , biochemistry , chemistry , gene

In this paper we will take a detailed look at a larger example of program analysis by transformation. We willbe considering Algorithm 2.3.3.A from Knuth's "Fundamental Algorithms" Knuth (1968) (P.357) which is analgorithm for the addition of polynomials represented using four-directional links. Knuth (1974) describes thisas having "a complicated structure with excessively unrestrained goto statements" and goes on to say "I hopesomeday to see the algorithm cleaned up without loss of its...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research