000 04981nam a22003975i 4500
001 290935
003 MX-SnUAN
005 20170705134222.0
007 cr nn 008mamaa
008 150903s2009 xxk| o |||| 0|eng d
020 _a9781848827455
_99781848827455
024 7 _a10.1007/9781848827455
_2doi
035 _avtls000344524
039 9 _a201509030354
_bVLOAD
_c201405050308
_dVLOAD
_y201402061259
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA76.9.L63
100 1 _aApt, Krzysztof R.
_eautor
_9321956
245 1 0 _aVerification of Sequential and Concurrent Programs /
_cby Krzysztof R. Apt, Frank S. Boer, Ernst-Rüdiger Olderog.
264 1 _aLondon :
_bSpringer London,
_c2009.
300 _axxiv, 502 páginas 26 ilustraciones
_brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
490 0 _aTexts in Computer Science,
_x1868-0941
500 _aSpringer eBooks
505 0 _aIn the Beginning -- Preliminaries -- Deterministic Programs -- While Programs -- Recursive Programs -- Recursive Programs with Parameters -- Object-Oriented Programs -- Parallel Programs -- Disjoint Parallel Programs -- Parallel Programs with Shared Variables -- Parallel Programs with Synchronization -- Nondeterministic and Distributed Programs -- Nondeterministic Programs -- Distributed Programs -- Fairness.
520 _aComputer 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.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700 1 _aBoer, Frank S.
_eautor
_9321957
700 1 _aOlderog, Ernst-Rüdiger.
_eautor
_9321958
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9781848827448
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-1-84882-745-5
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c290935
_d290935