Formal Methods for Distributed System Development

th The 20 anniversary of the IFIP WG6. 1 Joint International Conference on Fonna! Methods for Distributed Systems and Communication Protocols (FORTE XIII / PSTV XX) was celebrated by the year 2000 edition of the Conference, which was held for the first time in Italy, at Pisa, October 10-13, 2000. In devising the subtitle for this special edition --'Fonna! Methods Implementation Under Test' --we wanted to convey two main concepts that, in our opinion, are reflected in the contents of this book. First, the early, pioneering phases in the development of Formal Methods (FM's), with their conflicts between evangelistic and agnostic attitudes, with their over optimistic applications to toy examples and over-skeptical views about scalability to industrial cases, with their misconceptions and myths . . . , all this is essentially over. Many FM's have successfully reached their maturity, having been 'implemented' into concrete development practice: a number of papers in this book report about successful experiences in specifYing and verifYing real distributed systems and protocols. Second, one of the several myths about FM's - the fact that their adoption would eventually eliminate the need for testing - is still quite far from becoming a reality, and, again, this book indicates that testing theory and applications are still remarkably healthy. A total of 63 papers have been submitted to FORTEIPSTV 2000, out of which the Programme Committee has selected 22 for presentation at the Conference and inclusion in the Proceedings.

Klappentext

This book addresses Formal Methods (FMs) applicable to the specification, verification, implementation, and testing of complex distributed systems and communication protocols. The early, pioneering phases in the development of Formal Methods, with their conflicts between evangelistic and skeptical attitudes, are essentially over. Many Fms have reached maturity, and a number of papers in this book report on successful experiences in specifying and verifying real distributed systems and protocols. The main topics covered are: model checking theory and applications; verification and theorem proving; testing theory and applications; multicast protocol analysis and simulation; hardware specification, implementation, and testing; FMs for security. £/LIST£ Formal Methods for Distributed System Development compiles the proceedings of the Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XIII) and Protocol Specification, Testing, and Verification (PSTV XX), which was sponsored by the International Federation for Information Processing (IFIP) and held in Pisa, Italy, in October 2000. This volume is suitable as a secondary text for graduate-level courses on software engineering, distributed systems, and communications, and as a reference both for researchers and for industry practitioners.

Inhalt

1. Formal Verification of the TTP Group Membership Algorithm.- 2. Verification of a Sliding Window Protocol Using IOA and MONA.- 3. A Priori Verification of Reactive Systems.- 4. From Rule-based to Automata-based Testing.- 5. Integrated System Interoperability Testing with Applications to VOIP.- 6. On Test Derivation from Partial Specifications.- 7. Compositionality for Improving Model Checking.- 8. A Model Checking Method for Partially Symmetric Systems.- 9. Specification and Verification of Message Sequence Charts.- 10. A State-Exploration Technique for Spi-Calculus Testing Equivalence Verification.- 11. Verification of Consistency Protocols via Infinite-State Symbolic Model Checking.- 12. Systematic Performance Evaluation of Multipoint Protocols.- 13. Simulating Multicast Transport Protocols in Estelle.- 14. Generation of Realistic Signalling Traffic in an ISDN Load Test System using SDL User Models.- 15. Satisfaction up to Liveness.- 16. Testing IP Routing Protocols From Probabilistic Algorithms to a Software Tool.- 17. Verifying and Testing Asynchronous Circuits using LOTOS.- 18. Hardware implementation of Concurrent Periodic EFSM's.- 19. Modeling Distributed Embedded Systems in Multiclock ESTEREL.- 20. Compact Net Semantics for Process Algebras.- 21. A Concise Compositional Statecharts Semantics Definition.- 22 Implementing CCS in Maude.- 23. From Refutation to Verification.- 24. Process Algebraic Analysis of Cryptographic Protocols.- 25. A Logic of Belief and a Model Checking Algorithm for Security Protocols.