Introduction to logic programming
Introduction to logic programming
Abstraction and specification in program development
Abstraction and specification in program development
Application of PROLOG to test sets generation from algebraic specifications
Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT) on Formal Methods and Software, Vol.2: Colloquium on Software Engineering (CSE)
Efficient loop detection in Prolog using the tortoise-and-hare technique
Journal of Logic Programming
On determining the causes of nonunifiability
Journal of Logic Programming
TAV3 Proceedings of the ACM SIGSOFT '89 third symposium on Software testing, analysis, and verification
Mockingbird: a logical methodology for testing
Journal of Logic Programming - Logic programming applications
Implementation-based analysis and testing of Prolog programs
ISSTA '93 Proceedings of the 1993 ACM SIGSOFT international symposium on Software testing and analysis
Test case generation by means of learning techniques
SIGSOFT '93 Proceedings of the 1st ACM SIGSOFT symposium on Foundations of software engineering
Testing by means of inductive program learning
ACM Transactions on Software Engineering and Methodology (TOSEM)
Software unit test coverage and adequacy
ACM Computing Surveys (CSUR)
Probe: a formal specification-based testing system
ICIS '99 Proceedings of the 20th international conference on Information Systems
ConData: A Tool for Automating Specification-Based Test Case Generation for Communication Systems
Software Quality Control
Test case generation for specification-based software testing
CASCON '94 Proceedings of the 1994 conference of the Centre for Advanced Studies on Collaborative research
Model based testing in incremental system development
Journal of Systems and Software - Special issue: Rapid system prototyping
Testing software modelling tools using data mutation
Proceedings of the 2006 international workshop on Automation of software test
Software testing: a graph theoretic approach
International Journal of Information and Communication Technology
| Hi-index | 0.00 |
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.