Strongest invariant functions: Their use in the systematic analysis of while statements

1. Amy, B.: Calcul des Invariants Algorithmiques. In: Actes du Congrès Théories et Techniques de l'Informatique, pp.390–399. Gif-Sur-Yvette, France, 1978

2. Amy, B., Caplain, M.: Invariants Algorithmiques et Recurrences. Rapport de Recherche No 110. ENSIMAG, Université de Grenoble, 1978. Also available in: Proceedings, Third International Symposium on Programming, pp.218–231. Paris, 1978

3. Basu, S.K., Misra, J.: Proving Loop Programs. IEEE Trans. Software Eng. SE-1, 339–345 1975

   Google Scholar 

4. Caplain, M.: Finding Invariant Assertions for Proving Programs. Proceedings, International Conference on Reliable Software, pp.165–171. Los Angeles, 1975

5. Dunlop, D.D., Basili, V.R.: A Comparative Analysis of Functional Correctness. ACM Comput. Surveys 14, 229–244 (1982)

   Google Scholar 

6. Gries, D.: The Science of Programming. Berlin-Heidelberg-New York: Springer 1981

   Google Scholar 

7. Hoare, C.A.R.: An Axiomatic Basis for Computer Programming. Commun. ACM 12, 576–583 (1969)

   Google Scholar 

8. Manna, Z.: Mathematical Theory of Computation. New York: McGraw-Hill 1974

   Google Scholar 

9. Mili, A.: The Bottom Up Analysis of While Statements: Strongest Invariant Functions. Proceedings, Ninth World Computer Congress (IFIP '83), pp.339–343. Paris, France, 1983

10. Mili, A.: Verifying Programs by Induction on their Data Structure: General Format and Applications. Inf. Process. Lett. 17, 155–160 (1983)

    Google Scholar 

11. Mili, A.: A Relational Approach to the Design of Deterministic Programs. Acta Inf. 20, 315–328 (1983)

    Google Scholar 

12. Mili, A., Desharnais, J., Gagné, J.-R.: Strongest Invariant Functions. Rapport de Recherche, DIUL-RR-8412. Département d'Informatique, Université Laval, Québec, PQ, G1K 7P4, 1984

    Google Scholar 

13. Mills, H.D.: The New Math of Computer Programming. Commun. ACM 18, 43–48 (1975)

    Google Scholar 

14. Mills, H., Basili, V.R., Gannon, J.D., Hamlet, R.G., Schneiderman, B., Austing, R.H., Kohl, J.E.: The Calculus of Computer Programming. Manuscript (1982) (To be published by Allyn & Bacon, Boston, MA)

15. Parnas, D.L.: A Generalized Control Structure and Its Formal Definition. Commun. ACM 26, 572–581 (1983)

    Google Scholar 

16. Sanderson, J.G.: A Relational Theory of Computing. Lect. Notes Comput. Sci. Vol. 82. BerlinHeidelberg-New York: Springer 1980

    Google Scholar 

Download references