Verification of Sequential and Concurrent Programs:
Gespeichert in:
| Beteiligte Personen: | , , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | Englisch |
| Veröffentlicht: |
London
Springer London
2009
|
| Ausgabe: | 3rd ed. 2009 |
| Schriftenreihe: | Texts in Computer Science
|
| Schlagwörter: | |
| Links: | https://doi.org/10.1007/978-1-84882-745-5 https://doi.org/10.1007/978-1-84882-745-5 |
| Umfang: | 1 Online-Ressource (XXIV, 502 Seiten 26 illus.) |
| ISBN: | 9781848827455 |
| ISSN: | 1868-095X |
| DOI: | 10.1007/978-1-84882-745-5 |
Internformat
MARC
| LEADER | 00000nam a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV050122746 | ||
| 003 | DE-604 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 250115s2009 xx o|||| 00||| eng d | ||
| 020 | |a 9781848827455 |9 978-1-84882-745-5 | ||
| 024 | 7 | |a 10.1007/978-1-84882-745-5 |2 doi | |
| 035 | |a (ZDB-2-SCS)978-1-84882-745-5 | ||
| 035 | |a (OCoLC)1492134240 | ||
| 035 | |a (DE-599)BVBBV050122746 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-355 | ||
| 082 | 0 | |a 004.0151 |2 23 | |
| 100 | 1 | |a Apt, Krzysztof R. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Verification of Sequential and Concurrent Programs |c by Krzysztof R. Apt, Frank S. de Boer, Ernst-Rüdiger Olderog |
| 250 | |a 3rd ed. 2009 | ||
| 264 | 1 | |a London |b Springer London |c 2009 | |
| 300 | |a 1 Online-Ressource (XXIV, 502 Seiten 26 illus.) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Texts in Computer Science |x 1868-095X | |
| 505 | 8 | |a 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. | |
| 505 | 8 | |a 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. | |
| 505 | 8 | |a 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 thecall-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, | |
| 505 | 8 | |a 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 | |
| 650 | 4 | |a Computer Science Logic and Foundations of Programming | |
| 650 | 4 | |a Formal Languages and Automata Theory | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Computer science | |
| 650 | 4 | |a Machine theory | |
| 650 | 4 | |a Algorithms | |
| 700 | 1 | |a de Boer, Frank S. |4 aut | |
| 700 | 1 | |a Olderog, Ernst-Rüdiger |4 aut | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781848827448 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781848827462 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781447125136 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-1-84882-745-5 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-1-SCS | ||
| 940 | 1 | |q ZDB-2-SCS_2009 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-035459616 | |
| 966 | e | |u https://doi.org/10.1007/978-1-84882-745-5 |l DE-355 |p ZDB-2-SCS |q UBR Paketkauf 2024 |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1823676063580946432 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Apt, Krzysztof R. de Boer, Frank S. Olderog, Ernst-Rüdiger |
| author_facet | Apt, Krzysztof R. de Boer, Frank S. Olderog, Ernst-Rüdiger |
| author_role | aut aut aut |
| author_sort | Apt, Krzysztof R. |
| author_variant | k r a kr kra b f s d bfs bfsd e r o ero |
| building | Verbundindex |
| bvnumber | BV050122746 |
| collection | ZDB-1-SCS |
| contents | 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 thecall-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 |
| ctrlnum | (ZDB-2-SCS)978-1-84882-745-5 (OCoLC)1492134240 (DE-599)BVBBV050122746 |
| dewey-full | 004.0151 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.0151 |
| dewey-search | 004.0151 |
| dewey-sort | 14.0151 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| doi_str_mv | 10.1007/978-1-84882-745-5 |
| edition | 3rd ed. 2009 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000zcb4500</leader><controlfield tag="001">BV050122746</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">250115s2009 xx o|||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781848827455</subfield><subfield code="9">978-1-84882-745-5</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-84882-745-5</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SCS)978-1-84882-745-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1492134240</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV050122746</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-355</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.0151</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Apt, Krzysztof R.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Verification of Sequential and Concurrent Programs</subfield><subfield code="c">by Krzysztof R. Apt, Frank S. de Boer, Ernst-Rüdiger Olderog</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">3rd ed. 2009</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">London</subfield><subfield code="b">Springer London</subfield><subfield code="c">2009</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XXIV, 502 Seiten 26 illus.)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Texts in Computer Science</subfield><subfield code="x">1868-095X</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">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 thecall-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,</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">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</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Science Logic and Foundations of Programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Formal Languages and Automata Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machine theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">de Boer, Frank S.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Olderog, Ernst-Rüdiger</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781848827448</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781848827462</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781447125136</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-84882-745-5</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-SCS</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SCS_2009</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-035459616</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-1-84882-745-5</subfield><subfield code="l">DE-355</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="q">UBR Paketkauf 2024</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV050122746 |
| illustrated | Not Illustrated |
| indexdate | 2025-02-10T13:10:23Z |
| institution | BVB |
| isbn | 9781848827455 |
| issn | 1868-095X |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-035459616 |
| oclc_num | 1492134240 |
| open_access_boolean | |
| owner | DE-355 DE-BY-UBR |
| owner_facet | DE-355 DE-BY-UBR |
| physical | 1 Online-Ressource (XXIV, 502 Seiten 26 illus.) |
| psigel | ZDB-1-SCS ZDB-2-SCS_2009 ZDB-2-SCS UBR Paketkauf 2024 |
| publishDate | 2009 |
| publishDateSearch | 2009 |
| publishDateSort | 2009 |
| publisher | Springer London |
| record_format | marc |
| series2 | Texts in Computer Science |
| spelling | Apt, Krzysztof R. Verfasser aut Verification of Sequential and Concurrent Programs by Krzysztof R. Apt, Frank S. de Boer, Ernst-Rüdiger Olderog 3rd ed. 2009 London Springer London 2009 1 Online-Ressource (XXIV, 502 Seiten 26 illus.) txt rdacontent c rdamedia cr rdacarrier Texts in Computer Science 1868-095X 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 thecall-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 Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Algorithms Computer science Machine theory de Boer, Frank S. aut Olderog, Ernst-Rüdiger aut Erscheint auch als Druck-Ausgabe 9781848827448 Erscheint auch als Druck-Ausgabe 9781848827462 Erscheint auch als Druck-Ausgabe 9781447125136 https://doi.org/10.1007/978-1-84882-745-5 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Apt, Krzysztof R. de Boer, Frank S. Olderog, Ernst-Rüdiger Verification of Sequential and Concurrent Programs 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 thecall-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 Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Algorithms Computer science Machine theory |
| title | Verification of Sequential and Concurrent Programs |
| title_auth | Verification of Sequential and Concurrent Programs |
| title_exact_search | Verification of Sequential and Concurrent Programs |
| title_full | Verification of Sequential and Concurrent Programs by Krzysztof R. Apt, Frank S. de Boer, Ernst-Rüdiger Olderog |
| title_fullStr | Verification of Sequential and Concurrent Programs by Krzysztof R. Apt, Frank S. de Boer, Ernst-Rüdiger Olderog |
| title_full_unstemmed | Verification of Sequential and Concurrent Programs by Krzysztof R. Apt, Frank S. de Boer, Ernst-Rüdiger Olderog |
| title_short | Verification of Sequential and Concurrent Programs |
| title_sort | verification of sequential and concurrent programs |
| topic | Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Algorithms Computer science Machine theory |
| topic_facet | Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Algorithms Computer science Machine theory |
| url | https://doi.org/10.1007/978-1-84882-745-5 |
| work_keys_str_mv | AT aptkrzysztofr verificationofsequentialandconcurrentprograms AT deboerfranks verificationofsequentialandconcurrentprograms AT olderogernstrudiger verificationofsequentialandconcurrentprograms |