Pseudo-exhaustive Verification of Rule Based Systems

Kuhn, Richard; Yaga, Dylan; Kacker, Raghu; Lei, Yu; Hu, Vincent

doi:https://doi.org/10.18293/SEKE2018-072

Conference Proceedings

Pseudo-exhaustive Verification of Rule Based Systems

Documentation Topics

Published: July 01, 2018

Author(s)

Richard Kuhn (NIST), Dylan Yaga (NIST), Raghu Kacker (NIST), Yu Lei (UTA), Vincent Hu (NIST)

Conference

Name: The 30th International Conference on Software Engineering & Knowledge Engineering (SEKE 2018)
Dates: July 1-3, 2018
Location: Redwood City, California, United States
Citation: SEKE 2018, pp. 586-591

Abstract

Rule-based systems are important in application domains such as artificial intelligence and business rule engines. When translated into an implementation, simple expressions in rules may map to a large body of code that requires testing. We show how rule-based systems may be tested efficiently, using combinatorial methods and a constraint solver in a test method that is 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.

Keywords

combinatorial testing; constraint solvers; formal methods; t-way testing; rule-based systems; test automation

Control Families

None selected

Documentation

Publication:
Conference Proceedings (DOI)

Supplemental Material:
None available

Document History:
07/01/18: Conference Proceedings (Final)

Topics

Security and Privacy
testing & validation

Technologies
artificial intelligence; software & firmware