A lattice-theoretical basis for a specification language

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

Volumn 375 LNCS, Issue , 1989, Pages 139-156

  Back, R J R ^a   von Wright, J ^b  

^a ÅBO AKADEMI UNIVERSITY   (Finland)

^b HANKEN SCHOOL OF ECONOMICS   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

SPECIFICATIONS;

ANGELIC NONDETERMINISM; BASE LANGUAGE; DIJKSTRA; LATTICE-BASED; NON-DETERMINISM; PREDICATE TRANSFORMERS; PRIMITIVE OPERATIONS;

SPECIFICATION LANGUAGES;

EID: 0346376736     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-51305-1_8     Document Type: Conference Paper

References (22)

1. R.J.R. Back, On the correctness of refinement steps in program development (Ph.D. thesis), Report A-1978-4, Dept. of Computer Science, University of Helsinki, 1978.
2. R.J.R. Back, Correctness Preserving Program Refinements: Proof Theory and Applications, Mathematical Centre Tracts 131, Mathematical Centre, Amsterdam 1980.
3. R.J.R. Back, A Calculus of Refinements for Program Derivations, Acta Informatica, Vol. 25, No. 6, 593–624 (1988).
4. R.J.R. Back, Refining Atomicity in Parallel Algorithms, Reports on Computer Science and Mathematics 57, Åbo Akademi 1988, (to appear in Conference on Parallel Architectures and Languages Europe 1989).
5. R.J.R. Back, Changing Data Representation in the Refinement Calculus, Hawaii International Conference on System Sciences 1989 (also available as Data Refinement in the Refinement Calculus, Reports on Computer Science and Mathematics 68, Åbo Akademi 1988).
6. J. de Bakker, Mathematical Theory of Program Correctness, Prentice-Hall 1980.
7. G. Birkhoff, Lattice Theory, American Mathematical Society, Providence, RI, 1961.
8. E.W. Dijkstra, A Discipline of Programming, Prentice Hall 1976.
9. E.W. Dijkstra, A.J.M. van Gasteren, A Simple Fixpoint without the Restriction to Continuity, Acta Informatica Vol. 23, 1–7 (1986).
10. P. Gardiner, C. Morgan, Data Refinement of Predicate Transformers, Manuscript 1988.
11. G. Grätzer, General Lattice Theory, Birkhuser Verlag, Basel, 1978.
12. E. Hehner, do considered od: A Contribution to the Programming Calculus, Acta Informatica Vol. 11, 287–304 (1979).
13. E. Hehner, The Logic of Programming, Prentice-Hall 1984.
14. W.H. Hesselink, An algebraic calculus of commands, CS8808, Department of Mathematics and Computer Science, University of Groningen, 1988.
15. C.A.R. Hoare, I.J. Hayes, J. He, C.C. Morgan, A.W. Roscoe, J.W. Sanders, I.H. Sorensen, J.M. Spivey and A. Surfin, Laws of Programming, Communications of the ACM, Vol. 30, No. 8, 672–686 (August 1987).
16. C. Morgan, Data Refinement by Miracles, Information Processing Letters 26, 243–246 (January 1988).
17. C. Morgan, The Specification Statement, ACM TOPLAS, Vol. 10, No 3, 403–419 (1988).
18. C. Morgan, P. Gardiner, Data Refinement by Calculation, Manuscript 1988.
19. J. Morris, A Theoretical Basis for Stepwise Refinement and the Programming Calculus, Science of Programming, 9, 287–306 (1987).
20. G. Nelson, A Generalization of Dijkstra's Calculus, Tech. Rep 16, Digital Systems Research Center, Palo Alto, Calif., (April 1987).
21. D. Park, On the Semantics of Fair Parallelism, Lecture Notes in Computer Science 86, 504–526, Springer 1980.
22. A. Tarski, A Lattice Theoretical Fixed Point Theorem and its Applications, Pacific J. Math. 5, 285–309 (1955).