| Record ID | marc_columbia/Columbia-extract-20221130-004.mrc:623575509:2527 |
| Source | marc_columbia |
| Download Link | /show-records/marc_columbia/Columbia-extract-20221130-004.mrc:623575509:2527?format=raw |
LEADER: 02527mam a2200349 a 4500
001 1985795
005 20220609043535.0
008 970106t19971997nyua b 001 0 eng
010 $a 97001017
020 $a0387949429 (hardcover : alk. paper)
035 $a(OCoLC)ocm36181129
035 $9AMK5589CU
035 $a(NNC)1985795
035 $a1985795
040 $aDLC$cDLC$dC#P$dOrLoB-B
050 00 $aQA76.642$b.S36 1997
082 00 $a005.2/75$221
100 1 $aSchneider, Fred B.$0http://id.loc.gov/authorities/names/n87121730
245 10 $aOn concurrent programming /$cFred B. Schneider.
260 $aNew York :$bSpringer,$c[1997], ©1997.
300 $axix, 473 pages :$billustrations ;$c25 cm.
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
490 1 $aGraduate texts in computer science
504 $aIncludes bibliographical references (p. [435]-449) and index.
505 00 $g1.$tIntroduction --$g2.$tFormal Logic --$g3.$tTemporal Logic --$g4.$tNotation and Logic for Sequential Programming --$g5.$tConcurrency and Interference --$g6.$tSafety Properties: Invariance --$g7.$tSafety Properties with Past Terms --$g8.$tVerifying Arbitrary Temporal Logic Properties --$g9.$tProgramming with Fine-Grained Atomic Actions --$g10.$tSemaphores, Locks, and Conditional Critical Regions --$g11.$tMessage Passing and Distributed Programming --$g12.$tPutting It Together.
520 $aMuch software today is structured as concurrent programs. This graduate-level text offers a self-contained and in-depth treatment of the subject. Formal methods and assertional reasoning drive the exposition.
520 8 $aNot only are derivation and reasoning about concurrent programs discussed, but the assertional approach provides a compelling way to motivate and understand the more traditional concerns in concurrent programming: synchronization and communication mechanisms; protocols to solve key concurrent programming problems.
520 8 $aAs befits an introductory text, readers are provided with a good account of the basics: propositional and predicate logic, temporal logic, and a Hoare-style logic for sequential programs. Exercises at the end of each chapter extend and illustrate the main themes. The result is a book that should be invaluable to those interested in concurrent programming.
650 0 $aParallel programming (Computer science)$0http://id.loc.gov/authorities/subjects/sh85097827
830 0 $aGraduate texts in computer science.
852 00 $boff,eng$hQA76.642$i.S36 1997