Cover Image

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

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...

Full description

Corporate Author: SpringerLink (Online service)
Other Authors: Derrick, John. (Editor, http://id.loc.gov/vocabulary/relators/edt), Vain, Jüri. (Editor, http://id.loc.gov/vocabulary/relators/edt)
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2007.
Edition:1st ed. 2007.
Series:Programming and Software Engineering ; 4574
Subjects:
Computer communication systems.
Software engineering.
Computer logic.
Operating systems (Computers).
Computer Communication Networks.
Software Engineering.
Logics and Meanings of Programs.
Operating Systems.
Online Access:https://doi.org/10.1007/978-3-540-73196-2
Table of Contents:
  • Invited Talk
  • Contracts for BIP: Hierarchical Interaction Models for Compositional Verification
  • Technical Session 1. Message Sequence Charts and SDL
  • Thread–Based Analysis of Sequence Diagrams
  • Recovering Repetitive Sub-functions from Observations
  • Specification of Timed EFSM Fault Models in SDL
  • Technical Session 2. Concurrency
  • Coordination Via Types in an Event-Based Framework
  • Exploring the Connection of Choreography and Orchestration with Exception Handling and Finalization/Compensation
  • Towards Modal Logic Formalization of Role-Based Access Control with Object Classes
  • Technical Session 3. Model Programs
  • State Isomorphism in Model Programs with Abstract Data Structures
  • Composition of Model Programs
  • Technical Session 4. Theory
  • New Bisimulation Semantics for Distributed Systems
  • Event Correlation with Boxed Pomsets
  • A Simple Positive Flows Computation Algorithm for a Large Subclass of Colored Nets
  • Technical Session 5. Verification
  • Improvements for the Symbolic Verification of Timed Automata
  • The DHCP Failover Protocol: A Formal Perspective
  • Verifying Erlang/OTP Components in ?CRL
  • Technical Session 6. Model Checking
  • Formal Analysis of Publish-Subscribe Systems by Probabilistic Timed Automata
  • Testing Distributed Systems Through Symbolic Model Checking
  • An Incremental and Modular Technique for Checking LTL?X Properties of Petri Nets
  • Technical Session 7. Requirements and QoS
  • Identifying Acceptable Common Proposals for Handling Inconsistent Software Requirements
  • Formalization of Network Quality-of-Service Requirements
  • Technical Session 8. Components
  • Robustness in Interaction Systems
  • Transactional Reduction of Component Compositions
  • Specifying and Composing Interaction Protocols for Service-Oriented System Modelling.

Similar Items