\providecommand{\bysame}{\leavevmode\hbox to3em{\hrulefill}\thinspace}
\begin{thebibliography}{10}

\bibitem{bauer:alpd}
F.L. Bauer and H.W\"ossner, \emph{Algorithmic lamguage and program
  development}, Springer-Verlag, 1982.

\bibitem{broy:cmcs}
Manfred Broy (ed.), \emph{(th summer school on constructive methods in computer
  science}, Springer-Verlag, 1988.

\bibitem{misra:unity94}
K.~Many Chandy and Jayadev Misra, \emph{Parallel program design: A foundation},
  Addison-Wesley, 1988.

\bibitem{dijkstra:discipline}
E.W. Dijkstra, \emph{A discipline of programming}, Prentice Hall, Englewood
  Cliffs, 1976.

\bibitem{gries:science-prog}
David Gries, \emph{The science of programming}, Springer-Verlag, New York,
  1981.

\bibitem{gurevich:lipari}
Yuri Gurevich, \emph{Evolving algebras 1993: Lipari guide}, Specification and
  Validation Methods (E.~B\"orger, ed.), Oxford University Press, 1993.

\bibitem{dek:taocp:i}
Donald~E. Knuth, \emph{The art of computer programmimg, volume 1: Fundamental
  algorithms}, Addison-Wesley, 1998.

\bibitem{misra:unity88}
Jayadev Misra, \emph{A foundation of parallel progragramming}, In Broy
  \cite{broy:cmcs}, pp.~397--433.

\bibitem{motwani:randomized}
Rajeev Motwani and Prabhakar Raghavan, \emph{Randomized algorithms}, Cambridge
  University Press, 1995.

\bibitem{purdom:analysis}
Paul~Walton Purdom, Jr. and Cynthia~A. Brown, \emph{The analysis of
  algorithms}, Holt,Rienhart and Winston, 1985.

\bibitem{rogers:rf}
Hartley Rogers, \emph{Theory of recursive functions}, MIT Press, 1967.

\end{thebibliography}
