Artículos relacionados a 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) - Tapa blanda
Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Comprar nuevo
Ver este artículo
EUR 53,49
EUR 11,99 gastos de envío desde Alemania a España
Destinos, gastos y plazos de envíoOtras ediciones populares con el mismo título
Resultados de la búsqueda para Compositionality, Concurrency, and Partial Correctness:...
Imagen de archivo
Compositionality, Concurrency, and Partial Correctness: Proof Theories for Networks of Processes, and Their Relationship
Publicado por
Springer-Verlag Berlin and Heidelberg GmbH & Co. K, 1989
ISBN 10: 3540508457
ISBN 13: 9783540508458
Antiguo o usado
Softcover
Librería: Ammareal, Morangis, Francia
Calificación del vendedor: 5 de 5 estrellas
Softcover. Condición: 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. Nº de ref. del artículo: E-597-487
Cantidad disponible: 1 disponibles
Imagen del vendedor
Compositionality, concurrency, and partial correctness : proof theories for networks of processes, and their relationship. J. Zwiers / Lecture notes in computer science ; Vol. 321
Publicado por
Berlin ; Heidelberg ; New York ; London ; Paris ; Tokyo : Springer, 1989
ISBN 10: 3540508457
ISBN 13: 9783540508458
Antiguo o usado
(Berlin
Librería: NEPO UG, Rüsselsheim am Main, Alemania
Calificación del vendedor: 5 de 5 estrellas
(Berlin. Condición: Gut. VI, 272 S. : graph. Darst. ; 25 cm Sprache: Deutsch Gewicht in Gramm: 969. Nº de ref. del artículo: 462464
Cantidad disponible: 1 disponibles
Imagen del vendedor
Compositionality, Concurrency, and Partial Correctness: Proof Theories for Networks of Processes, and Their Relationship (Lecture Notes in Computer Science)
Librería: NEPO UG, Rüsselsheim am Main, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: 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. Nº de ref. del artículo: 370903
Cantidad disponible: 1 disponibles
Imagen del vendedor
Compositionality, Concurrency, and Partial Correctness : Proof Theories for Networks of Processes, and Their Relationship
Publicado por
Springer Berlin Heidelberg, 1989
ISBN 10: 3540508457
ISBN 13: 9783540508458
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9783540508458
Cantidad disponible: 1 disponibles
Imagen de archivo
Compositionality, Concurrency, and Partial Correctness: Proof Theories for Networks of Processes, and Their Relationship (Lecture Notes in Computer Science, 321)
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9783540508458_new
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Compositionality, Concurrency, and Partial Correctness
Publicado por
Springer Berlin Heidelberg, 1989
ISBN 10: 3540508457
ISBN 13: 9783540508458
Nuevo
Tapa blanda
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: 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. Nº de ref. del artículo: 4891735
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Compositionality, Concurrency, and Partial Correctness: Proof Theories for Networks of Processes, and Their Relationship (Lecture Notes in Computer Science, 321)
Librería: California Books, Miami, FL, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: I-9783540508458
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Compositionality, Concurrency, and Partial Correctness: Proof Theories for Networks of Processes, and Their Relationship (Lecture Notes in Computer Science)
Librería: Chiron Media, Wallingford, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
Paperback. Condición: New. Nº de ref. del artículo: 6666-IUK-9783540508458
Cantidad disponible: 10 disponibles
Imagen de archivo
Compositionality, Concurrency, and Partial Correctness
Librería: Books Puddle, New York, NY, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Condición: New. pp. 284. Nº de ref. del artículo: 263103768
Cantidad disponible: 4 disponibles
Imagen del vendedor
Compositionality, Concurrency, and Partial Correctness
Publicado por
Springer Berlin Heidelberg Feb 1989, 1989
ISBN 10: 3540508457
ISBN 13: 9783540508458
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9783540508458
Cantidad disponible: 2 disponibles