Skip to main content
SpringerLink
Log in
Book cover

International Conference on Mathematical Foundations of Programming Semantics

MFPS 1989: Mathematical Foundations of Programming Semantics pp 247–270Cite as

Semantic models for total correctness and fairness

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 442))

Abstract

Assertional s-rings are introduced to provide an algebraic setting in which the finite and infinite behavior of nondeterministic programs can be expressed and reasoned about. This includes expressing the fair infinite behavior of nondeterministic iterative programs, and reasoning about termination under various fairness assumptions. We also address the question of when the reasoning techniques are semantically complete.

This research has been supported in part by National Science Foundation grant CCR-8701946. David Black has been supported by Storage Technology Corporation, Louisville, CO 80028.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. K.R. Apt and G.D. Plotkin. Countable nondeterminism and random assignment, Internal Report CSR-98-82, Department of Computer Science, University of Edinburgh, Scotland, (January 1982). Revised version appears in JACM 33 (1986).

    Google Scholar 

  2. S. Bloom and Z. Esik. Floyd-Hoare Logic in Iteration Theories, Technical Report #8801, Stevens Institute of Technology, Electrical Engineering and Computer Science Department (January 1988).

    Google Scholar 

  3. E.W. Dijkstra. Guarded commands, nondeterminacy and formal derivation of programs, CACM 18 (1975), 453–457.

    MATH  MathSciNet  Google Scholar 

  4. C.C. Elgot. Monadic computations and iterative algebraic theories, in: Logic Colloquium 73 (H.E. Rose and J.C. Sheperdson, Eds.), (North-Holland Publishing Co., 1975), 175–230.

    Google Scholar 

  5. C.C. Elgot. Matricial Theories, J. Algebra 42 (1976), 391–421.

    Article  MATH  MathSciNet  Google Scholar 

  6. N. Francez. Fairness, Springer-Verlag, New York, 1986.

    MATH  Google Scholar 

  7. D. Harel. First-order dynamic logic, LNCS 68 (Springer-Verlag, 1979).

    Google Scholar 

  8. D. Harel and V.R. Pratt. Nondeterminism in Logic of Programs, in: Proceedings of the 5th ACM Symposium on Principles of Programming Languages (1978), 203–213.

    Google Scholar 

  9. W. Kuich and A. Salomaa. Semirings, Automata, Languages, Springer-Verlag, 1985.

    Google Scholar 

  10. M.G. Main and D.B. Benson. Functional behavior of nondeterministic programs, in: Foundations of Computation Theory, LNCS 158, (Springer-Verlag, 1983), 290–301.

    MATH  MathSciNet  Google Scholar 

  11. M.G. Main and D.B. Benson. Functional behavior of nondeterministic and concurrent programs, Information and Control 62 (1984), 144–189.

    Article  MATH  MathSciNet  Google Scholar 

  12. E.G. Manes. Boolean Theories, preprint.

    Google Scholar 

  13. E.G. Manes. Assertion semantics in a control category, Theoretical Computer Science, to appear.

    Google Scholar 

  14. E.G. Manes. Assertional Categories, in: Proceedings of the Third Workshop on Mathematical Semantics of Programming Languages, Lecture Notes in Computer Science 298, Springer-Verlag (1988), 85–120.

    MATH  MathSciNet  Google Scholar 

  15. E.G. Manes and M.A. Arbib. Algebraic Approaches to Program Semantics, Springer-Verlag, New York, 1986.

    MATH  Google Scholar 

  16. E.G. Manes and D.B. Benson. The inverse semigroup of a sum-ordered semiring, Semigroup Forum 31 (1985), 129–152.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Colorado, 80309, Boulder, CO, USA

    Michael G. Main & David L. Black

Authors
  1. Michael G. Main
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David L. Black
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. Main A. Melton M. Mislove D. Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Main, M.G., Black, D.L. (1990). Semantic models for total correctness and fairness. In: Main, M., Melton, A., Mislove, M., Schmidt, D. (eds) Mathematical Foundations of Programming Semantics. MFPS 1989. Lecture Notes in Computer Science, vol 442. Springer, New York, NY. https://doi.org/10.1007/BFb0040261

Download citation

  • DOI: https://doi.org/10.1007/BFb0040261

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-97375-3

  • Online ISBN: 978-0-387-34808-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation