Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Games provide mathematical models for interaction. Numerous tasks in computer science can be formulated in game-theoretic terms. This fresh and intuitive way of thinking through complex issues reveals underlying algorithmic questions and clarifies the relationships between different domains. This collection of lectures, by specialists in the field, provides an excellent introduction to various aspects of game theory relevant for applications in computer science that concern program design, synthesis, verification, testing and design of multi-agent or distributed systems. Originally devised for a Spring School organised by the GAMES Networking Programme in 2009, these lectures have since been revised and expanded, and range from tutorials concerning fundamental notions and methods to more advanced presentations of current research topics. This volume is a valuable guide to current research on game-based methods in computer science for undergraduate and graduate students. It will also interest researchers working in mathematical logic, computer science and game theory.

Game theory. --- Computer science --- Théorie des jeux --- Informatique --- Mathematics. --- Mathématiques --- Game theory --- Mathematics --- Théorie des jeux --- Mathématiques --- Operational research. Game theory --- Games, Theory of --- Theory of games --- Mathematical models --- Computer mathematics --- Electronic data processing --- Computer science - Mathematics

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Computer programs are an indispensable part of many of the systems we rely upon in our daily lives, and the proper functioning and safety of these systems is of paramount importance. The development of methods that ensure program correctness is therefore a key challenge for computer scientists. This widely anticipated third edition of Verification of Sequential and Concurrent Programs provides a systematic exploration of one of the most common approaches to program verification, known as the "assertional" approach. Following the successful formula of previous editions, this approach is applied to deterministic and nondeterministic sequential programs of varying complexity, together with both parallel and distributed concurrent programs. The expanded content of this thorough new edition also includes coverage of the verification of object-oriented programs. For each class of programs, the authors introduce an operational semantics and proof systems for the verification of partial and total correctness, justified formally in corresponding soundness theorems. Case studies supplied throughout the book demonstrate the use of the proof systems to formally verify solutions to classical problems, such as sorting, manipulation of lists, producer/consumer and mutual exclusion. Topics and Features: Includes a thorough introductory section, familiarizing the reader with the basic concepts and notation used in the book, as well as the book's structure Explains Hoare's approach to program verification for while programs, providing a correctness proof of a program for partitioning an array (NEW) Concludes each chapter with exercises and bibliographic remarks for further reading Discusses recursive programs that extend deterministic programs by parameterless procedures and procedures with the call-by-value parameter mechanism, and provides a correctness proof of the quicksort program (NEW) Explores nondeterministic and distributed programs, presenting a verification method of distributed programs based on a transformation into nondeterministic ones Presents object-oriented programs, with a focus on the main characteristics of objects (NEW) Investigates parallel programs with shared variables and with synchronization Studies the issue of fairness in the framework of nondeterministic programs, using an approach based on the method of explicit schedulers Includes a Foreword by Professor Amir Pnueli This modern update of a classic, reader-friendly textbook is perfect for an introductory course on program verification for advanced undergraduate or graduate students, and may also be used as an introduction to operational semantics. Outlines for possible courses are suggested in the Preface to the book. This book is unique in addressing assertional verification of all essential classes of imperative programs: while programs, recursive programs, object-oriented programs, nondeterministic programs, parallel programs, and distributed programs.

programmeren (informatica) --- Computer science --- Mathematical logic --- logica --- wiskunde --- Computer Science. --- Logics and Meanings of Programs. --- Mathematical Logic and Formal Languages. --- Computer science. --- Logic design. --- Informatique --- Structure logique --- Computer software --- Verification. --- Computer Science --- Logic design --- Verification --- Computer software - Verification. --- Computer software - Verification