Book — 1 online resource (xiv, 243 pages) : illustrations Digital: text file.PDF.
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 Buchi automata for multi-valued model checking.- Privacy assessment using static taint analysis.- EPTL - a temporal logic for weakly consistent systems.
(source: Nielsen Book Data)
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 Neuchatel, 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. (source: Nielsen Book Data)