Cart (Loading....) | Create Account
Close category search window

Test-case generation from Prolog-based specifications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Denney, R. ; Schlumberger Well Services, Austin, TX, USA

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.<>

Published in:

Software, IEEE  (Volume:8 ,  Issue: 2 )

Date of Publication:

March 1991

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.