CS Vis
  • Algorithms
  • Theory
    • Computation
    • Complexity
  • Regular Languages
    • DFA
    • NFA
    • DFA → Regex
  • Context-Free Languages
    • CFG
    • PDA
    • CFG → CNF
  • Turing Machine
  • Testing
    • Combinatorial
    • Control Flow
    • Subsumption
  • FAQ
  • About
  • Contact
Testing
  • Combinatorial
  • Control Flow
  • Subsumption
CS Vis
  • Turing Machine
Theory
  • Computation
  • Complexity

Regular Languages

  • DFA
  • NFA
  • DFA → Regex

Context-Free Languages

  • CFG
  • PDA
  • CFG → CNF
Testing
  • Combinatorial
  • Control Flow
  • Subsumption

Algorithms

  • Graphs & Trees
  • Sorting
  • Searching & Arrays
  • Dynamic Programming
  • Divide & Conquer
  • Greedy Algorithms
  • FAQ
  • About
  • Contact
← Software Testing

Combinatorial

Generate covering arrays that exercise every t-way combination of input parameters.

AETG

A greedy algorithm for building covering arrays — small sets of test cases that exercise every t-way combination of input parameters.

IPO

In-Parameter-Order generation: builds a covering array incrementally, extending coverage one parameter at a time.

Orthogonal Arrays

Browse standard (Taguchi) orthogonal arrays — pre-calculated, perfectly balanced designs where every pair of factors is covered equally often.

More coming soon
New combinatorial techniques on the way.

Want a specific testing technique added? Request it by email at contact@csvisualizer.com.

About·FAQ·Privacy Policy

© 2026 Dan Tsvyetkov