Narrow your search

Library

UNamur (7)

ULiège (4)

UCLouvain (3)

KU Leuven (2)

UMons (2)

EhB (1)

LUCA School of Arts (1)

Odisee (1)

Thomas More Kempen (1)

Thomas More Mechelen (1)

More...

Resource type

book (7)


Language

English (7)


Year
From To Submit

2011 (1)

2010 (1)

2007 (1)

2003 (1)

1990 (2)

More...
Listing 1 - 7 of 7
Sort by
Principles of constraint programming
Author:
ISBN: 0521825830 9780521825832 9780521125499 9780511615320 Year: 2003 Publisher: Cambridge : Cambridge University Press,

Loading...
Export citation

Choose an application

Bookmark

Abstract


Book
Acyclic programs (extended abstract)
Authors: ---
Year: 1990 Publisher: Amsterdam: Stichting mathematisch centrum,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Keywords


Book
Lectures in game theory for computer scientists
Authors: ---
ISBN: 9780521198660 9780511973468 9781139010276 1139010271 0511973462 0521198666 1107215153 1283099039 9786613099037 1139009753 1139007017 1139008129 1139009222 Year: 2011 Publisher: Cambridge : Cambridge University Press,

Loading...
Export citation

Choose an application

Bookmark

Abstract

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.


Book
Introduction to program verification
Authors: ---
Year: 1990 Publisher: Amsterdam: Centrum voor wiskunde en informatica,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Keywords


Book
Verification of sequential and concurrent programs
Authors: --- ---
ISSN: 18680941 ISBN: 9781848827455 9781848827448 184882744X Year: 2010 Publisher: London: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

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.


Book
Logics and models of concurrent systems
Authors: ---
ISBN: 0387151818 3540151818 3642824552 3642824536 9780387151816 Year: 1985 Volume: 13 Publisher: Berlin Heidelberg : Springer-Verlag,

Listing 1 - 7 of 7
Sort by