Applying a generalization of a theorem of Mills to generalized looping structures

Proceedings - Science and Engineering for Software Development: A Recognition of Harlan D. Mills' Legacy, SESD 1999 - Co-Located With ICSE 1999

Volumn , Issue , 1999, Pages 31-39

  Tchier, Fairouz ^a   Desharnais, Jules ^b  

^a KING SAUD UNIVERSITY   (Saudi Arabia)

^b UNIVERSITÉ LAVAL   (Canada)

Author keywords

demonic semantics; generalized looping structures; Mills' theorem; relational abstraction; verification rule; while loops

Indexed keywords

SEMANTICS;

MILLS' THEOREM; NONDETERMINISTIC PROGRAMS; RELATION ALGEBRAS; RELATIONAL ABSTRACTION; WHILE LOOPS;

SOFTWARE DESIGN;

EID: 84974712754     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SESD.1999.781109     Document Type: Conference Paper

References (23)

1. E. Anson. A generalized iterative construct and its semantics. ACM Trans. on Programming Languages and Systems, 9(4):567-581, October 1987.
2. C. Aarts, R. Backhouse, P. Hoogendijk, E. Voermans and J. van der Woude. A relational theory of datatypes. Department of Computing Science, Eindhoven University of Technology, 1992. Available on Internet at http://www.win.tue.nl/win/cs/wp/papers.
3. R. C. Backhouse and J. van der Woude, Demonic operators and monotype factors, Mathematical Structures in Computer Science, May 1992. Also: Eindhoven University of Technology, Department of Computing Science, Computing Science Note No. 92/11.
4. Henk Doornbos, Roland Backhouse, Jaap van der Woude, A calculational approach to mathematical induction, Theoret. Comput. Sci., 179(1-2):103-135, 1997.
5. R. Berghammer and G. Schmidt, Relational speci cations, in: C. Rauszer (ed.), Algebraic Logic, Banach Center Publications, 28, 1993, Polish Academy of Sciences.
6. R. Berghammer and H. Zierer, Relational algebraic semantics of deterministic and non-deterministic programs, Theoret. Comput. Sci., 43:123-147, 1986.
7. N. Boudriga, F. Elloumi, and A. Mili, On the lattice of speci cations: Applications to a speci cation methodology, Formal Aspects of Computing, 4:544-571, 1992.
8. C. Brink, W. Kahl, and G. Schmidt, editors. Relational Methods in Computer Science. Springer-Verlag, 1997.
9. L.H. Chin and A. Tarski, Distributive and modular laws in the arithmetic of relation algebras, University of California Publications, 1:341-384, 1951.
10. B. A. Davey and H. A. Priestley, Introduction to Lattices and Order, Cambridge Mathematical Textbooks, Cambridge University Press, Cambridge, 1990.
11. J. Desharnais, N. Belkhiter, S. B. M. Sghaier, F. Tchier, A. Jaoua, A. Mili and N. Zaguia. Embedding a demonic semilattice in a relation algebra. Theoret. Comput. Sci., 149(2):333-360, 1995.
12. E. W. Dijkstra. A Discipline of Programming. Prentice-Hall, Englewood Cli®s, N.J., 1976.
13. D. Gries and F. B. Schneider. A Logical Approach to Discrete Math. Springer-Verlag, New York, 1993.
14. A. Mili, J. Desharnais and F. Mili, Relational heuristics for the design of deterministic programs, Acta Informatica, 24(3):239-276, 1987.
15. H. D. Mills. The new math of computer programming. Commun. ACM 18, 1, January 1975, 43-48.
16. H. D. Mills, V. R. Basili, J. D. Gannon and R. G. Hamlet. Principles of Computer Programming. A Mathematical Approach. Allyn and Bacon, Inc., 1987.
17. D. L. Parnas. A generalized control structure and its formal de nition. Communications of the ACM, 26(8):572-581, August 1983.
18. G. Schmidt. Programs as partial graphs I: Flow equivalence and correctness. Theoret. Comput. Sci., 15:1-25, 1981.
19. G. Schmidt and T. StrÄohlein. Relations and Graphs. EATCS Monographs in Computer Science, Springer-Verlag, Berlin, 1993.
20. A. Tarski, On the calculus of relations, J. Symb. Log., 6(3):73-89, 1941.
21. A. Tarski. A lattice-theoretical xpoint theorem and its applications. Paci c Journal of Mathematics, 5:285-309, 1955.
22. F. Tchier and J. Desharnais. Generalization of a theorem of Mills. In A. E. Harmanci, E. Gelenbe, and B. Ä Orencik, editors, 10th International Symp. on Computer and Information Sciences (ISCIS X), pages 27-34, Kusadasi, Turkey, October 1995.
23. F. Tchier. Semantiques relationelles demoniaques et veri cation de boucles non deterministes. Ph.D. Thesis, Departement de Mathematiques, Universit e Laval, Canada, 1996.