The Least Conjunctive Refinement and Promotion in the Refinement Calculus-Reference-Cited by-同舟云学术

The Least Conjunctive Refinement and Promotion in the Refinement Calculus

Published:1999-09 Issue:1 Volume:11 Page:75-105
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

Mahony Brendan P.¹

Affiliation:

1. Defence Science and Technology Organisation, Department of Defence, Australia, AU

Abstract

Abstract. A syntactic calculation of Morgan's least conjunctive refinement operator for predicate transformers is developed. The operator is used to develop a general approach to lifting relational operators to predicate transformer operators. Predicate transformer versions of the relational conjunction and disjunction operators are considered in detail. The Z-based technique of program promotion is considered in a refinement calculus setting. A standard Z promotion example is recast in the refinement calculus.

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Link

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

Reference31 articles.

1. A logical view of composition;Abadi M.;Theoretical Computer Science,1993

2. A calculus of program derivations;Back R. J. R.;Acta Informatica,1988

3. LNCS;Back R. J. R.,1995

4. LNCS;Back R. J. R.,1990

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

1. Hoare-Style Reasoning from Multiple Contracts;Lecture Notes in Computer Science;2017

2. Promotion;Refinement in Z and Object-Z;2014

3. Operation Refinement and Monotonicity in the Schema Calculus;ZB 2003: Formal Specification and Development in Z and B;2003

4. Junctive Compositions of Specifications in Total and General Correctness;Electronic Notes in Theoretical Computer Science;2002-11

5. Refinement and the Z Schema Calculus;Electronic Notes in Theoretical Computer Science;2002-11