Data refinement of mixed specifications: A generalization of UNITY

Acta Informatica

Volumn 35, Issue 2, 1998, Pages 91-129

  Sanders, Beverly A ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041179359     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002360050115     Document Type: Article

References (31)

1. R.J.R. Back: A calculus of refinements for program derivations. Acta Informatica, 25:593-624 (1988)
2. R.J.R. Back: Refinement calculus, part II: Parallel and reactive programs. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Lecture Notes in Computer Science Volume 430, pages 67-93. REX Workshop on Stepwise Refinement of Distributed Systems, 1989.
3. R.J.R. Back, J. von Wright: Refinement calculus, part I: Sequential nondeterministic programs. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Lecture Notes in Computer Science Volume 430, pages 42-66. REX Workshop on Stepwise Refinement of Distributed Systems, 1989.
4. R.J.R. Back, J. von Wright: Duality in specification languages: A lattice-theoretical approach. Acta Informatica, 27:583-625 (1990)
5. R.J.R. Back, J. von Wright: Combining angels, demons and miracles in program specifications. Theoretical Computer Science, 100(2):365-383 (1992)
6. K. Mani Chandy, Jayadev Misra: Parallel Program Design: A Foundation. Reading, MA: Addison-Wesley, 1988.
7. K. Mani Chandy, Beverly A. Sanders: Predicate transformers for reasoning about concurrent computation. Science of Computer Programming, 1995.
8. W. Chen, J.T. Udding: Towards a calculus of data refinement. In J.L. van de Schnepscheut, editor, Lecture Notes in Computer Science Volume 375, pages 197-218. International Conference on Mathematics of Program Construction, 1989.
9. P.H.B. Gardiner, Carroll Morgan: Data refinement of predicate transformers. Theoretical Computer Science, 87:143-162 (1991)
10. P.H.B. Gardiner, Carroll Morgan: A single complete rule for data refinement. Formal Aspects of Computing, 5:367-382 (1993)
11. Wim H. Hesselink: Programs, Recursion, and Unbounded Choice: Predicate Transformer Semantics and Transformation Rules. Cambridge Tracts in Theoretical Computer Science 27. Cambridge University Press, 1992.
12. C.A.R. Hoare: Proofs of correctness of data representations. Acta Informatica, 1(4):271-281 (1972)
13. Bengt Jonsson: Simulations between specifications of distributed systems. In J.C. Baeten and J.F. Groote, editors. Lecture Notes in Computer Science 527, pages 346-360. CONCUR '91: Proceedings of the 2nd International Conference on Concurrency Theory. Berlin Heidelberg New York: Springer 1991.
14. C.S. Jutla, E. Knapp, J.R. Rao: A predicate transformer approach to semantics of parallel programs. In Proceeding of the 8th ACM Symposium on Principles of Distributed Computing, 1989.
15. Edgar Knapp: A predicate transformer for progress. Information Processing Letters, 33 (1989/90)
16. Leslie Lamport: Time, clocks and ordering of events in distributed systems. Communications of the ACM, 21(7):558-565 (1978)
17. Leslie Lamport: A temporal logic of actions. ACM Transactions on Programming Languages and Systems, 16(3):872-923 (1994)
18. Nancy A. Lynch: Multivalued possibilities mappings. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Lecture Notes in Computer Science Volume 430, pages 519-544. REX Workshop on Stepwise Refinement of Distributed Systems, 1989.
19. M. Maekawa: A √N algorithm for mutual exclusion in decentralized systems. ACM Transactions on Computer Systems, 3(2):145-159 (1985)
20. J. Misra: A logic for concurrent programming: Progress. Journal of Computer and Software Engineering, 3(2):273-300 (1995)
21. J. Misra: A logic for concurrent programming: Safety. Journal of Computer and Software Engineering, 3(2):239-272 (1995)
22. Carroll Morgan, P.H.B. Gardiner: Data refinement by calculation. Acta Informatica, 27:481-503 (1990)
23. Carroll C. Morgan: Data refinement by miracles. Information Processing Letters, 26:243-246 (1988)
24. Susan Owicki, Leslie Lamport: Proving liveness properties of concurrent programs. ACM Transactions on Programming Language and Systems, 4(3):455-495 (1982)
25. Beverly Sanders: Eliminating the substitution axiom from UNITY logic. Formal Aspects of Computing, 3(2) (1991)
26. Beverly A. Sanders: The information structure of distributed mutual exclusion algorithms. ACM Transactions on Computer Systems, 5(3):284-299 (1987)
27. Beverly A. Sanders. Stepwise refinement of mixed specifications of concurrent programs. In M. Broy and C.B. Jones, editors, Proceedings of the IFIP Working Conference on Programming Concepts and Methods, pages 1-25. Amsterdam: Elsevier Science Publishers B.V. (North Holland), 1990.
28. Fred Schneider, Lenore Fix: Reasoning about programs by exploiting the environment. In Lecture Notes in Computer Science 820, pages 328-339. Proceedings 21st International Colloquium, ICALP'94. Berlin Heidelberg New York: Springer 1994.
29. Ambuj K. Singh: Program refinement in fair transition systems. Acta Informatica, 30(6):503-535 (1993)
30. R. T. Udink, J.N. Kok: On the relation between UNITY properties and sequences of states. In J. W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Lecture Notes in Computer Science Volume 666, pages 594-608. REX Workshop on Semantics: Foundations and Applications. Berlin Heidelberg New York; Springer 1993.
31. Rob T. Udink, Joost N. Kok: ImpUNITY: UNITY with procedures and local variables. In Proceedings of the International Conference on Mathematics of Program Construction, 1995. to appear.