Abstract
Even though verifying systems during any phase of the development process is a remarkable advantage of using formal techniques, in software engineering practice the great computing resources needed to verify medium-large and large systems entails an efficiency problem in incremental life-cycles, where each iteration implies identifying new requirements, verifying them and, in many cases, modifying the current release of the system to satisfy the new functional specifications. In order to improve the consistency checking process in this kind of life-cycles, we propose reusing formal verification information – previously obtained by a model checking algorithm – to reduce the amount of verifications. This proposal is supported by ARIFS methodology (Approximate Retrieval of Incomplete and Formal Specifications) which provides a classification mechanism and an approximate and efficient retrieval one (without formal proofs) to recover the verification information linked to formal and incomplete functional specifications.
Partially supported by PGIDT01PX132203PR project (Xunta de Galicia)
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
Alpern, B., Schneider, F.B.: Recognizing Safety and Liveness. Distributed Computing Journal 2, 117–126 (1987)
Broy, M.: Formal description techniques - how formal and descriptive are they? In: Gotzhein, R., Bredereke, J. (eds.) Formal Description Tecniques IX. Theory, application and tools, International Federation for Information Processing (IFIP), pp. 95–110. Chapman & Hill, Boca Raton (1996)
Bryant, R.: Graph-based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers 35(8), 677–691 (1986)
Cheng, B.H.C., Jeng, J.J.: Reusing Analogous Components. IEEE Trans. on Knowledge and Data Engineering 9(2) (March 1997)
Clarke, E., Long, D., McMillan, K.: Compositional model checking. In: Proceedings of the Fourth Annual Symposium on Logic in computer science, pp. 353–362. IEEE Press, Los Alamitos (1989)
Redondo, R.P.D.: Reutilización de Requisitos Funcionales de Sistemas Distribuidos utilizando Técnicas de Descripción Formal. PhD thesis, Departamento de Enxeería Telemática - Universidade de Vigo (2002)
Redondo, R.P.D., Arias, J.J.P.: Reuse of Verification Efforts and Incomplete Specifications in a Formalized, Iterative and Incremental Software Process. In: Proceedings of International Conference on Software Engineering (ICSE) Doctoral Symposium, Toronto (May 2001)
Redondo, R.P.D., Arias, J.J.P., Vilas, A.F., Martínez, B.B.: Approximate Retrieval of Incomplete and Formal Specifications applied to Horizontal Reuse. In: Proc. of the 28th Euromicro Conf. Componentbased Software Engineering (September 2002)
Redondo, R.P.D., Arias, J.J.P., Vilas, A.F., Martínez, B.B.: Approximate Retrieval of Incomplete and Formal Specifications applied to Vertical Reuse. In: Proc. of International Conference on Software Maintenance (October 2002)
Redondo, R.P.D., Arias, J.J.P., Vilas, A.F., Martínez, B.B.: ARIFS: an Environment for Incomplete and Formal Specifications Reuse. In: Proc. of Workshop on Formal Methods and Component Interaction. Electronic Notes in Theoretical Computer Science, vol. 66, Elsevier Science, Amsterdam (2002)
Holzmann, G.J.: Tracing Protocols. ATT Technical Journal 64(12), 2413–2434 (1985)
Holzmann, G.J.: An Improved Protocol Reachability Analysis Technique. Soft ware- Practice and Experience 18(2):137–161 (1988)
ISO. Information Processing Systems – Open Systems Interconnection – LOTOS – A Formal Description Technique Based on an Extended State Transition Model. ISO/IEC/8807, International Standards Organization (1989)
Keidar, I., Khazan, R., Lynch, N., Shvartsman, A.: An Inheritance-Based Technique for Building Simulation Proofs Incrementally. In: 22nd International Conference on Software Engineering (ICSE), Limerik, Ireland, June 2000, pp. 478–487 (2000)
Kurshan, R., Levin, V., Minea, M., Peled, D., Yenign, H.: Static Partial Order Reduction. In: Wu, X., Kotagiri, R., Korb, K.B. (eds.) PAKDD 1998. LNCS, vol. 1394, pp. 345–357. Springer, Heidelberg (1998)
Lam, W., McDermid, J.A., Vickers, A.J.: Ten Steps Towards Systematic Requirements Reuse. Requirements Engineering Journal 2, 102–113 (1997)
McMillan, K.L.: A Technique of State Space Search based on Unfolding. Formal Methods in System Design 6, 45–65 (1995)
Pazos-Arias, J.J., García-Duque, J.: SCTL-MUS: A Formal Methodology for Software Development of Distributed Systems. A Case Study. Formal Aspects of Computing 13, 50–91 (2001)
Penix, J., Alexander, P.: Efficient Specification-Based Component Retrieval. Automated Software Engineering: An International Journal 6(2), 139–170 (1999)
Prieto-Díaz, R.: Software Reuse: Issues and Experiences. American Programer 6(8), 10–18 (1993)
Schumann, J., Fischer: NORA/HAMMR: Making Deduction-Based Software Component Retrieval Practical. In: Proc. of the 12th International Conference Automated Software Engineering, November 1997, pp. 246–254 (1997)
van Glabeek, R.J.: The Linear Time - Branching Time Spectrum I: The Semantics of Concrete, Sequential Processes. In: Handbook of Process Algebra. Elsevier Science, Amsterdam (2001)
Zaremski, A.M., Wing, J.M.: Specification Matching of Software Components. ACM Transactions on Software Engineering and Methodology 6(4), 333–369 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Díaz-Redondo, R.P., Pazos-Arias, J.J., Fernández-Vilas, A. (2003). Reuse of Formal Verification Efforts of Incomplete Models at the Requirements Specification Stage. In: Cechich, A., Piattini, M., Vallecillo, A. (eds) Component-Based Software Quality. Lecture Notes in Computer Science, vol 2693. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45064-1_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-45064-1_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40503-0
Online ISBN: 978-3-540-45064-1
eBook Packages: Springer Book Archive