How to write a healthiness condition

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

Volumn 1945 LNCS, Issue , 2000, Pages 299-317

  Chen, Yifeng ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

INVERSE PROBLEMS; SEMANTICS;

ALGEBRAIC LAWS; COMPLETENESS THEOREMS; GENERIC COMPOSITION; HEALTHINESS CONDITION; HIGHER-ORDER; SEMANTIC COMPOSITION; SEMANTIC THEORIES;

FORMAL METHODS;

EID: 84894588465     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-40911-4_18     Document Type: Conference Paper

References (22)

1. A. Abramsky, Semantics of interaction: An introduction to Game Semantics, Proc. of the 1996 CLiCS Summer Schooled. P. Dybjer and A. Pitts, 1-31, Cambridge Press, 1997.
2. B. Alpern and F. B. Schneider, Defining liveness, Information Processing Letters, 21: 181-185, 1985.
3. K. M. Chandy and J. Misra, Parallel Program Design: A Foundation, Addison- Wesley, 1988.
4. Y. Chen, Specification for reactive bulk-synchronous programming, Proc. 8th Euro- micro Workshop on Parallel and Distributed Processing: 190-196, IEEE computer society press, 2000.
5. Y. Chen, Formal Methods for Bulk-Synchronous Programming, DPhil. Thesis, Oxford University Computing Laboratory, to appear 2000.
6. Y. Chen, Parallel composition via medium, Constructive Methods for Parallel Programming, ed. S. Gorlatch and C. Lengauer, in book series Advances in Computation: Theory and Practice, Nova Science Books and Journals, to appear 2000.
7. E. W. Dijkstra, Guarded commands, non-determinacy and the formal derivation of programs, Communications of the ACM, 18: 453-457, 1975.
8. He Jifeng, K. Seidel and A. K. Mclver, Probabilistic models for the guarded command language. Science of Computer Programming 28:171-192, 1997.
9. E. C. R. Hehner, Predicative Programming I, II Communications of ACM, 27(6):593-593, 1984.
10. C. A. R. Hoare, Programs are predicates, ed. J. C. Shepherdson and C. A. R. Hoare, Mathematical Logic and Programming Languages, 141-155, Prentice Hall, 1985.
11. C. A. R. Hoare, Communicating Sequential Processes, Prentice Hall series in Computer Science, 1985.
12. C. A. R. Hoare and J. He, The weakest prespecification I, II. Fundamenta Infor- matica, 9: 51-84, 217-252, 1986.
13. C. A. R. Hoare et al. Laws of programming, Communications of the ACM, 30(8): 672-686, 1987.
14. C. A. R. Hoare and J. He, Unifying Theories of Programming, Prentice Hall series in Computer Science, 1998.
15. R. Milner, Communication and Concurrency, Prentice Hall series in Computer Science, 1989.
16. L. Lamport, A temporal logic of actions, ACM Transctions on Programming Languages and Systems, 16(3): 872-923, 1994.
17. L. Lai and J. W. Sanders, A weakest-environment calculus for communicating processes, Proc. 4th Nordic Transputer Conference: Parallel Programming and Applications, ed. P. Fritzon and L. Finrno, 381-395, IOS Press, Ohmsha, 1995.
18. D. S. Lecomber, Methods of BSP Programming, Oxford University Computing Laboratory DPhil. thesis, 1998.
19. R. D. Maddux, Fundamental study relation-algebraic semantics, Theoretical Computer Science, 160: 301-313, 1996.
20. J. L. Peterson, Petri Net Theory and Modeling of Systems, Prentice Hall series in Computer Science, 1981.
21. L. G. Valiant, A bridging model for parallel computation, Communications of the ACM, 33(8): 103-111, 1990.
22. J. Woodcock and J. Davis, Using Z : specification, refinement, and proof, Prentice Hall series in Computer Science, 1991.