Abstract
Verification of operating procedures by model checking has been discussed in [11], [12]. As an execution of a procedure may affect or be affected by many processes, a model of the procedure with its related processes could be very large. We modify the procedure verification approach [11], [12] by introducing two strategies that make use of detail knowledge of procedures in order to reduce the complexity of model checking. A case study demonstrates the potential advantages of the strategies and shows that the strategies may improve the efficiency of procedure verification significantly and therefore scale up the applicability of the verification approach.
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
S. Berezin and S. Campos and E. M. Clarke. Compositional Reasoning in Model Checking. Proceedings of COMPOS’97. Lecture Notes in Computer Science 1536: 81–102. 1998.
E.M. Clarke, O. Grumberg and D.E. Long. Model Checking and Abstraction. ACM Transactions on Programming Languages and Systems 16(5): 1512–1542, 1994.
E.A. Emerson. Temporal and Modal Logic. Handbook of Theoretical Computer Science (B):997–1072. 1990.
J. Gregoire. Verification Model Reduction through Abstraction. Formal Design Techniques VII, 280–282, 1995.
G. J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, New Jersey, 1991.
G. J. Holzmann. The model checker Spin. IEEE Transactions on Software Engineering 23(5): 279–295. May 1997.
J.G. Kemeny. Report of the President’s Commission on the Accident at Three Mile Island. U. S. Government Accounting Office. 1979.
N.G. Leveson. Software System Safety and Computers. Addison-Wesley Publishing Company. 1995.
C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani and S. Bensalem. Property preserving abstractions for the verification of concurrent systems. Journal of Formal methods in System Design 6:1–35. 1995.
V. Roy and R. de Simone. Auto/Autograph. In Computer Aided Verification. DIMACS series in Discrete Mathematics and Theoretical Computer Science 3: 235–250, June 1990.
W. Zhang. Model checking operator procedures. Lecture Notes in Computer Science 1680:200–215. SPIN 1999. Toulouse, France.
W. Zhang. Validation of control system specifications with abstract plant models. Lecture Notes in Computer Science 1943:53–62. SAFECOMP 2000. Rotterdam, The Netherlands.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, W. (2002). A Strategy for Improving the Efficiency of Procedure Verification. In: Anderson, S., Felici, M., Bologna, S. (eds) Computer Safety, Reliability and Security. SAFECOMP 2002. Lecture Notes in Computer Science, vol 2434. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45732-1_13
Download citation
DOI: https://doi.org/10.1007/3-540-45732-1_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44157-1
Online ISBN: 978-3-540-45732-9
eBook Packages: Springer Book Archive