Abstract
The troubles due to defective programs are increasing significantly. This is mainly because: 1) the complexity of programs makes programmers difficult to prepare appropriate test data, and 2) the shorter development cycles make them difficult to take adequate time for verifying programs. To address these problems, this paper proposes a method that enables programmers to create test data efficiently and to delimit the area where inconformity exists. As a result of applying this method, we succeeded to cut off 44% of the verification time.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Lanin, V., Shasha,: A Symmetric Concurrent B-Tree Algorithm. In: Proc. 1986 Fall joint Computer Conference, IEEE, pp. 380–389 (1986)
Weiser, M.: Program slicing. In: Prc. 5t̂h International Conference Software Engineering, pp. 438–449 (1981)
Myers, G.J.: The Art of Software Testing. John Wiley & Sons, Chichester (1979)
Takahashi, M., Mizukoshi, N., Tsuda, K.: A Proposal for Verifica-tion Method of High Reliability Flight Software. In: Forum on Information Technology (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Takahashi, M., Mizukoshi, N., Tsuda, K. (2004). Efficient Program Verification Using Binary Trees and Program Slicing. In: Negoita, M.G., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2004. Lecture Notes in Computer Science(), vol 3213. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30132-5_69
Download citation
DOI: https://doi.org/10.1007/978-3-540-30132-5_69
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23318-3
Online ISBN: 978-3-540-30132-5
eBook Packages: Springer Book Archive