Formal Techniques for Networked and Distributed Systems – FORTE 2007: 27th IFIP WG 6.1 International Conference, Tallinn, Estonia, June 27-29, 2007. Proceedings

✍ Scribed by Susanne Graf, Sophie Quinton (auth.), John Derrick, Jüri Vain (eds.)

• Publisher: Springer-Verlag Berlin Heidelberg
• Year: 2007
• Tongue: English
• Leaves: 384
• Series: Lecture Notes in Computer Science 4574 : Programming and Software Engineering
• Edition: 1
• Category: Library

✦ Synopsis

These proceedings contain papers from the 27th FORTE conference. FORTE (Formal Techniques for Networked and Distributed Systems) is the joint int- national annual conference combining the former PSTV (Protocol Speci?cation Testing and Veri?cation) and former FORTE (Formal Description Techniques for Distributed Systems and Communication Protocols) conferences. The ?rst PSTV conference took place in 1981, and the ?rst FORTE took place in 1988. They were merged into one larger conference in 1996 and have run under the name of FORTE from 2001. The conference is a forum for presentation and d- cussion of the state of the art in theory, application, tools, and industrialization of formal methods. Over the years, FORTE has been held in numerous lo- tions, and this is re?ected by its recent history, with meetings in Pisa (Italy), Cheju Island(Korea),Houston(USA), Berlin(Germany),Madrid(Spain), Paris (France), Taiwan and now Tallinn, Estonia. FORTE was sponsored by Working Group 6.1 of Technical Committee 6 (TC6) of the InternationalFederation for Information Processing (IFIP). Indeed FORTE is one of the ?agship conferences of Working Group 6.1 (Architectures and Protocols for Distributed Systems), and covers many aspects of the main themes of WG6.1, namely, formal description techniques, open distributed s- tems, and quality of service. WG6.1 provided a Best Paper Award as well as funds to help student participation, and we are particularly grateful for this. The 27th FORTE conference was held during June 26–29, 2007, in Tallinn (Estonia), in the historical building of the Brotherhood of the Black Heads.

✦ Table of Contents

Front Matter....Pages -
Contracts for BIP: Hierarchical Interaction Models for Compositional Verification....Pages 1-18
Thread–Based Analysis of Sequence Diagrams....Pages 19-34
Recovering Repetitive Sub-functions from Observations....Pages 35-49
Specification of Timed EFSM Fault Models in SDL....Pages 50-65
Coordination Via Types in an Event-Based Framework....Pages 66-80
Exploring the Connection of Choreography and Orchestration with Exception Handling and Finalization/Compensation....Pages 81-96
Towards Modal Logic Formalization of Role-Based Access Control with Object Classes....Pages 97-111
State Isomorphism in Model Programs with Abstract Data Structures....Pages 112-127
Composition of Model Programs....Pages 128-142
New Bisimulation Semantics for Distributed Systems....Pages 143-159
Event Correlation with Boxed Pomsets....Pages 160-176
A Simple Positive Flows Computation Algorithm for a Large Subclass of Colored Nets....Pages 177-195
Improvements for the Symbolic Verification of Timed Automata....Pages 196-210
The DHCP Failover Protocol: A Formal Perspective....Pages 211-226
Verifying Erlang/OTP Components in μ CRL....Pages 227-246
Formal Analysis of Publish-Subscribe Systems by Probabilistic Timed Automata....Pages 247-262
Testing Distributed Systems Through Symbolic Model Checking....Pages 263-279
An Incremental and Modular Technique for Checking LTL∖X Properties of Petri Nets....Pages 280-295
Identifying Acceptable Common Proposals for Handling Inconsistent Software Requirements....Pages 296-308
Formalization of Network Quality-of-Service Requirements....Pages 309-324
Robustness in Interaction Systems....Pages 325-340
Transactional Reduction of Component Compositions....Pages 341-357
Specifying and Composing Interaction Protocols for Service-Oriented System Modelling....Pages 358-373
Back Matter....Pages -

✦ Subjects

Computer Communication Networks; Software Engineering; Logics and Meanings of Programs; Operating Systems