Refinement concepts formalised in higher order logic-Reference-Cited by-同舟云学术

Refinement concepts formalised in higher order logic

Published:1990-03 Issue:1 Volume:2 Page:247-272
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

Back R. J. R.¹,von Wright J.²

Affiliation:

1. Department of Computer Science, Åbo Akademi University, Lemminkäisenkatu 14, SF-20520, Turku, Finland

2. Swedish School of Economics and Business Education, Biblioteksgatan 16, SF-65100 Vasa, Finland

Abstract

Abstract A theory of commands with weakest precondition semantics is formalised using the HOL proof assistant system. The concept of refinement between commands is formalised, a number of refinement rules are proved and it is shown how the formalisation can be used for proving refinements of actual program texts correct.

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Link

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

Reference23 articles.

1. Back R. J. R.: On the Correctness of Refinement in Program Development Ph.D. thesis Report A-1978-4 Department of Computer Science University of Helsinki 1978.

2. Back R. J. R.: Correctness Preserving Program Refinements: Proof Theory and Applications Vol. 131 of Mathematical Centre Tracts Mathematical Centre Amsterdam 1980.

3. A calculus of refinements for program derivations

4. Back R. J. R. and Sere K.: Stepwise Refinement of Action Systems. In: Mathematics of Program Construction Lecture Notes in Computer Science 375 Springer-Verlag 1989.

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

1. Unifying semantic foundations for automated verification tools in Isabelle/UTP;Science of Computer Programming;2020-10

2. Embedding the refinement calculus in Coq;Science of Computer Programming;2018-10

3. Ogre and Pythia: an invariance proof method for weak consistency models;ACM SIGPLAN Notices;2017-05-11

4. Ogre and Pythia: an invariance proof method for weak consistency models;Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages;2017-01

5. From Proposition to Program;Functional and Logic Programming;2016