Siirry suoraan sisältöön
Compositionality, Concurrency, and Partial Correctness
Tallenna

Compositionality, Concurrency, and Partial Correctness

The hierarchical decomposition of programs into smaller ones is generally considered imperative to master the complexity of large programs.
Alaotsikko
Proof Theories for Networks of Processes, and Their Relationship
Kirjailija
Job Zwiers
Painos
1989 ed.
ISBN
9783540508458
Kieli
englanti
Paino
310 grammaa
Julkaisupäivä
22.2.1989
Sivumäärä
276