Verwandte Artikel zu Compositionality, Concurrency, and Partial Correctness:...
Compositionality, Concurrency, and Partial Correctness: Proof Theories for Networks of Processes, and Their Relationship: 321 (Lecture Notes in Computer Science) - Softcover
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Reseña del editor
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Gebraucht kaufen
Zustand: Gut bis sehr gutAncien livre de bibliothèque. Traces...
Diesen Artikel anzeigen
EUR 3,00
EUR 3,99 für den Versand von Frankreich nach Deutschland
Versandziele, Kosten & DauerNeu kaufen
Diesen Artikel anzeigen
EUR 48,37
Gratis für den Versand innerhalb von/der Deutschland
Versandziele, Kosten & DauerWeitere beliebte Ausgaben desselben Titels
Suchergebnisse für Compositionality, Concurrency, and Partial Correctness:...
Beispielbild für diese ISBN
Compositionality, Concurrency, and Partial Correctness: Proof Theories for Networks of Processes, and Their Relationship
Verlag:
Springer-Verlag Berlin and Heidelberg GmbH & Co. K, 1989
ISBN 10: 3540508457
ISBN 13: 9783540508458
Gebraucht
Softcover
Anbieter: Ammareal, Morangis, Frankreich
Verkäuferbewertung 5 von 5 Sternen
Softcover. Zustand: Bon. Ancien livre de bibliothèque. Traces d'usure sur la couverture. Edition 1989. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Good. Former library book. Signs of wear on the cover. Edition 1989. Ammareal gives back up to 15% of this item's net price to charity organizations. Bestandsnummer des Verkäufers E-597-487
Anzahl: 1 verfügbar
Foto des Verkäufers
Compositionality, Concurrency, and Partial Correctness: Proof Theories for Networks of Processes, and Their Relationship (Lecture Notes in Computer Science)
Anbieter: NEPO UG, Rüsselsheim am Main, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: Gut. Auflage: 1989. 284 Seiten ex Library Book / aus einer wissenschafltichen Bibliothek / Sprache: Englisch Gewicht in Gramm: 396 23,2 x 15,4 x 1,8 cm, Taschenbuch. Bestandsnummer des Verkäufers 370903
Anzahl: 1 verfügbar
Foto des Verkäufers
Compositionality, Concurrency, and Partial Correctness
Print-on-DemandAnbieter: moluna, Greven, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 prog. Bestandsnummer des Verkäufers 4891735
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Compositionality, Concurrency, and Partial Correctness
ISBN 10: 3540508457
ISBN 13: 9783540508458
Neu
Taschenbuch
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 284 pp. Englisch. Bestandsnummer des Verkäufers 9783540508458
Anzahl: 1 verfügbar
Foto des Verkäufers
Compositionality, Concurrency, and Partial Correctness : Proof Theories for Networks of Processes, and Their Relationship
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Bestandsnummer des Verkäufers 9783540508458
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Compositionality, Concurrency, and Partial Correctness: Proof Theories for Networks of Processes, and Their Relationship (Lecture Notes in Computer Science, 321)
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In. Bestandsnummer des Verkäufers ria9783540508458_new
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Compositionality, Concurrency, and Partial Correctness: Proof Theories for Networks of Processes, and Their Relationship (Lecture Notes in Computer Science)
Anbieter: Chiron Media, Wallingford, Vereinigtes Königreich
Verkäuferbewertung 4 von 5 Sternen
Paperback. Zustand: New. Bestandsnummer des Verkäufers 6666-IUK-9783540508458
Anzahl: 10 verfügbar
Beispielbild für diese ISBN
Compositionality, Concurrency, and Partial Correctness: Proof Theories for Networks of Processes, and Their Relationship (Lecture Notes in Computer Science, 321)
Anbieter: California Books, Miami, FL, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers I-9783540508458
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Compositionality, Concurrency, and Partial Correctness
Verlag:
Springer Berlin Heidelberg Feb 1989, 1989
ISBN 10: 3540508457
ISBN 13: 9783540508458
Neu
Taschenbuch
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 284 pp. Englisch. Bestandsnummer des Verkäufers 9783540508458
Anzahl: 2 verfügbar
Beispielbild für diese ISBN
Compositionality, Concurrency, and Partial Correctness
Print-on-DemandAnbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. PRINT ON DEMAND pp. 284. Bestandsnummer des Verkäufers 183103762
Anzahl: 4 verfügbar