Formalizing dijkstra

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1479, Issue , 1998, Pages 172-188

  Harrison, John ^a  

^a INTEL CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; SEMANTICS;

DIJKSTRA; FIRST ORDER; PROGRAMMING LANGUAGE SEMANTICS; TECHNICAL ERRORS; THEOREM PROVERS;

THEOREM PROVING;

EID: 84947777643     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055136     Document Type: Conference Paper

References (15)

1. R. Back. Correctness Preserving Program Transformations: Proof Theory and Applications, Volume 131 of Mathematical Centre Tracts. Mathematical Centre, Amsterdam, 1980.
2. R. DeMillo, R. Lipton, and A. Perlis. Social processes and proofs of theorems and programs. Communications of the ACM, 22, 271-280, 1979.
3. E. W. Dijkstra. Trip report visit ETH Zurich, EWD474, 3-4 February 1975. See [8], pp. 95-98.
4. E. E. Dijkstra. A Discipline of Programming. Prentice-Hall, 1976.
5. E. W. Dijkstra. Formal techniques and sizeable programs, EWD563. See [8], pp. 205-214, 1976.Paper prepared for Symposium on the Mathematical Foundations of Computing Science, Gdansk 1976.
6. E. W. Dijkstra. A somewhat open letter to EAA or: Why I proved the boundedness of the nondeterminacy in the way I did, EWD614, 1977. See [8], pp. 284-287.
7. E. W. Dijkstra. On a political pamphlet from the middle ages. AGM SIGSOFT, Software Engineering Notes, 3, 14, 1978.
8. E. W. Dijkstra (ed.). Selected Writings on Computing: A Personal Perspective. Springer-Verlag, 1982.
9. M. J. C. Gordon. Mechanizing programming logics in higher order logic. In G. Birtwistle and P. A. Subrahmanyam (eds.), Current Trends in Hardware Verification and Automated Theorem Proving, pp. 387-439. Springer-Verlag, 1989.
10. J. Grundy. Predicative programming - a survey. In D. Bj0rner, M. Broy, and I. V. Pottosin (eds.), Formal Methods in Programming and Their Applications: Proceedings of the International Conference, Volume 735 of Lecture Notes in Computer Science, Academgorodok, Novosibirsk, Russia, pp. 8-25. Springer-Verlag, 1993.
11. W. H. Hesselink. Programs, Recursion and Unbounded Choice, Volume 27 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1992.
12. J. J. Joyce and C. Seger (eds.). Proceedings of the 1993 International Workshop on the HOL theorem proving system and its applications, Volume 780 of Lecture Notes in Computer Science, UBC, Vancouver, Canada. Springer-Verlag, 1993.
13. D. Syme. Reasoning with the formal definition of Standard ML in HOL. See [12], pp. 43-60.
14. M. Vanlnwegen and E. Gunter. HOL-ML. See [12], pp. 61-74.
15. J. von Wright, J. Hekanaho, P. Luostarinen, and T. Langbacka. Mechanizing some advanced refinement concepts. Formal Methods in System Design, 3, 49-82, 1993.