You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This textbook discusses the most fundamental and puzzling questions about the foundations of computing. In 23 lecture-sized chapters it provides an exciting tour through the most important results in the field of computability and time complexity, including the Halting Problem, Rice's Theorem, Kleene's Recursion Theorem, the Church-Turing Thesis, Hierarchy Theorems, and Cook-Levin's Theorem. Each chapter contains classroom-tested material, including examples and exercises. Links between adjacent chapters provide a coherent narrative. Fundamental results are explained lucidly by means of programs written in a simple, high-level imperative programming language, which only requires basic mathematical knowledge. Throughout the book, the impact of the presented results on the entire field of computer science is emphasised. Examples range from program analysis to networking, from database programming to popular games and puzzles. Numerous biographical footnotes about the famous scientists who developed the subject are also included. "Limits of Computation" offers a thorough, yet accessible, introduction to computability and complexity for the computer science student of the 21st century.
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 volume contains the proceedings of AMAST 2002, the 9th International Conference on Algebraic Methodology and Software Technology, held during September 9–13, 2002, in Saint-Gilles-les-Bains, R ́eunion Island, France. The major goal of the AMAST conferences is to promote research that may lead to setting software technology on a ?rm mathematical basis. This goal is achieved through a large international cooperation with contributions from both academia and industry. Developing a software technology on a mathematical basis p- duces software that is: (a) correct, and the correctness can be proved mathem- ically, (b) safe, so that it can be used in the implementation of critical systems,...
The Annual Conference of the European Association for Computer Science Logic, CSL 2002, was held in the Old College of the University of Edinburgh on 22–25 September 2002. The conference series started as a programme of Int- national Workshops on Computer Science Logic, and then in its sixth meeting became the Annual Conference of the EACSL. This conference was the sixteenth meeting and eleventh EACSL conference; it was organized by the Laboratory for Foundations of Computer Science at the University of Edinburgh. The CSL 2002 Programme Committee considered 111 submissions from 28 countries during a two week electronic discussion; each paper was refereed by at least three reviewers. The Committee selected 37 papers for presentation at the conference and publication in these proceedings. The Programme Committee invited lectures from Susumu Hayashi, Frank Neven, and Damian Niwinski; ́ the papers provided by the invited speakers appear at the front of this volume. In addition to the main conference, two tutorials – ‘Introduction to Mu- Calculi’ (Julian Brad?eld) and ‘Parametrized Complexity’ (Martin Grohe) – were given on the previous day.
ETAPS 2001 was the fourth instance of the European Joint Conferences on Theory and Practice of Software. ETAPS is an annual federated conference that was established in 1998 by combining a number of existing and new conferences. This year it comprised ve conferences (FOSSACS, FASE, ESOP, CC, TACAS), ten satellite workshops (CMCS, ETI Day, JOSES, LDTA, MMAABS, PFM, RelMiS, UNIGRA, WADT, WTUML), seven invited lectures, a debate, and ten tutorials. The events that comprise ETAPS address various aspects of the system de- lopment process, including speci cation, design, implementation, analysis, and improvement. The languages, methodologies, and tools which support these - tivities are all well within its scope. Di erent blends of theory and practice are represented, with an inclination towards theory with a practical motivation on one hand and soundly-based practice on the other. Many of the issues involved in software design apply to systems in general, including hardware systems, and the emphasis on software is not intended to be exclusive.
Java, undoubtedly, has its roots in embedded systems and the Web. Nevertheless, it is a fully functional high-level programming language that can provide users with a wide range of functionality and versatility. This thoroughly cross-reviewed state-of-the-art survey is devoted to the study of the syntax and semantics of Java from a formal-methods point of view. It consists of the following chapters by leading researchers: Formal Grammar for Java; Describing the Semantics of Java and Proving Type Soundness; Proving Java Type Soundness; Machine-Checking the Java Specification: Proving Type-Safety; An Event-Based Structural Operational Semantics of Multi-Threaded Java Dynamic Denotational Semantics of Java; A Programmer's Reduction Semantics for Classes and Mixins; A Formal Specification of Java Virtual Machine Instructions for Objects, Methods and Subroutines; The Operational Semantics of a Java Secure Processor; A Programmer Friendly Modular Definition of the Semantics of Java.
This book constitutes the refereed proceedings of the 15th International Workshop on Computer Science Logic, CSL 2001, held as the 10th Annual Conerence of the EACSL in Paris, France in September 2001. The 39 revised full papers presented together with two invited papers were carefully reviewed and selected from 91 submissions. The papers are organized in topical sections on linear logic, descriptive complexity, semantics, higher-order programs, model logics, verification, automata, lambda calculus, induction, equational calculus, and constructive theory of types.
This book constitutes the refereed proceedings of the 12th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2011, held in Austin, TX, USA, in January 2011, co-located with the Symposium on Principles of Programming Languages, POPL 2011. The 24 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 71 initial submissions. The papers showcases state-of-the-art research in areas such as verification, model checking, abstract interpretation and address any programming paradigm, including concurrent, constraint, functional, imperative, logic and object-oriented programming. Further topics covered are static analysis, deductive methods, program certification, debugging techniques, abstract domains, type systems, and optimization.
This book constitutes the refereed proceedings of the 18th International Symposium Fundamentals of Computation Theory, FCT 2011, held in Oslo, Norway, in August 2011. The 28 revised full papers presented were carefully reviewed and selected from 78 submissions. FCT 2011 focused on algorithms, formal methods, and emerging fields, such as ad hoc, dynamic and evolving systems; algorithmic game theory; computational biology; foundations of cloud computing and ubiquitous systems; and quantum computation.
This book is dedicated to Professor Martin Wirsing on the occasion of his emeritation from Ludwig-Maximilians-Universität in Munich, Germany. The volume is a reflection, with gratitude and admiration, on Professor Wirsing’s life highly creative, remarkably fruitful and intellectually generous life. It also gives a snapshot of the research ideas that in many cases have been deeply influenced by Professor Wirsing’s work. The book consists of six sections. The first section contains personal remembrances and expressions of gratitude from friends of Professor Wirsing. The remaining five sections consist of groups of scientific papers written by colleagues and collaborators of Professor Wirsing, which have been grouped and ordered according to his scientific evolution. More specifically, the papers are concerned with logical and algebraic foundations; algebraic specifications, institutions and rewriting; foundations of software engineering; service oriented systems; and adaptive and autonomic systems.