Formal development of correct algorithms: An example based on earley's recogniser

Authors:
C B Jones
Affiliations:
Programming Technology Dept, Product Test Laboratories Ltd., IBM Laboratories Ltd., Hursley Park, WINCHESTER, Hants
Venue:
Proceedings of ACM conference on Proving assertions about programs
Year:
1972

Citing 1
Cited 12

An efficient context-free parsing algorithm

Communications of the ACM

Tentative steps toward a development method for interfering programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
An Improved Context-Free Recognizer

ACM Transactions on Programming Languages and Systems (TOPLAS)
Syntax-directed least-errors analysis for context-free languages: a practical approach

Communications of the ACM
Scientific Decisions which Characterize VDM

FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
On line context free language recognition in less than cubic time(Extended Abstract)

STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
The current state of proving programs correct

ACM '72 Proceedings of the ACM annual conference - Volume 1
A view of program verification

Proceedings of the international conference on Reliable software
The Early Search for Tractable Ways of Reasoning about Programs

IEEE Annals of the History of Computing
A summary of progress toward proving program correctness

AFIPS '72 (Fall, part I) Proceedings of the December 5-7, 1972, fall joint computer conference, part I
Reasoning About Partial Functions in the Formal Development of Programs

Electronic Notes in Theoretical Computer Science (ENTCS)
Self-Aware software – will it become a reality?

Self-star Properties in Complex Information Systems
A semantic analysis of logics that cope with partial terms

ABZ'12 Proceedings of the Third international conference on Abstract State Machines, Alloy, B, VDM, and Z

Quantified Score

Hi-index	0.02

Visualization

Abstract

This paper contains the formal development of a correct algorithm from an implicit definition of the task to be performed. Each step of the development can be accompanied by a proof of its correctness. As well as ensuring the correctness of the final program, the structured development gives considerable insight into the algorithm and possible alternatives. The example used is a simplified form of the recognition algorithm due to Earley.