The second part of this Handbook presents a choice of material on the theory of automata and rewriting systems, the foundations of modern programming languages, logics for program specification and verification, and some chapters on the theoretic modelling of advanced information processing.

"Of all the books I have covered in the Forum to date, this set is the most unique and possibly the most useful to the SIGACT community, in support both of teaching and research.... The books can be used by anyone wanting simply to gain an understanding of one of these areas, or by someone desiring to be in research in a topic, or by instructors wishing to find timely information on a subject they are teaching outside their major areas of expertise." -- Rocky Ross, "SIGACT News" "This is a reference which has a place in every computer science library." -- Raymond Lauzzana, "Languages of Design" The Handbook of Theoretical Computer Science provides professionals and students with a comprehensive overview of the main results and developments in this rapidly evolving field. Volume A covers models of computation, complexity theory, data structures, and efficient computation in many recognized subdisciplines of theoretical computer science. Volume B takes up the theory of automata and rewriting systems, the foundations of modern programming languages, and logics for program specification and verification, and presents several studies on the theoretic modeling of advanced information processing. The two volumes contain thirty-seven chapters, with extensive chapter references and individual tables of contents for each chapter. There are 5,387 entry subject indexes that include notational symbols, and a list of contributors and affiliations in each volume.

Introducing some of the foundational concepts, principles and techniques in the formal semantics of natural language, Elements of Formal Semantics outlines the mathematical principles that underlie linguistic meaning. Making use of a wide range of concrete English examples, the book presents the most useful tools and concepts of formal semantics in an accessible style and includes a variety of practical exercises so that readers can learn to utilise these tools effectively. For readers with an elementary background in set theory and linguistics or with an interest in mathematical modelling, this fascinating study is an ideal introduction to natural language semantics. Designed as a quick yet thorough introduction to one of the most vibrant areas of research in modern linguistics today this volume reveals the beauty and elegance of the mathematical study of meaning.

Now in paperback for the first time since its original publication, the material gathered here is perfect for anyone who needs a detailed and accessible introduction to the important semantic theories. Designed for a wide audience, it will be of great value to linguists, cognitive scientists, philosophers, and computer scientists working on natural language. The book covers theories of lexical semantics, cognitively oriented approaches to semantics, compositional theories of sentence semantics, and discourse semantics. This clear, elegant explanation of the key theories in semantics research is essential reading for anyone working in the area.

This book constitutes the refereed proceedings of the 12th IFIP WG 6.1 International Conference on Formal Methods for Open Object-Based Distributed Systems, FMOODS 2010, and the 30th IFIP WG 6.1 Formal Techniques for Networked and Distributed Systems, FORTE 2010, held in Amsterdam, The Netherlands, in June 2010. The 13 revised full papers presented together with 6 short papers and the abstract of one invited talk were carefully reviewed and selected from 38 submissions. The papers are organized in topical sections on formal UML modeling; components and architecture; timed process algebra; timed and hybrid automata; program logics and analysis; and reasoning about distributed systems.

The Formal Semantics of Programming Languages provides the basic mathematical techniques necessary for those who are beginning a study of the semantics and logics of programming languages. These techniques will allow students to invent, formalize, and justify rules with which to reason about a variety of programming languages. Although the treatment is elementary, several of the topics covered are drawn from recent research, including the vital area of concurency. The book contains many exercises ranging from simple to miniprojects.Starting with basic set theory, structural operational semantics is introduced as a way to define the meaning of programming languages along with associated proof techniques. Denotational and axiomatic semantics are illustrated on a simple language of while-programs, and fall proofs are given of the equivalence of the operational and denotational semantics and soundness and relative completeness of the axiomatic semantics. A proof of Godel's incompleteness theorem, which emphasizes the impossibility of achieving a fully complete axiomatic semantics, is included. It is supported by an appendix providing an introduction to the theory of computability based on while-programs. Following a presentation of domain theory, the semantics and methods of proof for several functional languages are treated. The simplest language is that of recursion equations with both call-by-value and call-by-name evaluation. This work is extended to lan guages with higher and recursive types, including a treatment of the eager and lazy lambda-calculi. Throughout, the relationship between denotational and operational semantics is stressed, and the proofs of the correspondence between the operation and denotational semantics are provided. The treatment of recursive types - one of the more advanced parts of the book - relies on the use of information systems to represent domains. The book concludes with a chapter on parallel programming languages, accompanied by a discussion of methods for specifying and verifying nondeterministic and parallel programs.

Connects the semantics of databases to that of natural language, and links them through a common view of the semantics of time.