{log} as a test case generator for the test template framework

22Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

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. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Cristiá, M., Rossi, G., & Frydman, C. (2013). {log} as a test case generator for the test template framework. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8137 LNCS, pp. 229–243). https://doi.org/10.1007/978-3-642-40561-7_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free