Cantitate/Preț
Produs

Formal Techniques for Distributed Objects, Components, and Systems: 37th IFIP WG 6.1 International Conference, FORTE 2017, Held as Part of the 12th International Federated Conference on Distributed Computing Techniques, DisCoTec 2017, Neuchâtel, Switzerland, June 19-22, 2017, Proceedings: Lecture Notes in Computer Science, cartea 10321

Editat de Ahmed Bouajjani, Alexandra Silva
en Limba Engleză Paperback – 28 mai 2017
This book constitutes the proceedings of the 37th IFIP WG 6.1 International Conference on Formal Techniques for Distributed Objects, Components, and Systems, FORTE 2017, held in Neuchâtel, Switzerland, in June 2017, as part of the 12th International Federated Conference on Distributed Computing Techniques, DisCoTec 2017. The 13 revised full papers presented together with 3 short and 1 tool papers were carefully reviewed and selected from 30 submissions. The papers present a wide range of topics on distributed computing models and formal specification, testing, and verification methods.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33056 lei

Preț vechi: 41321 lei
-20% Nou

Puncte Express: 496

Preț estimativ în valută:
6326 6554$ 5280£

Carte tipărită la comandă

Livrare economică 22 martie-05 aprilie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319602240
ISBN-10: 3319602241
Pagini: 243
Ilustrații: XIV, 243 p. 50 illus.
Dimensiuni: 155 x 235 mm
Greutate: 0.37 kg
Ediția:1st ed. 2017
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Programming and Software Engineering

Locul publicării:Cham, Switzerland

Cuprins

Session types for Link failures.- Learning-based compositional parameter synthesis for event-recording automata.- Modularising opacity verification for Hybrid Transactional Memory.- Proving opacity via linearizability: a sound and complete method.- On futures for streaming data in ABS.- Session-based concurrency, reactively.- Procedural choreographic programming.- An observational approach to defining linearizability on weak memory models.- Applying a dependency mechanism in the formal development of voting protocol models using event-B.- Weak simulation quasimetric in a gossip scenario.- Reasoning about distributed secrets.- Classical higher-order processes.- Weak nominal modal logic.- Type inference of simulink hierarchical block diagrams in Isabelle.- Creating Büchi automata for multi-valued model checking.- Privacy assessment using static taint analysis.- EPTL - a temporal logic for weakly consistent systems.

Caracteristici

Includes supplementary material: sn.pub/extras