|
|
|
|
| LEADER |
02542nmm a2200325 u 4500 |
| 001 |
EB000631868 |
| 003 |
EBX01000000000000001348799 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9781475743760
|
| 100 |
1 |
|
|a Apt, Krzysztof R.
|
| 245 |
0 |
0 |
|a Verification of Sequential and Concurrent Programs
|h Elektronische Ressource
|c by Krzysztof R. Apt, Ernst-Rüdiger Olderog
|
| 250 |
|
|
|a 1st ed. 1991
|
| 260 |
|
|
|a New York, NY
|b Springer New York
|c 1991, 1991
|
| 300 |
|
|
|a XVI, 444 p
|b online resource
|
| 505 |
0 |
|
|a I In the Beginning -- 1 Introduction -- 2 Preliminaries -- II Sequential Programs -- 3 Deterministic Programs -- 4 Nondeterministic Programs -- III Parallel Programs -- 5 Disjoint Parallel Programs -- 6 Parallel Programs with Shared Variables -- 7 Parallel Programs with Synchronization -- IV Distributed Programs -- 8 Distributed Programs -- Appendices -- A Semantics -- B Axioms and Proof Rules -- C Proof Systems -- D Proof Outlines -- Author Index -- Symbol Index
|
| 653 |
|
|
|a Computer Science Logic and Foundations of Programming
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Formal Languages and Automata Theory
|
| 653 |
|
|
|a Machine theory
|
| 700 |
1 |
|
|a Olderog, Ernst-Rüdiger
|e [author]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Monographs in Computer Science
|
| 028 |
5 |
0 |
|a 10.1007/978-1-4757-4376-0
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-1-4757-4376-0?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 004.0151
|
| 520 |
|
|
|a This book provides a structured introduction to the verification of sequen tial and concurrent programs. It thus belongs to the area of programming languages but at the same time it is firmly based on mathematical logic. In logic one usually studies fixed syntactic or semantic objects. This is not necessarily the case in the area of program verification. The objects studied here, namely programs, do not have a standard syntax, their semantics can be defined in many different ways, and several approaches to their verification can be contemplated. These differences lead to various difficult design decisions. Even though we restrict our attention here to one programming style - imperative pro gramming - we are still confronted with a veritable cornucopia of pro gramming constructs from which an appropriate selection has to be made. Having studied some of these constructs separately does not yet imply that we understand their combined effect
|