+612 9045 4394
 
CHECKOUT
$7.95 Delivery per order to Australia and New Zealand
100% Australian owned
Over a hundred thousand in-stock titles ready to ship
Formal Techniques for Networked and Distributed Systems - Forte 2006 : 26th Ifip Wg 6.1 International Conference, Paris, France, September 26-29, 2006, Proceedings - Elie Najm

Formal Techniques for Networked and Distributed Systems - Forte 2006

26th Ifip Wg 6.1 International Conference, Paris, France, September 26-29, 2006, Proceedings

Paperback Published: 1st November 2006
ISBN: 9783540462194
Number Of Pages: 488

Share This Book:

Paperback

$181.29
or 4 easy payments of $45.32 with Learn more
Ships in 15 business days

Earn 363 Qantas Points
on this Book

This book constitutes the refereed proceedings of the 26th IFIP WG 6.1 International Conference on Formal Techniques for Networked and Distributed Systems, FORTE 2006, held in Paris, France, in September 2006. The 26 revised full papers and 4 short papers presented together with 3 invited lectures were carefully reviewed and selected from 177 submissions. The papers focus on the construction of middleware and services using formalised and verified approaches.

Modelling of complex software systems : a reasoned overviewp. 1
The [superscript +]CAL algorithm languagep. 23
Semantic-based development of service-oriented systemsp. 24
JSCL : a middleware for service coordinationp. 46
Analysis of realizability conditions for Web service choreographiesp. 61
Web cubep. 77
Presence interaction management in SIP SOHO architecturep. 93
Formal analysis of dynamic, distributed file-system access controlsp. 99
Analysing the MUTE anonymous file-sharing system using the Pi-calculusp. 115
Towards fine-grained automated verification of publish-subscribe architecturesp. 131
A LOTOS framework for middleware specificationp. 136
Automatic synthesis of assumptions for compositional model checkingp. 143
Refined interfaces for compositional verificationp. 159
On distributed program specification and synthesis in architectures with cyclesp. 175
Generalizing the submodule construction techniques for extended state machine modelsp. 191
Decidable extensions of Hennessy-Milner logicp. 196
Symbolic verification of communicating systems with probabilistic message losses : liveness and fairnessp. 212
A new approach for concurrent program slicingp. 228
Reducing software architecture models complexity : a slicing and abstraction approachp. 243
Branching time semantics for UML 2.0 sequence diagramsp. 259
Formalizing collaboration goal sequences for service choreographyp. 275
Composition of use cases using synchronization and model checkingp. 292
PN standardisation : a surveyp. 307
Resource allocation systems : some complexity results on the S[superscript 4]PR classp. 323
Optimized colored nets unfoldingp. 339
Liveness by invisible invariantsp. 356
Extending EFSMs to specify and test timed systems with action durations and timeoutsp. 372
Scenario-based timing consistency checking for time petri netsp. 388
Effective representation of RT-LOTOS terms by finite time petri netsp. 404
Grey-box checkingp. 420
Integration testing of distributed components based on learning parameterized I/O modelsp. 436
Minimizing coordination channels in distributed testingp. 451
Derivation of a suitable finite test suite for customized probabilistic systemsp. 467
Table of Contents provided by Blackwell. All Rights Reserved.

ISBN: 9783540462194
ISBN-10: 3540462198
Series: Lecture Notes in Computer Science
Audience: General
Format: Paperback
Language: English
Number Of Pages: 488
Published: 1st November 2006
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.7 x 15.67  x 2.85
Weight (kg): 0.73

Earn 363 Qantas Points
on this Book