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
← All Visualizations

Combinatorial

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

Control Flow

Construct control flow graphs from program source and analyze coverage criteria — node, edge, condition, and path coverage.

Subsumption

Visualize the subsumption hierarchy between coverage criteria: when satisfying one criterion guarantees satisfaction of another.

About·FAQ·Privacy Policy

© 2026 Dan Tsvyetkov