Set Theory and Relations

  • V. S. Alagar
  • K. Periyasamy
Part of the Graduate Texts in Computer Science book series (TCS)


The main goal of this chapter is to demonstrate the usefulness of mathematical abstractions such as sets, relations, functions, and sequences in software development. In particular, the chapter lays the foundation for the specification languages presented in the next four chapters.


Inductive Step Security Level Finite Sequence Function Definition Induction Rule 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    V.S. Alagar, Fundamentals of Computing — Theory and Practice, Prentice-Hall, Englewood Cliffs, NJ, 1989.MATHGoogle Scholar
  2. [2]
    C.B. Jones, Systematic Software Development using VDM (second edition), Prentice Hall International (UK), 1990.MATHGoogle Scholar
  3. [3]
    J. McLean, “The Specification and Modeling of Computer Security,” IEEE Computer, Vol. 23, No. 1, January 1990, pp. 9–16.CrossRefGoogle Scholar
  4. [4]
    K.H. Rosen, Discrete Mathematics and itsApplications (second edition), McGraw-Hill, New York, NY, 1990.Google Scholar
  5. [5]
    J.M. Spivey, Understanding Z: A Specification Language and its Formal Semantics, Cambridge University Press, Cambridge, England, 1988.MATHGoogle Scholar

Copyright information

© Springer Science+Business Media New York 1998

Authors and Affiliations

  • V. S. Alagar
    • 1
  • K. Periyasamy
    • 2
  1. 1.Department of Computer ScienceConcordia UniversityMontrealCanada
  2. 2.Department of Computer ScienceUniversity of ManitobaWinnipegCanada

Personalised recommendations