Abstract
We can now ensure total correctness by recursive inequations on predicates, any solutions of which are acceptable. However, the criteria are only sufficient and the construction of solutions is not fully effective.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Cousot, P., Méthodes itératives de construction et d'approximation de points fixes d'opérateurs monotones sur un treillis et Analyse sémantique des programmes, Thèse d'Etat, Univ. de Grenoble, 1978.
Dijkstra, E. W., A Discipline of Programming, Prentice-Hall, New Jersey, 1976.
Sintzoff, M., Eliminating blind alleys from backtrack programs, in Proc. 3d Int. Coll. Automata, Languages and Programming, Edinburgh Univ. Press, 1976, pp. 531–557.
Sintzoff, M., Inventing program construction rules, in Proc. IFIP Working Conf. on Constructing Quality Software, North-Holland, Amsterdam, 1978.
Stoy, J., Denotational Semantics, M.I.T., Boston, 1977.
van Lamsweerde, A., and M. Sintzoff, Formal derivation of strongly correct parallel programs, MBLE R338, Brussels, 1976, submitted for publication.
van Lamsweerde, A., From verifying termination to guaranteeing it: a case study, in Proc. IFIP Working Conf. on Formal Description of Programming Concepts, North-Holland, Amsterdam, 1978.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1978 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sintzoff, M. (1978). Ensuring correctness by arbitrary postfixed-points. In: Winkowski, J. (eds) Mathematical Foundations of Computer Science 1978. MFCS 1978. Lecture Notes in Computer Science, vol 64. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08921-7_96
Download citation
DOI: https://doi.org/10.1007/3-540-08921-7_96
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08921-6
Online ISBN: 978-3-540-35757-5
eBook Packages: Springer Book Archive