Skip Navigation

The Computer Journal 1991 34(4):350-357; doi:10.1093/comjnl/34.4.350
© 1991 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Khanna, S.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Logic Programming for Software Verification and Testing

S. Khanna *

Syracuse University, P.O. Box 574, Syracuse, NY 13210-0574, USA

We propose a methodology for using logic programming to software verification and testing. The methodology is based on logic programming applications for the formation of decision-to-decision graph, path predicate evaluation and symbolic evaluation of output variables. We elaborate on an efficient software verification scheme which utilizes multiple dynamic theories in logic, organized as a tree structure. A technique to represent the symbolic environments as viewpoints of theories in logic, and an algorithm to locate the valid viewpoint of the leaf theories is presented. An Algol-like language is used to present our approach.

Received June 1989. revised June 1990.

* Syracuse University, P.O. Box 574, Syracuse, NY 13210-0574, USA


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.