Abstract
{log} (pronounced ‘setlog’) is a Constraint Logic Programming language that embodies the fundamental forms of set designation and a number of primitive operations for set management. As such, it can find solutions of first-order logic formulas involving set-theoretic operators. The Test Template Framework (TTF) is a model-based testing method for the Z notation. In the TTF, test cases are generated from test specifications, which are predicates written in Z. In turn, the Z notation is based on first-order logic and set theory. In this paper we show how {log} can be applied as a test case generator for the TTF. According to our experiments, {log} produces promising results compared to other powerful constraint solvers supporting the Z notation, such as ProB.
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
Stocks, P., Carrington, D.: A Framework for Specification-Based Testing. IEEE Trans. on Software Engineering 22(11), 777–793 (1996)
Grieskamp, W., Gurevich, Y., Schulte, W., Veanes, M.: Generating finite state machines from abstract state machines. In: ISSTA 2002: Proc. 2002 ACM SIGSOFT Int’l Symp. on Software Testing and Analysis, pp. 112–122. ACM (2002)
Legeard, B., Peureux, F., Utting, M.: A Comparison of the BTT and TTF Test-Generation Methods. In: Bert, D., Bowen, J.P., Henson, M.C., Robinson, K. (eds.) ZB 2002. LNCS, vol. 2272, p. 309. Springer, Heidelberg (2002)
Bernot, G., Gaudel, M.C., Marre, B.: Software testing based on formal specifications: a theory and a tool. Softw. Eng. J. 6(6), 387–405 (1991)
Cristiá, M., Monetti, P.R.: Implementing and Applying the Stocks-Carrington Framework for Model-Based Testing. In: Breitman, K., Cavalcanti, A. (eds.) ICFEM 2009. LNCS, vol. 5885, pp. 167–185. Springer, Heidelberg (2009)
Cristiá, M., Albertengo, P., Rodríguez Monetti, P.: Pruning testing trees in the Test Template Framework by detecting mathematical contradictions. In: Fiadeiro, J.L., Gnesi, S. (eds.) SEFM, pp. 268–277. IEEE Computer Society (2010)
Cristiá, M., Albertengo, P., Frydman, C., Plüss, B., Monetti, P.R.: Tool support for the Test Template Framework. Software Testing, Verification and Reliability, n/a–n/a (2012), http://dx.doi.org/10.1002/stvr.1477
Cristiá, M., Frydman, C.S.: Extending the Test Template Framework to deal with axiomatic descriptions, quantifiers and set comprehensions. In: [27], pp. 280–293
Cristiá, M., Plüss, B.: Generating natural language descriptions of Z test cases. In: Kelleher, J.D., Namee, B.M., van der Sluis, I., Belz, A., Gatt, A., Koller, A. (eds.) INLG, pp. 173–177. The Association for Computer Linguistics (2010)
Cristia, M., Hollmann, D., Albertengo, P., Frydman, C., Monetti, P.R.: A language for test case refinement in the Test Template Framework. In: Qin, S., Qiu, Z. (eds.) ICFEM 2011. LNCS, vol. 6991, pp. 601–616. Springer, Heidelberg (2011)
Saaltink, M.: The Z/EVES mathematical toolkit version 2.2 for Z/EVES version 1.5. Technical report, ORA Canada (1997)
Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT modulo theories: From an abstract Davis–Putnam–Logemann–Loveland procedure to DPLL(T). J. ACM 53, 937–977 (2006)
Apt, K.R., Fages, F., Rossi, F., Szeredi, P., Váncza, J. (eds.): CSCLP 2003. LNCS (LNAI), vol. 3010. Springer, Heidelberg (2004)
Stuckey, P.J., Becket, R., Fischer, J.: Philosophy of the minizinc challenge. Constraints 15(3), 307–316 (2010)
Schulte, C., Carlsson, M.: Finite Domain Constraint Programming Systems. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming, pp. 493–524. Elsevier (2006)
Cristiá, M., Frydman, C.: Applying SMT solvers to the Test Template Framework. In: Petrenko, A.K., Schlingloff, H. (eds.) Proc. 7th Workshop on Model-Based Testing, Tallinn, Estonia, March 25. Electronic Proc. in Theoretical Computer Science, vol. 80, pp. 28–42. Open Publishing Association (2012)
Leuschel, M., Butler, M.: ProB: A model checker for B. In: Araki, K., Gnesi, S., Mandrioli, D. (eds.) FME 2003. LNCS, vol. 2805, pp. 855–874. Springer, Heidelberg (2003)
Dovier, A., Omodeo, E.G., Pontelli, E., Rossi, G.: A language for programming in logic with finite sets. J. Log. Program. 28(1), 1–44 (1996)
Dovier, A., Piazza, C., Pontelli, E., Rossi, G.: Sets and constraint logic programming. ACM Trans. Program. Lang. Syst. 22(5), 861–931 (2000)
Rossi, G.: {log}, http://people.math.unipr.it/gianfranco.rossi/setlog.Home.html (last access)
Dovier, A., Pontelli, E., Rossi, G.: Intensional sets in CLP. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol. 2916, pp. 284–299. Springer, Heidelberg (2003)
Palù, A.D., Dovier, A., Pontelli, E., Rossi, G.: Integrating finite domain constraints and clp with sets. In: PPDP, pp. 219–229. ACM (2003)
Cristiá, M., Rossi, G.: Translation of TTF test specifications into {log}, http://www.fceia.unr.edu.ar/~mcristia/publicaciones/encoding-ttf-setlog.pdf (last access: December 2012)
Saaltink, M.: The Z/EVES System. In: Till, D., Bowen, J.P., Hinchey, M.G. (eds.) ZUM 1997. LNCS, vol. 1212, pp. 72–85. Springer, Heidelberg (1997)
Déharbe, D., Fontaine, P., Guyot, Y., Voisin, L.: SMT solvers for Rodin. In: [27], pp. 194–207
Mentré, D., Marché, C., Filliâtre, J.C., Asuka, M.: Discharging proof obligations from Atelier B using multiple automated provers. In: [27], pp. 238–251
Derrick, J., Fitzgerald, J., Gnesi, S., Khurshid, S., Leuschel, M., Reeves, S., Riccobene, E. (eds.): ABZ 2012. LNCS, vol. 7316. Springer, Heidelberg (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cristiá, M., Rossi, G., Frydman, C. (2013). {log} as a Test Case Generator for the Test Template Framework. In: Hierons, R.M., Merayo, M.G., Bravetti, M. (eds) Software Engineering and Formal Methods. SEFM 2013. Lecture Notes in Computer Science, vol 8137. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40561-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-40561-7_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40560-0
Online ISBN: 978-3-642-40561-7
eBook Packages: Computer ScienceComputer Science (R0)