Compositionality, concurrency, and partial correctness : proof theories for networks of processes and their relationship
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...
Uloženo v:
| Hlavní autor: | |
|---|---|
| Médium: | Livre numérique |
| Jazyk: | Anglais |
| Vydáno: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Edice: | Lecture notes in computer science
321 |
| Témata: | |
| On-line přístup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Poznámka: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Compositionality, concurrency, and partial correctness, proof theories for networks of processes and their relationship, J. Zwiers, Berlin, Springer-Verlag, 1989, 1 vol. (VI-272 p.), Lecture notes in computer science, 0-387-50845-7 • Compositionality, Concurrency, and Partial Correctness, Texte imprimé, 9783662183823 |
Obsah:
- The languages DNP and TNP
- The semantics for TNP
- Correctness formulae
- Proof systems for TNP
- Completeness
- The Hoare and Invariant systems.