Set Theory and Relations

Part of the 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.


Function Return Inductive Step Specification Language Partial Function Finite Sequence 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Alagar VS (1989) Fundamentals of computing—theory and practice. Prentice Hall, Englewood Cliffs MATHGoogle Scholar
  2. 2.
    Jones CB (1990) Systematic software development using VDM, 2nd edn. Prentice hall international series in computer science MATHGoogle Scholar
  3. 3.
    McLean J (1990) The specification and modeling of computer security. IEEE Comput 23(1):9–16 CrossRefGoogle Scholar
  4. 4.
    Rosen KH (1990) Discrete mathematics and its applications, 2nd edn. McGraw Hill, New York Google Scholar
  5. 5.
    Spivey JM (1988) Understanding Z: a specification language and its formal semantics. Cambridge University Press, Cambridge MATHGoogle Scholar

Copyright information

© Springer-Verlag London Limited 2011

Authors and Affiliations

  1. 1.Dept. Computer Science and Software Eng.Concordia UniversityMontrealCanada
  2. 2.Computer Science DepartmentUniversity of Wisconsin-La CrosseLa CrosseUSA

Personalised recommendations