Compositionality, Concurrency, and Partial Correctness: Proof Theories for Networks of Processes, and Their Relationship - Lecture Notes in Computer Science - Zwiers, Job (University of Twente, Enschede, the Netherlands) - Grāmatas - Springer-Verlag Berlin and Heidelberg Gm - 9783540508458 - 1989. gada 22. februāris
Ja vāks un nosaukums nesakrīt, pareizs ir nosaukums

Zwiers, Job (University of Twente, Enschede, the Netherlands)
Compositionality, Concurrency, and Partial Correctness: Proof Theories for Networks of Processes, and Their Relationship - Lecture Notes in Computer Science 1989 edition

Cena
€ 53,99

Pasūtīts no attālās noliktavas

Paredzamā piegāde . gada 20. - 30. nov.
Ziemassvētku dāvanas var atgriezt līdz 31. janvārim
Saņemiet paziņojumus par jauniem Zwiers, Job (University of Twente, Enschede, the Netherlands) izdevumiem

Mūsu klienti saka:

14 dienu atgriešanas politika saskaņā ar Eiropas patērētāju tiesību aizsardzības likumu
Top vieta Trustpilot
Pievienot savam iMusic vēlmju sarakstam

Not rated yet

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.

276 pages, biography

Mediji Grāmatas     Paperback Book   (Grāmata ar mīksto vāku un līmēto muguru)
Izlaists 1989. gada 22. februāris
ISBN13 9783540508458
Izdevēji Springer-Verlag Berlin and Heidelberg Gm
Lapas 276
Izmēri 156 × 234 × 15 mm   ·   399 g
Valoda Angļu  

Vairāk no tā paša izdevēja

Skatīt visus Zwiers, Job (University of Twente, Enschede, the Netherlands)