NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.
Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.
An official website of the United States government
Here’s how you know
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
Pseudo-exhaustive Verification of Rule Based Systems
Published
Author(s)
David R. Kuhn, Dylan J. Yaga, Raghu N. Kacker, Yu Lei, Chung Tong Hu
Abstract
Rule-based systems are important in application domains such as artificial intelligence and business rule engines, as well as formal methods for software design. When translated into an implementation, simple expressions in rules may map to thousands of lines of code. Thus testing is necessary to ensure that the rules are implemented correctly. This paper describes an approach based on combinatorial methods for efficiently generating test cases for rule-based systems that are pseudo-exhaustive, which we define as exhaustive testing of all combinations of variable values on which a decision is dependent. The method has been implemented in a tool that can be applied to testing and verification for a wide range of applications where software behavior is specified in formal rules.
Proceedings Title
30th International Conference on Software Engineering and Knowledge Engineering (SEKE 2018)
Kuhn, D.
, Yaga, D.
, Kacker, R.
, Lei, Y.
and , C.
(2018),
Pseudo-exhaustive Verification of Rule Based Systems, 30th International Conference on Software Engineering and Knowledge Engineering (SEKE 2018), San Francisco, CA, [online], https://doi.org/10.18293/SEKE2018-072
(Accessed October 20, 2025)