Skip to main content
U.S. flag

An official website of the United States government

Dot gov

The .gov means it’s official.
Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.


The site is secure.
The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

Pseudo-exhaustive Verification of Rule Based Systems



David R. Kuhn, Dylan J. Yaga, Raghu N. Kacker, Yu Lei, Chung Tong Hu


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)
Conference Dates
July 1-3, 2018
Conference Location
San Francisco, CA


combinatorial testing, constraint solvers, formal methods, t-way testing, rule-based systems, test automation
Created July 1, 2018, Updated May 1, 2019