Abstract
In the context of deductive proof, formal specification (and thus proofs) may only cover a small part of the program behaviours. We discuss the relevance of applying a mutation analysis, proposed to evaluate the quality of a test set, to evaluate if a specification is able to detect predefined types of faults.
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
Agrawal, H., Demillo, R., Hathaway, R., Hsu, W.M., Hsu, W., Krauser, E., Martin, R.J., Mathur, A., Spafford, E.: Design of Mutant Operators for the C Programming Language. Technical Report SERC-TR-41-P, Soft. Eng. Research Center, Dep. of Computer Science, Purdue Univ., Indiana (1989)
Ahrendt, W., Baar, T., Beckert, B., Bubel, R., Giese, M., Hähnle, R., Menzel, W., Mostowski, W., Roth, A., Schlager, S., Schmitt, P.H.: The KeY tool. Software and System Modeling 4, 32–54 (2005)
Andrews, J.H., Briand, L.C., Labiche, Y.: Is mutation an appropriate tool for testing experiments? In: 27th International Conference on Software Engineering (ICSE 2005), St. Louis, Missouri, USA, May 2005, pp. 402–411. ACM, New York (2005)
Budd, T.A.: Mutation analysis of program test data. Phd thesis, Yale University, New Haven, CT, USA (1980)
Burdy, L., Requet, A., Lanet, J.-L.: Java applet correctness: a developer-oriented approach. In: The 12th International FME Symposium, Pisa, Italy (September 2003)
DeMillo, R.A., Lipton, R.J., Sayward, F.G.: Hints on test data selection: Help for the practicing programmer. Computer 11(4), 34–41 (1978)
du Bousquet, L.: Feature interaction detection using testing and model-checking, experience report. In: Wing, J.M., Woodcock, J.C.P., Davies, J. (eds.) FM 1999. LNCS, vol. 1708, pp. 622–641. Springer, Heidelberg (1999)
du Bousquet, L., Ledru, Y., Maury, O., Oriat, C., Lanet, J.-L.: Reusing a JML specification dedicated to verification for testing, and vice-versa: case studies. Journal of Automatic Reasoning (2009) (to appear)
Evans, A.S.: Specifying and Verifying Concurrent Systems Using Z. In: Naftalin, M., Bertrán, M., Denvir, T. (eds.) FME 1994. LNCS, vol. 873. Springer, Heidelberg (1994)
Filliâtre, J.-C., Marché, C.: Multi-prover verification of c programs. In: Davies, J., Schulte, W., Barnett, M. (eds.) ICFEM 2004. LNCS, vol. 3308, pp. 15–29. Springer, Heidelberg (2004)
Filliâtre, J.-C., Marché, C.: The why/krakatoa/caduceus platform for deductive program verification. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 173–177. Springer, Heidelberg (2007)
Jia, Y., Harman, M.: An Analysis and Survey of the Development of Mutation Testing. Technical Report TR-09-06, CREST Centre, King’s College London, London, UK (2009)
Laleau, R., Ledru, Y., Bert, D., Bouquet, F., Lemoine, M., Dubois, C., Donzeau-Gouge, V., Vignes, S.: Using computer science modeling techniques for airport security certification. In: The 1st Int. Conf. on Research Challenges in Information Science (RCIS), pp. 61–72 (2007)
Lau, M.F., Yu, Y.T.: An extended fault class hierarchy for specification-based testing. ACM Trans. Softw. Eng. Methodol. 14(3), 247–276 (2005)
Lee, T.-C., Hsiung, P.-A.: Mutation coverage estimation for model checking. In: Wang, F. (ed.) ATVA 2004. LNCS, vol. 3299, pp. 354–368. Springer, Heidelberg (2004)
Myers, G.: The Art of Software Testing. Wiley-Interscience, Hoboken (1979)
Newborn, M.: Automated Theorem Proving: Theory and Practice. Springer, Heidelberg (2001)
Offutt, A.J., Pan, J.: Automatically detecting equivalent mutants and infeasible paths. Softw. Test., Verif. Reliab. 7(3), 165–192 (1997)
Rushby, J.M.: Theorem proving for verification. In: Cassez, F., Jard, C., Rozoy, B., Dermot, M. (eds.) MOVEP 2000. LNCS, vol. 2067, pp. 39–57. Springer, Heidelberg (2001)
Srivatanakul, T., Clark, J.A., Stepney, S., Polack, F.: Challenging formal specifications by mutation: a csp security example. In: The 10th Asia-Pacific Software Engineering Conference, USA, p. 340. IEEE, Los Alamitos (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
du Bousquet, L., Lévy, M. (2010). Proof Process Evaluation with Mutation Analysis. In: Fraser, G., Gargantini, A. (eds) Tests and Proofs. TAP 2010. Lecture Notes in Computer Science, vol 6143. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13977-2_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-13977-2_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13976-5
Online ISBN: 978-3-642-13977-2
eBook Packages: Computer ScienceComputer Science (R0)