Cart
Free Shipping in Australia
Proud to be B-Corp

Formal Methods for Distributed System Development Tommaso Bolognesi

Formal Methods for Distributed System Development By Tommaso Bolognesi

Formal Methods for Distributed System Development by Tommaso Bolognesi


Summary

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.

Formal Methods for Distributed System Development Summary

Formal Methods for Distributed System Development: FORTE / PSTV 2000 IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XIII) and Protocol Specification, Testing and Verification (PSTV XX) October 10-13, 2000, Pisa, Italy by Tommaso Bolognesi

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.

Table of Contents

Contributors. Preface. Programme Committee and Referees. Acknowledgements. Part One: Verification and Theorem Proving. 1. Formal Verification of the TTP Group Membership Algorithm; H. Pfeifer. 2. Verification of a Sliding Window Protocol Using IOA and MONA; M.A. Smith, N. Klarlund. 3. A Priori Verification of Reactive Systems; M. Majster-Cederbaum, et al. Part Two: Test Generation. 4. From Rule-based to Automata-based Testing; K. Etessami, M. Yannakakis. 5. Integrated System Interoperability Testing with Applications to VOIP; N. Griffeth, et al. 6. On Test Derivation from Partial Specifications; A. Petrenko, N. Yevtushenko. Part Three: Model Checking - Theory. 7. Compositionality for Improving Model Checking; A. Santone. 8. A Model Checking Method for Partially Symmetric Systems; S. Haddad, et al. Part Four: Model Checking - Applications. 9. Specification and Verification of Message Sequence Charts; D. Peled. 10. A State-Exploration Technique for Spi-Calculus Testing Equivalence Verification; L. Durante, et al. 11. Verification of Consistency Protocols via Infinite-State Symbolic Model Checking; G. Delzanno. Part Five: Multicast Protocol Analysis and Simulation. 12. Systematic Performance Evaluation of Multipoint Protocols; A. Helmy, et al. 13. Simulating Multicast Transport Protocols in Estelle; J. Templemore-Finlayson, E. Borcoci. 14. Generation of Realistic Signalling Traffic in an ISDN Load Test System using SDL User Models; T. Steinert, G. Roessler. Part Six: Exhaustive and Probabilistic Testing. 15. Satisfaction up to Liveness; U. Ultes-Nitsche. 16. Testing IP Routing Protocols &endash; From Probabilistic Algorithms to a Software Tool; R. Hao, et al. Part Seven: Hardware Specification, Implementation and Testing. 17. Verifying and Testing Asynchronous Circuits using LOTOS; J. He, K.J. Turner. 18. Hardware implementation of Concurrent Periodic EFSM's; H. Katagiri, et al. 19. Modeling Distributed Embedded Systems in Multiclock ESTEREL; B. Rajan, R.K. Shyamasundar. Part Eight: Formal Semantics. 20. Compact Net Semantics for Process Algebras; M. Bernardo, et al. 21. A Concise Compositional Statecharts Semantics Definition; M. von der Beeck. 22. Implementing CCS in Maude; A. Verdejo, N. Marti-Oliet. Part Nine: Invited Papers on Verification and Security. 23. From Refutation to Verification; J. Rushby. 24. Process Algebraic Analysis of Cryptographic Protocols; M. Boreale, et al. 25. A Logic of Belief and a Model Checking Algorithm for Security Protocols; M. Benerecetti, et al.

Additional information

NLS9781475752649
9781475752649
1475752644
Formal Methods for Distributed System Development: FORTE / PSTV 2000 IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XIII) and Protocol Specification, Testing and Verification (PSTV XX) October 10-13, 2000, Pisa, Italy by Tommaso Bolognesi
New
Paperback
Springer-Verlag New York Inc.
2013-02-28
412
N/A
Book picture is for illustrative purposes only, actual binding, cover or edition may vary.
This is a new book - be the first to read this copy. With untouched pages and a perfect binding, your brand new copy is ready to be opened for the first time

Customer Reviews - Formal Methods for Distributed System Development