In computing science design plays an eminently important role. By now, it is quite clear that the issue of proper design of programs within a formal calculus is one of the most interesting and most difficult parts of computing science. Many demanding problems have to be envisaged here such as notations, rules and calculi, and the study of semantic models. We are 'far away from comprehensive and widely accepted solutions in these areas. Discussions at the summer school have clearly shown that people have quite different perspectives and priorities with respect to these three main areas. There is a general agreement that notation is very important. Here, notation is not so much used in the sense of "syntactic sugar," but rather in the sense of abstract syntax, in the sense of language constructs. Proper notation can significantly improve our understanding of the nature of the objects that we are dealing with and simplify the formal manipulation of these objects. However, influenced by educational background, habits, and schools of thought there are quite different tastes with respect to notation. The papers in these proceedings show very clearly how different those notations can be even when talking about quite similar objects.

Computing Science is a science of constructive methods. The solution of a problem has to be described formally by constructive techniques, if it is to be evaluated on a computer. The Marktoberdorf Advanced Study Institute 1988 presented a comprehensive survey of the recent research in constructive methods in Computing Science. Some approaches to a methodological framework and to supporting tools for specification, development and verification of software systems were discussed in detail. Other lectures dealt with the relevance of the foundations of logic for questions of program construction and with new programming paradigms and formalisms which have proven to be useful for a constructive approach to software development. The construction, specification, design and verification especially of distributed and communicating systems was discussed in a number of complementary lectures. Examples for those approaches were given on several levels such as semaphores, nondeterministic state transition systems with fairness assumptions, decomposition of specifications for concurrent systems in liveness and safety properties and functional specifications of distributed systems. Construction methods in programming that were presented range from type theory, the theory of evidence, theorem provers for proving properties of functional programs to category theory as an abstract and general concept for the description of programming paradigms.

In software engineering there is a growing need for formalization as a basis for developing powerful computer assisted methods. This volume contains seven extensive lectures prepared for a series of IFIP seminars on the Formal Description of Programming Concepts. The authors are experts in their fields and have contributed substantially to the state of the art in numerous publications. The lectures cover a wide range in the theoretical foundations of programming and give an up-to-date account of the semantic models and the related tools which have been developed in order to allow a rigorous discussion of the problems met in the construction of correct programs. In particular, methods for the specification and transformation of programs are considered in detail. One lecture is devoted to the formalization of concurrency and distributed systems and reflects their great importance in programming. Further topics are the verification of programs and the use of sophisticated type systems in programming. This compendium on the theoretical foundations of programming is also suitable as a textbook for special seminars on different aspects of this broad subject.

This book is the second of two volumes that present the main results which emerged from the project CIP - Computer-Aided, Intuition-Guided Programming - at the Technical University of Munich. Its central theme is program development by transformation, a methodology which is becoming more and more important. Whereas Volume I contains the description and formal specification of a wide spectrum language CIP-L particularly tailored to the needs of transformational programming, Volume II serves a double purpose: First, it describes a system, called CIP-S, that is to assist a programmer in the method of transformational programming. Second, it gives a non-toy example for this very method, since it contains a formal specification of the system core and transformational developments for the more interesting system routines. Based on a formal calculus of program transformations, the informal requirements for the system are stated. Then the system core is formally specified using the algebraic data types and the pre-algorithmic logical constructs of the wide spectrum language CIP-L. It is demonstrated how executable, procedural level programs can be developed from this specification according to formal rules. The extensive collection of these rules is also contained in the book; it can be used as the basis for further developments using this method. Since the system has been designed in such a way that it is parameterized with the concrete programming language to be transformed, the book also contains a guide how to actualize this parameter; the proceeding is exemplified with a small subset of CIP-L.

Long ago~ the welfare of a sooiety used to depend heavily on the skill and dedioation of its oraftsmen - the miller~ the blaok- smith~ the oobbler and the tailor. These oraftsmen aoquired their skill by a long and poorly paid apprentioeship to some master of their oraft. They learned by imitation and experienoe~ and by tri- al and error. They did not read books or study soienoe~ they knew nothing of the theory of their subjeot~ the geometry of their ru- dimentary drawings~ nor the mathematios underlying their primitive oaloulations. They oould not explain how or why they used their methods; yet they worked effeotively by themselves or in small teams to oomplete their tasks at a predioted oost~ to a fairly well predioted timesoale~ and usually to the satisfaotion of their olients. The programmer of today shares many of these attributes of a oraftsman. He learns his oraft by apprentioeship in an existing team of programmers - but his apprentiaeship is highZy paid and usually very short. He develops his skill by trial; but mostly by error. He does not study theory~ or even read books on Computer Soience. He knows nothing of the logical and mathematical founda- tions of his profession; and he hates to explain or justifY~ or even to dooument what he has done.

Das V-Modell XT ist ein umfassendes Prozessmodell fur die Planung und Durchfuhrung der Systementwicklung in IT-Projekten. Es ist seit Februar 2005 fur alle IT-Projekte der deutschen Bundesbehorden verbindlich und liegt seit Juni 2006 in der wesentlich erweiterten Version 1.2.1 vor.

Das Buch fuhrt an die etablierte Fachsprache anbindend in alle Konzepte des V-Modell XT und deren Begrifflichkeit ein und ist Mediator zwischen der Lehre des System Engineering, dem V-Modell-XT-Katalog und der Anwendungspraxis. Es dient als Begleiter fur die Konfiguration von V-Modell XT-basierten Projekten wie auch als Ratgeber fur die organisatorische Implementierung im Unternehmen.

Mit dem V-Modell XT wurden vollig neue Konzepte geschaffen und ein grosseres Leistungsspektrum einbezogen, um die verschiedenen IT-Projekttypen genauer und flexibler fokussieren zu konnen.

Das Buch ist gleichsam als Grundlage fur Vorlesungen geeignet, wie auch fur die autodidaktische Erschliessung durch den fachkundigen Leser."