Issue No. 02 - March/April (1991 vol. 8)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/52.73749
<p>Automatic test-case generation from Prolog specifications encounters problems due to recursion, evaluable predicates, and term ordering. A metainterpreter that controls recursion by using a deterministic automaton to monitor its progress through the specification is presented. The automaton is also used to define which paths through the specification are to be used as test cases, so the metainterpreter can compare where it is, with where it needs to go. The efficacy of the approach in dealing with evaluable predicates and term ordering problems is also examined.</p>
automatic test-case, generation; Prolog-based specifications; recursion; evaluable predicates; term ordering; metainterpreter; deterministic automaton; test cases; deterministic automata; formal specification; program interpreters; program testing; PROLOG
R. Denney, "Test-Case Generation from Prolog-Based Specifications," in IEEE Software, vol. 8, no. , pp. 49-57, 1991.