A theory of generalised substitutions

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

Volumn 2272, Issue , 2002, Pages 270-290

  Dunne, Steve ^a  

^a TEESSIDE UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

B METHOD; HEALTHINESS CONDITION; PROBLEMATIC ISSUES;

SEMANTICS;

EID: 84948176305     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45648-1_14     Document Type: Conference Paper

References (20)

1. J.-R. Abrial. The B-Book: Assigning Programs to Meanings. Cambridge University Press, 1996.
2. R.-J. Back. A calculus of refinements for program derivations. Acta Informatica, 25:593–624, 1988.
3. R.-J. Back and M.J. Butler. Fusion and simultaneous execution in the refinement calculus. Acta Informatica, 35(11):921–940, 1998.
4. R.-J. Back and J. von Wright. Refinement Calculus: A Systematic Introduction. Springer-Verlag New York, 1998.
5. D. Bert, M.-L. Potet, and Y. Rouzaud. A study on components and assembly primitives in B. In H. Habrias, editor, Proceedings of the First B Conference, pages 47–62. IRIN, Nantes, 1996.
6. J.C. Bicarregui and B. Ritchie. Invariants, frames and postconditions: a comparison of the VDM and B notations. In J. Woodcock and P.G. Larsen, editors, Proceedings of FME’93, number 670 in Lecture Notes in Computer Science. Springer-Verlag, 1993.
7. P Chartier. Formalisation of B in Isabelle/HOL. In D. Bert, editor, B’98: Recent Advances in the Development and Use of the B Method; Proceedings of the Second International B Conference, Montpellier, France, number 1393 in Lecture Notes in Computer Science, pages 66–82. Springer-Verlag, 1998.
8. E.W. Dijkstra. A Discipline of Programming. Prentice-Hall International, 1976.
9. S.E. Dunne. The Safe Machine: a new specification construct for B. In J.M. Wing, J. Woodcock, and J. Davies, editors, FM’99 - Formal Methods, number 1708 in Lecture Notes in Computer Science, pages 472–489. Springer-Verlag, 1999.
10. R.W. Floyd. Assigning meanings to programs. Proceedings of Symposia in Applied Mathematics, 19:19–32, 1967.
11. C.A.R. Hoare and He Jifeng. Unifying Theories of Programming. Prentice Hall, 1998.
12. C.B. Jones. Systematic Software Development Using VDM (2nd edn). Prentice- Hall, 1990.
13. C.C. Morgan. The specification statement. ACM Transactions on Programming Languages and Systems, 10(3), 1988.
14. C.C. Morgan. Programming from Specifications (2nd edn). Prentice Hall International, 1994.
15. J.M. Morris. A theoretical basis for stepwise refinement and the programming calculus. Science of Computer programming, 9:287–306, 1987.
16. G. Nelson. A generalisation of Dijkstra’s calculus. ACM Transactions on Programmg Languages and Systems, 11(4), 1989.
17. Y. Rouzaud. Interpreting the B-Method in the Refinement Calculus. In J.M. Wing, J. Woodcock, and J. Davies, editors, FM’99 - Formal Methods, number 1708 in Lecture Notes in Computer Science, pages 411–430. Springer-Verlag, 1999.
18. G. Smith. Recursive schema definitions in Object-Z. In J.P. Bowen, S.E. Dunne, A. Galloway, and S. King, editors, ZB2000: Formal Specification and Development in B and Z, number 1878 in Lecture Notes in Computer Science, pages 42–58. Springer-Verlag, 2000.
19. A. Tarski. A lattice theoretical fixed point theorem and its applications. Pacific Journal of Mathematics, 5:285–309, 1955.
20. J. Woodcock and J. Davies. Using Z: Specification, Refinement and Proof. Prentice Hall, 1996.