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 December 14, 2024)
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)
, , , Yu Lei,
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)
Conference Dates
July 1-3, 2018
Conference Location
San Francisco, CA
Pub Type
Conferences
Download Paper
Keywords
combinatorial testing, constraint solvers, formal methods, t-way testing, rule-based systems, test automation
Citation
Issues
If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.
Created July 1, 2018, Updated May 1, 2019