We briefly review some of the major accomplishements of theoretical computer science. Results from theoretical computer science have had enormous impact on the developement of programming languages and other areas of computer science. The impact of reseach in theoretical computer science is now

Thanks to co-authors on papers related to bounded model checking (in alphabetic order):

On an effective hierarchy of communicating processes: separation principle and testing’

Strictly-upward drawings of ordered search trees

Communicated by J.W. de Bakker Both for interleaving and for non-interleaving semantics, several variants of a x-calculus bisim-ilarity can be given which differ on the requirements imposed on name instantiations. Examples are the late, early, open and ground variants. The ground variant is the simplest because it places no requirements on name instantiations. With the exception of open bisimilarities, none of the bisimilarity considered in the literature is a congruence relation on the full n-calculus language. We show that in the case of (certain forms of) causul bisimulation the late, early, open and ground variants coincide and are congruence relations in the sublanguage of the n-calculus without matching. We also show that to obtain the same results in the case of the interleaving bisimilarity, in addition to forbidding matching it is necessary to constrain the output prefix.

Abstract not found

Hiermit versichere ich, die vorliegende Diplomarbeit ohne Hilfe Dritter und nur mit den angegebenen Quellen und Hilfsmitteln angefertigt zu haben. Alle Stellen, die aus den Quellen entnommen wurden, sind als solche kenntlich gemacht worden. Diese Arbeit hat in gleicher oder ähnlicher Form noch keiner Prüfungsbehörde vorgelegen.

The principles underlying this report can be summarized as follows: 1. A strong theoretical foundation is vital to computer science. 2. Theory can be enriched by practice. 3. Practice can be enriched by theory. 4. If we consider (2) and (3), the value, impact, and funding of theory will be enhanced

In this paper, we survey the use of order-theoretic topology in theoretical computer science, with an emphasis on applications of domain theory. Our focus is on the uses of order-theoretic topology in programming language semantics, and on problems of potential interest to topologists that stem

This article presents a bird’s eye view of Theoretical Computer Science aimed at a general scientific audience. It then focuses on a selected area within this general field, and discusses some of the applications of results from that area and of the fundamental theoretical questions that drive its