Formal Techniques for Distributed Systems: Joint 13th IFIP WG 6.1 International Conference, FMOODS 2011, and 30th IFIP WG 6.1 International Conference, FORTE 2011, Reykjavik, Island, June 6-9, 2011, ProceedingsRoberto Bruni, Juergen Dingel This book constitutes the refereed proceedings of the 13th IFIP WG 6.1 International Conference on Formal Methods for Open Object-Based Distributed Systems, FMOODS 2011, and the 31st IFIP WG 6.1 Formal Techniques for Networked and Distributed Systems, FORTE 2011, held in Reykjavik, Island, in June 2011, as one of the DisCoTec 2011 events. The 21 revised full papers presented together with one invited talk were carefully reviewed and selected from 65 submissions. The topics covered are formal verification, formal modeling and specification, run-time monitoring, and testing to address challenges in many different application areas, including dynamic and ad hoc networks, mobile and adaptive computation, reactive and timed systems, business processes, and distributed and concurrent systems and algorithms. |
Contents
| 1 | |
LinearTime and MayTesting in a Probabilistic Reactive Setting | 29 |
A ModelChecking Tool for Families of Services | 44 |
Partial Order Methods for Statistical Model Checking and Simulation | 59 |
Counterexample Generation for Markov Chains Using SMTBased Bounded Model Checking | 75 |
Adaptable Processes Extended Abstract | 90 |
A Framework for Verifying DataCentric Protocols | 106 |
Timed Refinement | 121 |
Global State Estimates for Distributed Systems | 198 |
A Process Calculus for Dynamic Networks | 213 |
On Asynchronous Session Semantics | 228 |
Towards Verification of the Pastry Protocol Using TLA+ | 244 |
Dynamic Soundness in ResourceConstrained Workflow Nets | 259 |
Verification Support for a MultiAPI Simulation Platform | 274 |
Ownership Types for the Join Calculus | 289 |
Contracts for Multiinstance UML Activities | 304 |
Galois Connections for Flow Algebras | 138 |
An Accurate Type System for Information Flow in Presence of Arrays | 153 |
Analysis of Deadlocks in Object Groups | 168 |
Monitoring Distributed Systems Using Knowledge | 183 |
Annotation Inference for Separation Logic Based Verifiers | 319 |
Analyzing BGP Instances in Maude | 334 |
| 349 | |
Other editions - View all
Common terms and phrases
abstract actions adaptable process algorithm analysis asynchronous automata behavior bisimulation calculus channel communication computation concurrent configuration consider counterexample d-trees deadlock defined Definition denote distributed system dynamic soundness encoding estimate example execution expression finite flow algebra formal formula function Galois connection given global type Heidelberg implementation initial input instance interactions Join calculus labelled labelled transition system language leaf sets Lemma LNCS model checking neighbors Netlog node nondeterminism operator output P₁ partial order reduction Petri Petri net preorder probabilistic process algebra process calculus program graph projection proof properties protocol queue rcwf-nets reachable refinement relation result router routing RPLTS rule Section semantics sequence server session types SimGrid simulation specification Springer subsystem Table Theorem token topology trace transition relation tree type system update v-PN variables vector clock verification