This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Test-Case Generation from Prolog-Based Specifications
March/April 1991 (vol. 8 no. 2)
pp. 49-57

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.

Index Terms:
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
Citation:
Richard Denney, "Test-Case Generation from Prolog-Based Specifications," IEEE Software, vol. 8, no. 2, pp. 49-57, March-April 1991, doi:10.1109/52.73749
Usage of this product signifies your acceptance of the Terms of Use.