Skip to content
Rainbow docs menu

Reference · The Applied Higher-Order Functions catalogue

rainbow.algorithms.proofs.ahof.falsification-opt

The Applied Higher-Order Functions cataloguesrc/rainbow/algorithms/proofs/ahof/falsification_opt.clj1 definitions, 4 theorems

AHoF V12 Falsification as Optimization: cast falsification as minimizing the STL robustness of the specification over inputs; a violation is found when the achieved robustness drops to or below the violation margin: violation-found? robustness margin = decide (robustness <= margin). Proved native and axiom-free (decision, two positive instances, at-most certificate, negative instance). Requires audit/decide-nnrat-at-most, nnrat/at-most, nnrat/decide-at-most-true-sound (all in the D63 checkpoint). Scope (measured by the kernel): this module has 4 worked instances (statements about specific values). None of its theorems is a guarantee about the algorithm for all inputs; `lein verify rainbow.algorithms.proofs.ahof.falsification-opt` prints this classification.

fals-opt/violation-found?

DefinitionSource, line 44

fals-opt/violation-found? :
  (x₁ x₂ : ℚ≥0)
  → data/Bool

ℚ≥0 = nnrat/NonnegativeRational

fals-opt/low-robustness-violation

TheoremWorked exampleNo axiomsSource, line 51

fals-opt/low-robustness-violation :
  → ce-is/elite? 1/4 1/2 = data/true

= = equality/Eq

fals-opt/boundary-violation

TheoremWorked exampleNo axiomsSource, line 57

fals-opt/boundary-violation :
  → ce-is/elite? 1/2 1/2 = data/true

= = equality/Eq

fals-opt/robustness-certificate

TheoremWorked exampleNo axiomsSource, line 63

fals-opt/robustness-certificate :
  → 1/4 ≤ 1/2

≤ = nnrat/at-most

fals-opt/high-robustness-safe

TheoremWorked exampleNo axiomsSource, line 68

fals-opt/high-robustness-safe :
  → ce-is/elite? 3/4 1/2 = data/false

= = equality/Eq