Compositionality, Concurrency, and Partial Correctness: Proof Theories for Networks of Processes, and Their RelationshipSpringer Science & Business Media, 1989. gada 22. febr. - 276 lappuses The hierarchical decomposition of programs into smaller ones is generally considered imperative to master the complexity of large programs. The impact of this principle of program decomposition on the specification and verification of parallel executed programs is the subject of this monograph. Two important yardsticks for verification methods, those of compositionality and modularity, are made precise. The problem of reusing software is addressed by the introduction of the notion of specification adaptation. Within this context, different methods for specifying the observable behavior with respect to partial correctness of communicating processes are considered, and in particular the contrast between the "programs are predicates" and the "programs are predicate transformers" paradigms is shown. The associated formal proof systems are proven sound and complete in various senses with respect to the denotational semantics of the programming language, and they are related to each other to give an in-depth comparison between the different styles of program verification. The programming language TNP used here is near to actual languages like Occam. It combines CCS/CSP style communication based programming with state based programming, and allows dynamically expanding and shrinking networks of processes. |
Saturs
I | 1 |
II | 9 |
III | 12 |
IV | 20 |
V | 29 |
VI | 38 |
VII | 41 |
VIII | 43 |
XXXIV | 140 |
XXXV | 141 |
XXXVI | 142 |
XXXVII | 147 |
XXXVIII | 152 |
XXXIX | 153 |
XL | 154 |
XLI | 155 |
IX | 46 |
X | 52 |
XI | 54 |
XII | 55 |
XIII | 58 |
XIV | 67 |
XV | 71 |
XVI | 77 |
XVIII | 83 |
XIX | 87 |
XX | 88 |
XXI | 93 |
XXII | 99 |
XXIII | 100 |
XXIV | 102 |
XXV | 106 |
XXVI | 112 |
XXVII | 119 |
XXVIII | 124 |
XXIX | 127 |
XXXI | 135 |
XXXII | 136 |
XXXIII | 139 |
XLII | 156 |
XLIII | 158 |
XLIV | 159 |
XLV | 160 |
XLVI | 161 |
XLVII | 162 |
XLVIII | 164 |
XLIX | 167 |
L | 174 |
LI | 187 |
LII | 197 |
LIII | 201 |
LIV | 206 |
LV | 213 |
LVI | 215 |
LVII | 224 |
LVIII | 227 |
LIX | 248 |
LX | 249 |
LXI | 256 |
LXII | 258 |
LXIII | 266 |
Citi izdevumi - Skatīt visu
Compositionality, Concurrency, and Partial Correctness: Proof Theories for ... Job Zwiers Priekšskatījums nav pieejams - 2014 |
Bieži izmantoti vārdi un frāzes
abase(X abbreviation adaptation completeness adaptation rules arbitrary Assn assume atomic processes axiom B₂ base base(m black box C.A.R. Hoare chan chapter characteristic assertion closed set Communicating Sequential Processes communication history complete lattice compositional completeness computations consequence rule cont(insert deduction defined definition denote domain equivalent fin→q following derivation function getmin h₁ hchan Hoare formulae Hoare Logic Hoare style Hoare system implies induction Invariant system isempty Kern Kern(c least element lemma logical variables m₁ m2 sat mixed terms modular completeness operation parallel composition postcondition predicate logic prefix closed process variables proof rules proof system prove recursion recursion construct S₁ S₂ SAT formulae SAT system sat X sat X1 satisfies semantics sequential composition spec spec(S specification subnetwork syntactic theorem TNP processes to|c universal closure valid verification verification principles Xbag insert
Atsauces uz šo grāmatu
Verification of Sequential and Concurrent Programs Krzysztof R. Apt,E.-R. Olderog Ierobežota priekšskatīšana - 1997 |