Proof versus formalization-Reference-Cited by-同舟云学术

Proof versus formalization

Published:1994-03 Issue:1 Volume:34 Page:148-164
ISSN:0006-3835
Container-title:BIT
language:en
Short-container-title:BIT

Author:

Naur Peter

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01935023.pdf

Reference10 articles.

1. Aho, A. V. and Ullman, J. D.,The theory of parsing, translation, and compiling, vol. 1, Prentice-Hall, Englewood Cliffs, 1972.

2. Backus, J. W.,Can programming be liberated from the von Neumann style? A functional style and its algebra of programs, Comm. ACM 21 (8), Aug. 1978, 613–641.

3. Ehrig, H., et al.,Compatibility problems in the development of algebraic module specifications, Theor. Comput. Sci. 77, 1 & 2, 1990, 27–71.

4. Floyd, R. W.,Algorithm 97, Comm. ACM vol. 5 (6), 1962 June, p. 345.

5. Hoare, C. A. R.,Mathematics of programming, BYTE Magazine, 1986; also Timothy R. Colburn et al. (eds.),Program Verification, Kluwer, Netherlands, 1993, 135–154.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Abstract Interpretation of Graphs;Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems;2023

2. New Opportunities for Integrated Formal Methods;ACM Computing Surveys;2020-11-30

3. Computing versus human thinking;Communications of the ACM;2007-01

4. Connectivity, Transitivity and Chromaticity: The Pioneering Work of Bernard Roy in Graph Theory;Aiding Decisions with Multiple Criteria;2002

5. The Genesis of Quadratic Reciprocity;Springer Monographs in Mathematics;2000