The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (1981 vol.7)
pp: 23-31
E. Deak , Bell Laboratories
ABSTRACT
This paper presents a detailed algorithm derivation scenario, using correctness preserving source-to-source transfonnations. The algorithm derived is the Cocke-Younger nodal spans parsing algorithm. We describe a high-level SETL-like specification language, and give a partial correctness formalism and a set of transformation rules which enable the combination of algorithms whose partial correctness has already been established.
INDEX TERMS
verification, Algorithm specification, high-level language, partial correctness, source-to-source transformation
CITATION
E. Deak, "A Transformational Derivation of a Parsing Algorithm in a High-Level Language", IEEE Transactions on Software Engineering, vol.7, no. 1, pp. 23-31, January 1981, doi:10.1109/TSE.1981.230816
26 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool