Soundness of data refinement for a higher-order imperative language-Reference-Cited by-同舟云学术

Soundness of data refinement for a higher-order imperative language

Published:2002-05 Issue:1-2 Volume:278 Page:271-301
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Naumann David A.

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference32 articles.

1. K.R. Apt, G.D. Plotkin, Countable nondeterminism and random assignment, J. ACM 33 (1986) pp. 724–767.

2. Refinement Calculus: A Systematic Introduction, Graduate Texts in Computer Science;Back,1998

3. A.L.C. Cavalcanti, D.A. Naumann, in: A weakest precondition semantics for an object-oriented language of refinement, FM’99-Formal Methods, vol. II, Lecture Notes in Computer Science, vol. 1709, Springer, Berlin, 1999.

4. W. Chen, J.T. Udding, Towards a calculus of data refinement, Proceedings, Mathematics of Program Construction, Lecture Notes in Computer Science, vol. 375, Springer, Berlin, 1989, pp. 197–218.

5. E. Denney, A theory of program refinement, Dissertation, University of Edinburgh, 1998.

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

1. An observationally complete program logic for imperative higher-order functions;Theoretical Computer Science;2014-01

2. Lazy UTP;Unifying Theories of Programming;2010

3. Category Theoretic Models of Data Refinement;Electronic Notes in Theoretical Computer Science;2009-01

4. On assertion-based encapsulation for object invariants and simulations;Formal Aspects of Computing;2007-06

5. Towards imperative modules: Reasoning about invariants and sharing of mutable state;Theoretical Computer Science;2006-11