Software Reliability Methods pp 13-27 | Cite as

# Preliminaries

Chapter

## Abstract

Software reliability methods are based on mathematical principles. It is usually not necessary for users of these methods to master the relevant mathematical theories. In this book we are going to present both the techniques and some of the principles comprising them. We will thus necessarily use some mathematical terminology. This chapter surveys some concepts and theories that are used later in the book. Having a prior knowledge of basic notions from set theory, graph theory, complexity theory and computability is sufficient to allow the reader to skip this chapter.

## Keywords

Turing Machine Complexity Class Complexity Measure Exponential Complexity Empty String
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.

## Preview

Unable to display preview. Download preview PDF.

## Further Reading

## Textbooks on set theory include:

- P. R. Halmos,
*Naive Set Theory*, Springer-Verlag, 1987.Google Scholar - K. Devlin,
*The Joy of Sets: Fundamentals of Contemporary Set Theory*, 2nd edition, Springer-Verlag, 1993.Google Scholar

## Books on graph theory include:

- R. Diestel,
*Graph Theory*, Springer-Verlag, 2nd edition, 2000.Google Scholar - A. Gibbons,
*Algorithmic Graph Theory*, Cambridge University Press, 1985.Google Scholar

## Books on computability and complexity theory include:

- J. E. Hoperoft, J. D. Ullman,
*Introduction to Automata Theory*,*Languages and Computation*, Addison-Wesley, 1979.Google Scholar - H. R. Lewis, Ch. Papadimitiou,
*Elements of the Theory of Computation*, Prentice-Hall, 2nd edition, 1997.Google Scholar - Ch. Papadimitiou,
*Computational Complexity*, Addison-Wesley, 1994.Google Scholar - M. Sipser,
*Introduction to the Theory of Computation*, PWS, 1996.Google Scholar

## Copyright information

© Lucent Technologies 2001