26. FORTE 2006: Paris, France

Elie Najm, Jean-François Pradat-Peyre, Véronique Donzeau-Gouge (Eds.): Formal Techniques for Networked and Distributed Systems - FORTE 2006, 26th IFIP WG 6.1 International Conference, Paris, France, September 26-29, 2006. Lecture Notes in Computer Science 4229 Springer 2006, ISBN 3-540-46219-8

Invited Talks

Daniel Krob:
Modelling of Complex Software Systems: A Reasoned Overview. 1-22
Leslie Lamport:
The ⁺CAL Algorithm Language. 23
Martin Wirsing, Allan Clark, Stephen Gilmore, Matthias M. Hölzl, Alexander Knapp, Nora Koch, Andreas Schroeder:
Semantic-Based Development of Service-Oriented Systems. 24-45

Gian Luigi Ferrari, Roberto Guanciale, Daniele Strollo:
JSCL: A Middleware for Service Coordination. 46-60
Raman Kazhamiakin, Marco Pistore:
Analysis of Realizability Conditions for Web Service Choreographies. 61-76
I. S. W. B. Prasetya, Tanja E. J. Vos, S. Doaitse Swierstra:
Web Cube. 77-92
Zohair Chentouf, Ahmed Khoumsi:
Presence Interaction Management in SIP SOHO Architecture. 93-98

Avik Chaudhuri, Martín Abadi:
Formal Analysis of Dynamic, Distributed File-System Access Controls. 99-114
Tom Chothia:
Analysing the MUTE Anonymous File-Sharing System Using the Pi-Calculus. 115-130
Luciano Baresi, Carlo Ghezzi, Luca Mottola:
Towards Fine-Grained Automated Verification of Publish-Subscribe Architectures. 131-135
Nelson S. Rosa, Paulo Roberto Freire Cunha:
A LOTOS Framework for Middleware Specification. 136-142

Bernd Finkbeiner, Sven Schewe, Matthias Brill:
Automatic Synthesis of Assumptions for Compositional Model Checking. 143-158
Frédéric Lang:
Refined Interfaces for Compositional Verification. 159-174
Julien Bernet, David Janin:
On Distributed Program Specification and Synthesis in Architectures with Cycles. 175-190
Bassel Daou, Gregor von Bochmann:
Generalizing the Submodule Construction Techniques for Extended State Machine Models. 191-195

Radu Mardare, Corrado Priami:
Decidable Extensions of Hennessy-Milner Logic. 196-211

Christel Baier, Nathalie Bertrand, Ph. Schnoebelen:
Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness. 212-227
Pierre Rousseau:
A New Approach for Concurrent Program Slicing. 228-242
Daniela Colangelo, Daniele Compare, Paola Inverardi, Patrizio Pelliccione:
Reducing Software Architecture Models Complexity: A Slicing and Abstraction Approach. 243-258

Youcef Hammal:
Branching Time Semantics for UML 2.0 Sequence Diagrams. 259-274
Humberto Nicolás Castejón Martínez, Rolv Bræk:
Formalizing Collaboration Goal Sequences for Service Choreography. 275-291
Rabeb Mizouni, Aziz Salah, Siamak Kolahi, Rachida Dssouli:
Composition of Use Cases Using Synchronization and Model Checking. 292-306

Lom Hillah, Fabrice Kordon, Laure Petrucci-Dauchy, Nicolas Trèves:
PN Standardisation: A Survey. 307-322
Juan-Pablo López-Grao, José Manuel Colom:
Resource Allocation Systems: Some Complexity Results on the S⁴PR Class. 323-338
Fabrice Kordon, Alban Linard, Emmanuel Paviot-Adet:
Optimized Colored Nets Unfolding. 339-355

Yi Fang, Kenneth L. McMillan, Amir Pnueli, Lenore D. Zuck:
Liveness by Invisible Invariants. 356-371

Mercedes G. Merayo, Manuel Núñez, Ismael Rodríguez:
Extending EFSMs to Specify and Test Timed Systems with Action Durations and Timeouts. 372-387
Xuandong Li, Lei Bu, Jun Hu, Jianhua Zhao, Tao Zhang, Guoliang Zheng:
Scenario-Based Timing Consistency Checking for Time Petri Nets. 388-403
Tarek Sadani, Marc Boyer, Pierre de Saqui-Sannes, Jean-Pierre Courtiat:
Effective Representation of RT-LOTOS Terms by Finite Time Petri Nets. 404-419

Edith Elkind, Blaise Genest, Doron Peled, Hongyang Qu:
Grey-Box Checking. 420-435
Keqin Li, Roland Groz, Muzammil Shahbaz:
Integration Testing of Distributed Components Based on Learning Parameterized I/O Models. 436-450
Guy-Vincent Jourdan, Hasan Ural, Hüsnü Yenigün:
Minimizing Coordination Channels in Distributed Testing. 451-466
Luis Fernando Llana Díaz, Manuel Núñez, Ismael Rodríguez:
Derivation of a Suitable Finite Test Suite for Customized Probabilistic Systems. 467-483