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...
Gorde:
| Egile nagusia: | |
|---|---|
| Formatua: | Livre numérique |
| Hizkuntza: | Anglais |
| Argitaratua: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Saila: | Lecture notes in computer science
321 |
| Gaiak: | |
| Sarrera elektronikoa: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Oharra: |
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 |
| LEADER | 03769nam a22003977a 4500 | ||
|---|---|---|---|
| 001 | 945674 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155236881 | ||
| 020 | |a 9783540461012 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004.35 | ||
| 082 | |a 004 | ||
| 100 | 1 | |a Zwiers, Job, |d 19..- | |
| 245 | 1 | 0 | |a Compositionality, concurrency, and partial correctness : |b proof theories for networks of processes and their relationship |c J. Zwiers. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 321 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a The languages DNP and TNP -- The semantics for TNP -- Correctness formulae -- Proof systems for TNP -- Completeness -- The Hoare and Invariant systems. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 520 | |a 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. | ||
| 650 | |a Génie logiciel | ||
| 650 | |a Informatique | ||
| 650 | |a Langages de programmation | ||
| 650 | |a Parallélisme (informatique) | ||
| 650 | |a Théorèmes |x Démonstration automatique | ||
| 776 | 0 | |0 021031983 |t Compositionality, concurrency, and partial correctness |o proof theories for networks of processes and their relationship |f J. Zwiers |c Berlin |n Springer-Verlag |d 1989 |p 1 vol. (VI-272 p.) |s Lecture notes in computer science |z 0-387-50845-7 | |
| 776 | 0 | |t Compositionality, Concurrency, and Partial Correctness |b Texte imprimé |z 9783662183823 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/BFb0020836 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-3GT0G9F1-R |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747908524 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/BFb0020836 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:75092148X |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/BFb0020836 |z Accès INSA CVL | |
| 997 | |0 945674 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||