Martin Hofmann – författare

Extensional Constructs in Intensional Type Theory presents a novel approach to the treatment of equality in Martin-Loef type theory (a basis for important work in mechanised mathematics and program verification). Martin Hofmann attempts to reconcile the two different ways that type theories deal with identity types. The book will be of interest particularly to researchers with mainly theoretical interests and implementors of type theory based proof assistants, and also fourth year undergraduates who will find it useful as part of an advanced course on type theory.

The refereed proceedings of the 6th International Conference on Typed Lambda Calculi and Applications, TLCA 2003, held in Valencia, Spain in June 2003. The 21 revised full papers presented were carefully reviewed and selected from 40 submissions. The volume reports research results on all current aspects of typed lambda calculi, ranging from theoretical and methodological issues to the application of proof assistants.

Global computing refers to computation over “global computers,” i.e., com- tational infrastructures available globally and able to provide uniform services with variable guarantees for communication, cooperation and mobility, resource usage, security policies and mechanisms, etc., with particular regard to explo- ing their universal scale and the programmability of their services. As the scope and computational power of such global infrastructures continue to grow, it - comes more and more important to develop methods, theories and techniques for trustworthy systems running on global computers. This book constitutes the thoroughly refereed proceedings of the ?fth e- tion of the International Symposium on Trustworthy Global Computing (TGC 2010)thatwasheldinMunich,Germany,February24-26,2010.TheSymposium on Trustworthy Global Computing is an international annual venue dedicated to safe and reliable computation in global computers. It focuses on providing frameworks, tools, and protocols for constructing well-behaved applications and on reasoning rigorouslyabout their behavior and properties. The related models of computation incorporate code and data mobility over distributed networks with highly dynamic topologies and heterogeneous devices.

Das Buch beschäftigt sich mit der Theorie endlicher Automaten auf endlichen und unendlichen Wörtern sowie Bäumen. Es behandelt klassische Resultate wie die Sätze von Büchi und Rabin, die zeigen, wie sich monadische Logiken 2. Stufe auf diesen Strukturen mithilfe dieser Automatentheorie entscheiden lassen. Die einzelnen Kapitel sind in vier Teile zusammengefasst. Diese unterscheiden sich in den Strukturen, über denen jeweils Automatentheorie und Logik betrieben wird. Der erste Teil behandelt endliche Wörter. Der Zweite die Theorie auf den Bereich der Bäume auszudehnen. Der dritte Teil beschäftigt sich kurz mit endlichen Bäumen. Im vierten Teil geht es dann um Automatentheorie und Logik über unendliche Bäume. Jeder Teil endet mit Vorschlägen für Übungsaufgaben zu dem behandelten Stoff, sowie Notizen, welche auf weiterführende Literatur verweisen oder die Herkunft von präsentierten Resultaten erklären. Das Buch ist an sich ein geschlossenes Werk, welches mit den bereits erwähnten Vorkenntnissen zur Theorie formaler Sprachen und zunächst ohne weitere Hilfsmittel durchgearbeitet werden kann.

This book constitutes the refereed proceedings of the 14th International Conference on Foundations of Software Science and computational Structures, FOSSACS 2011, held in Saarbrücken, Germany, March 26—April 3, 2011, as part of ETAPS 2011, the European Joint Conferences on Theory and Practice of Software. The 30 revised full papers presented together with one full-paper length invited talk were carefully reviewed and selected from 100 submissions. The papers are organized in topical sections on coalgebra and computability, type theory, process calculi, automata theory, semantics, binding, security, and program analysis.

Die Anwendung der im ersten Teil beschriebenen Methoden und Tools wird anschaulich dargestellt und mit Tipps und Tricks ergänzt.

This book provides an overview of the various methods for creating and implementing efficient work processes. The author presents the most important tools for working on improvement projects such as process mapping, Ishikawa diagram, burn-down chart, or Pareto chart.

This book provides an overview of the various methods for creating and implementing efficient work processes. The author presents the most important tools for working on improvement projects such as process mapping, Ishikawa diagram, burn-down chart, or Pareto chart.

This book introduces the reader into the field of automata theory and logic. It studies fundamental properties like complementation and determinisation of automata on infinite words and trees, and presents their applications for logics used in program verification. The presentation of such concepts – some of which are 50 years old or more – is given in a modern style and is accompanied by many exercises. The book can be used for self-study or as a basis for a graduate course on automata and logic, presupposing knowledge on finite automata and regular languages of finite words only.