Skip to main content Link Menu Expand (external link) Document Search Copy Copied
Projects

Consistency Checker

v1.3.9-alpha-54

groupID
at.tugraz.ist.ase
artifactID
ca-cdr-v2

ca-cdr-v2 provides a consistency checker class (ChocoConsistencyChecker) supporting to check the consistency of sets of constraints or sets of test cases.

TBD

Table of Contents

  1. How tos
    1. Use the two last isConsistent functions

ChocoConsistencyChecker provides a variant of isConsistent functions with different parameters. In the current version 1.2.20, the class provides five isConsistent functions as the following:

  1. isConsistent(Collection C) – checks the consistency of set of constraints
  2. isConsistent(Collection C, ITestCase testcase) – checks the consistency of a test case with the background knowledge (a set of constraints).
  3. Set isConsistent(Collection C, Collection TC, boolean onlyOne) – checks the consistency of a set of test cases with the background knowledge (a set of constraints). The function returns violated test cases. If onlyOne=true, the function returns the first violated test case.
  4. isConsistent(ITestCase testcase, ITestCase neg_testcase) – checks the consistency between two test cases (testcase /\ ¬neg_testcase) to identify a redundant test case. If the output is false (inconsistent), then neg_testcase is a redundant test case. This function is used in the WipeOutR_T algorithm.
  5. isConsistent(Collection C, Constraint cstr) – checks the consistency of (C - {cstr} ∪ {¬cstr}) to identify the redundant constraints. If the output is false (inconsistent), then cstr is a redundant constraint. This function is used by the WipeOutR_FM algorithm.

How tos

Use the two last isConsistent functions

You can inherit the ChocoConsistencyChecker to add your new isConsistent function, or you can ask me to help you. Example – how to use the two last isConsistent functions: - two algorithms WipeOutR_FM and WipeOutR_T