Abstract
This article discusses the relations between the step-wise development through refinement and the design of test-cases. It turns out that a commuting diagram inspired by the V-process model is able to clarify the issues involved. This V-diagram defines the dependencies of specifications, implementations and test-cases in the category of contracts. The objects in this category are contracts defined in the formalism of the refinement calculus. The maps are the refinement steps between these objects. Our framework is able to define the correctness notion of test-cases, testing strategies as refinement rules, and which test-cases should be added under refinement.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aichernig, B.K.: Systematic Black-Box Testing of Computer-Based Systems through Formal Abstraction Techniques. PhD thesis, Institute for Software Technology, TU Graz, Austria, Supervisor: Peter Lucas (January 2001)
Aichernig, B.K.: Test-case calculation through abstraction. In: Oliveira, J.N., Zave, P. (eds.) FME 2001. LNCS, vol. 2021, pp. 571–589. Springer, Heidelberg (2001)
Aichernig, B.K.: Test-Design through Abstraction: a Systematic Approach Based on the Refinement Calculus. Journal of Universal Computer Science 7(8), 710–735 (2001)
Aichernig, B.K.: Contract-based mutation testing in the refinement calculus. In: REFINE 2002, the British Computer Society - Formal Aspects of Computing refinement workshop, Copenhagen, Denmark, July 20-21 (2002), affiliated with FME 2002 (2002)
Back, R., Mikhajlova, A., von Wright, J.: Reasoning about interactive systems. In: Woodcock, J.C.P., Davies, J., Wing, J.M. (eds.) FM 1999. LNCS, vol. 1709, pp. 1460–1476. Springer, Heidelberg (1999)
Back, R.-J., von Wright, J.: Refinement Calculus, a Systematic Introduction. Graduate Texts in Computer Science. Springer, Heidelberg (1998)
Derrick, J., Boiten, E.: Testing refinements of state-based formal specifications. Software Testing, Verification and Reliability 9, 27–50 (1999)
Hoare, T.: Towards the Verifying Compiler. In: The United Nations University/ International Institute for Software Technology 10th Anniversary Colloquium: Formal Methods at the Crossroads, from Panacea to Foundational Support, Lisbon, March 18–21, 2002, Springer, Heidelberg (2003) (to be published)
William Lawvere, F., Schanuel, S.H.: Conceptual Mathematics: a First Introduction to Categories. Cambridge University Press, Cambridge (1997)
Morgan, C.: Programming from Specifications., 2nd edn. Series in Computer Science. Prentice-Hall International, Englewood Cliffs (1994)
Pahl, C.: Interference Analysis for Dependable Systems using Refinement and Abstraction. In: Eriksson, L.-H., Lindsay, P.A. (eds.) FME 2002. LNCS, vol. 2391, p. 330. Springer, Heidelberg (2002)
Stepney, S.: Testing as abstraction. In: Bowen, J.P., Hinchey, M.G. (eds.) ZUM 1995. LNCS, vol. 967, pp. 137–151. Springer, Heidelberg (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aichernig, B.K. (2003). The Commuting V-Diagram. In: Baaz, M., Makowsky, J.A. (eds) Computer Science Logic. CSL 2003. Lecture Notes in Computer Science, vol 2803. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45220-1_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-45220-1_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40801-7
Online ISBN: 978-3-540-45220-1
eBook Packages: Springer Book Archive