Abstract
System validation involves assuring that a system satisfies its design specifications and operates to the satisfaction of its users. Validation activity is important during all design phases and may include testing of the final system implementation, simulation studies, analytical performance predictions, and verification. Verification is essentially a demonstration that a system meets its specifications. In software engineering, the aim of verification is “the establishment of the truth of the correspondence between a software product and its specification” (Boehm, 1979). It is also “the demonstration of correctness, completeness and consistency of the software at each stage of the development life cycle” (Adrion et al., 1982).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adrion, W., Branstad, M., and Cherniavsky, J. (1982), “Validation, Verification, and Testing of Computer Software,” Computing Surveys, Vol. 14, pp. 159–192.
Boehm, B. (1979), “Guidelines for Verifying and Validating Software Requirements and Design Specifications,” P.A. Samet (Ed.), EURO IFIP 79, pp. 711–719.
Berthelot, G., and Roucairol, G. (1976), “Reduction of Petri Nets,” Lecture Notes in Computer Science, Vol. 45, pp. 202–209.
Berthomieu, B., and Menasche, M. (1983), “An Enumerative Approach for Analyzing Time Petri Nets,” Information Processing’83, North-Holland.
Choi, T.Y., and Miller, R.E. (1983), “A Decomposition Method for the Analysis and Design of Finite State Protocols,” Proceedings of Data Communication Symposium, ACM SIGCOMM, pp. 167–176.
Chow, C., Gouda, M.G., and Lam, S.S. (1985), “A Discipline for Constructing Multiphase Communication Protocols,” ACM Transactions on Computer Systems, Vol. 3, No. 4, pp. 315–343.
Courcoubetis, C., Vardi, M., Wolper, P., and Yannakakis, M. (1990), “Memory Efficient Algorithms for the Verification of Temporal Properties,” Proceedings of the 2nd International Workshop on Computer Aided Verification, New Brunswick, NJ, USA, E.M. Clarke, R.P. Kurshan (Eds.), pp. 233–242.
Fernandez, J.-C., Mounier, L., Jard, C., and Jéron, T. (1992), “On-the-fly Verification of Finite Transition Systems,” Formal Methods in System Design, pp. 251–273.
Genrich, H. (1986), “Predicate/Transition Nets,” Lecture Notes in Computer Science, Springer-Verlag, Vol. 254.
Godefroid, P., and Wolper, P. (1991), “A Partial Approach to Model Checking,” Proceedings of the 6th IEEE Symposium on Logic in Computer Science, pp. 406-415.
Godefroid, P., Holzmann, G., and Pirottin, D. (1992), “State Space Caching Revisited,” Proceedings of the 4th International Workshop on Computer Aided Verification, Montreal, Canada, G.v. Bochmann, D.K. Probst (Eds.), pp. 178–191.
Godefroid, P., and Pirottin, D. (1993), “Refining Dependencies Improves Partial-Order Verification Methods,” Proceedings of the 5th International Conference of Computer Aided Verification, Costas Courcoubetis (Ed.), Lecture Notes in Computer Science, Vol. 697, pp. 438–449.
Gouda, M.G., and Yu, Y.T. (1984), “Protocol Validation by Maximal Progress State Exploration,” IEEE Transactions on Communications, Vol. COM-32, No. 1, pp. 94–97.
Gouda, M.G., and Yu, Y.T. (1985), “Protocol Validation by Fair Progress State Exploration,” Computer Networks and ISDN Systems, Vol. 9, pp. 353–361.
Holzmann, G.J. (1988), “An Improved Protocol Reachability Analysis Technique,” Software-Practice and Experience, Vol. 18, No. 2, pp. 137–161.
Holzmann, G.J. (1991), Design and Validation of Computer Protocols, Prentice-Hall.
Holzmann, G.J., Godefroid, P., and Pirottin, D. (1992), “Coverage Preserving Reduction Strategies for Reachability Analysis,” Protocol Specification, Testing and Verification, XIII, R.J. Linn, Jr., M.U. Uyar (Eds.), pp. 349–363.
Jensen, K. (1986), “Coloured Petri Nets,” Lecture Notes in Computer Science, Springer-Verlag, Vol. 254.
Janicki, R., and Koutny, M. (1991), “Optimal Simulations, Nets and Reachability Graphs,” Rozenberg, G. (Ed.), Advances in Petri Nets 1991, Lecture Notes in Computer Science 524, pp. 205–226.
Jard, C., and Jéron, T. (1991), “Bounded-memory Algorithms for Verification On-the-fly,” Proceedings of the 3rd International Workshop on Computer Aided Verification, Aalborg, Denmark, K.G. Larsen, A. Skou (Eds.), Lecture Notes in Computer Science 575, pp. 192–202.
Katz, S., and Peled, D. (1992), “Defining Conditional Independence Using Collapses,” Theoretical Computer Science, Vol. 101, pp. 331–359.
Lam, S.S., and Shankar, A.U. (1984), “Protocol Verification via Projections,” IEEE Transactions on Software Engineering, Vol. SE-10, No. 4, pp. 325–342.
Lin, F.J., and Liu, M.T. (1992), “Protocol Validation for Large-Scale Applications,” IEEE Software, pp. 23–26.
Merlin, P., and Faber, D. (1976), “Recoverability of Communication Protocols — Implications of a Theoretical Study,” IEEE Transactions on Computers, COM-24, pp. 1036–1043.
Overman, W.T. (1981), Verification of Concurrent Systems: Function and Timing, PhD thesis, University of California Los Angeles, Los Angeles CA.
Pehrson, B. (1989), “Protocol Verification for OSI,” Computer Networks and ISDN Systems, Vol. 18, pp. 185–201.
Peled, D. (1994), “Combining Partial Order Reductions with On-the-fly Model-Checking,” Proceedings of the 6th International Conference on Computer Aided Verification, Stanford, USA, June 1994.
Petri, C. (1962), Kommunikation mit Automaten, PhD Thesis, University of Bonn, Germany.
Reisig, W. (1985), Petri Nets: An Introduction, Springer-Verlag.
Rudin, J., and West, C.H. (1982), “An Improved Protocol Validation Technique,” Computer Networks, Vol. 6, pp. 65–74.
Sajkowski, M. (1985), “Protocol Verification Techniques: Status quo and Perspectives,” Protocol Specification, Testing, and Verification, IV, North-Holland.
Symons, F. (1980), “Introduction to Numerical Petri Nets, a General Graphical Model of Concurrent Processing Systems,” Australian Telecommunications Research Journal, vol. 14, no. 1, Telecom Australia Research Laboratories.
Valmari, A. (1993), “On-the-Fly Verification with Stubborn Sets,” Proceedings of the 5th International Conference on Computer-Aided Verification, Courcoubetis, C. (Ed.), Lecture Notes in Computer Science 697, pp. 397–408.
Varpaaniemi, K., and Rauhamaa, M. (1992), “The Stubborn Set Method in Practice,” Proceedings of the I3th International Conference on Application and Theory of Petri Nets, Jensen, K. (Ed.), Lecture Notes in Computer Science 616, pp. 389–393.
Varpaaniemi, K. (1994), “On Combining the Stubborn Set Method with the Sleep Set Method,” Proceedings of 15th International Conference on Application and Theory of Petri Nets, Zaragoza.
Vuong, S.T., and Cowan, D.D. (1982), “A Decomposition Method for the Validation of Structured Protocols,” Proceedings of IEEE INFOCOM, pp. 209–220.
Walter, B. (1983), “Timed Petri Nets for Modelling and Analysing Protocols with Real Time Characteristics,” Proceeding of Third International Workshop on Protocol Specification, Testing and Verification.
West, C.H. (1987), “Protocol Validation by Random State Exploration,” Protocol Specification, Testing and Verification, VI, B. Sarikaya and G.v. Bochmann (Eds.), pp. 233–242.
Wolper, P., and Godefroid, P. (1993), “Partial-Order Methods for Temporal Verification,” Proceedings of the 4th International Conference on Concurrency Theory, Lecture Notes in Computer Science 715.
Wolper, P., and Leroy, D. (1993), “Reliable Hashing without Collision Detection,” Proceedings of the 5th International Conference of Computer Aided Verification, Costas Courcoubetis (Ed.), Lecture Notes in Computer Science 697, pp. 59–70.
Yu, S.S., and Liu, M.T. (1991), “Using Heuristics to Guide Reachability Analysis,” Proceedings of the IEEE Singapore International Conference on Networks (SICON’91), pp. 226–231.
Zhao, J.R., and Bochmann, G.v. (1987), “Reduced Reachability Analysis of Communication Protocols: A New Approach,” Protocol Specification, Testing and Verification VI, B. Sarikaya and G.v. Bochmann (Eds.), pp. 243–254.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Lai, R., Jirachiefpattana, A. (1998). Protocol Verification. In: Communication Protocol Specification and Verification. The Springer International Series in Engineering and Computer Science, vol 464. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5549-0_6
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5549-0_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7537-1
Online ISBN: 978-1-4615-5549-0
eBook Packages: Springer Book Archive