branchproof 0.7.0 → 0.8.0

data/doc/Branchproof/DecisionTable.md

@@ -0,0 +1,153 @@
+# Module Branchproof::DecisionTable <a id="module-Branchproof-DecisionTable"></a>
+
+|  |  |
+| --- | --- |
+| **Defined in** | lib/branchproof/decision_table.rb |
+
+Derives the executable logical rules of a supported Boolean decision and
+overlays the runtime evidence that the existing Branchproof run captured.
+
+Rules come from the Boolean tree itself rather than from an exhaustive
+Cartesian expansion, so Ruby's short-circuit semantics are preserved: a
+condition the interpreter would skip becomes an explicit `dont_care` value
+instead of two separate rules.
+
+Nothing here executes application code, and no additional test run is
+required: overlay consumes the vectors already recorded for the decision.
+
+## Constants
+### `CONDITION_VALUES` <a id="constant-CONDITION_VALUES"></a> <a id="CONDITION_VALUES-constant"></a>
+Not documented.
+
+### `CONSTRAINT_ANALYSIS_VERSION` <a id="constant-CONSTRAINT_ANALYSIS_VERSION"></a> <a id="CONSTRAINT_ANALYSIS_VERSION-constant"></a>
+Not documented.
+
+### `COVERAGE_STATUSES` <a id="constant-COVERAGE_STATUSES"></a> <a id="COVERAGE_STATUSES-constant"></a>
+Not documented.
+
+### `COVERAGE_SUMMARY_STATUSES` <a id="constant-COVERAGE_SUMMARY_STATUSES"></a> <a id="COVERAGE_SUMMARY_STATUSES-constant"></a>
+Not documented.
+
+### `DEFAULT_MAX_CONDITIONS` <a id="constant-DEFAULT_MAX_CONDITIONS"></a> <a id="DEFAULT_MAX_CONDITIONS-constant"></a>
+Not documented.
+
+### `DEFAULT_MAX_RULES` <a id="constant-DEFAULT_MAX_RULES"></a> <a id="DEFAULT_MAX_RULES-constant"></a>
+Not documented.
+
+### `DONT_CARE` <a id="constant-DONT_CARE"></a> <a id="DONT_CARE-constant"></a>
+Not documented.
+
+### `FALSE_VALUE` <a id="constant-FALSE_VALUE"></a> <a id="FALSE_VALUE-constant"></a>
+Not documented.
+
+### `NOT_CALCULATED_REASONS` <a id="constant-NOT_CALCULATED_REASONS"></a> <a id="NOT_CALCULATED_REASONS-constant"></a>
+Not documented.
+
+### `REACHABILITY_STATUSES` <a id="constant-REACHABILITY_STATUSES"></a> <a id="REACHABILITY_STATUSES-constant"></a>
+Not documented.
+
+### `SCHEMA_VERSION` <a id="constant-SCHEMA_VERSION"></a> <a id="SCHEMA_VERSION-constant"></a>
+Not documented.
+
+### `TABLE_STATUSES` <a id="constant-TABLE_STATUSES"></a> <a id="TABLE_STATUSES-constant"></a>
+Not documented.
+
+### `TRUE_VALUE` <a id="constant-TRUE_VALUE"></a> <a id="TRUE_VALUE-constant"></a>
+Not documented.
+
+### `VALUE_LABELS` <a id="constant-VALUE_LABELS"></a> <a id="VALUE_LABELS-constant"></a>
+Not documented.
+
+## Public Class Methods
+### `build(decision:, vectors: = [], limits: = {}, reachability: = true)` <a id="method-c-build"></a> <a id="build-class_method"></a>
+Builds the reduced, runtime-overlaid table for one Boolean decision.
+- **@raise** [ArgumentError]
+
+### `classify_vectors(rules, vectors)` <a id="method-c-classify_vectors"></a> <a id="classify_vectors-class_method"></a>
+Generated traces have nil in every skipped condition position. Their
+normalized vector is therefore an exact table key and can be classified
+without scanning every rule. Malformed or hand-built observations retain the
+historical matcher as a bounded compatibility fallback.
+
+### `combine(node, type, budget)` <a id="method-c-combine"></a> <a id="combine-class_method"></a>
+Not documented.
+
+### `coverage_entry(table)` <a id="method-c-coverage_entry"></a> <a id="coverage_entry-class_method"></a>
+The per-decision row the coverage ladder renders.
+
+### `coverage_status(covered, required, generated)` <a id="method-c-coverage_status"></a> <a id="coverage_status-class_method"></a>
+Not documented.
+
+### `enumerate(node, prefer, budget)` <a id="method-c-enumerate"></a> <a id="enumerate-class_method"></a>
+Enumerates every short-circuit evaluation path of the Boolean tree.
+
+`prefer` orders the paths deterministically: a conjunction lists its
+short-circuiting false path first, a disjunction its true path first, and a
+negation inverts the preference it inherits. Returns nil once the path count
+would exceed `budget`.
+
+### `fast_match_positions(vector, by_signature, condition_count)` <a id="method-c-fast_match_positions"></a> <a id="fast_match_positions-class_method"></a>
+Not documented.
+
+### `fetch(record, key)` <a id="method-c-fetch"></a> <a id="fetch-class_method"></a>
+Not documented.
+
+### `generic_matches(rules, vectors)` <a id="method-c-generic_matches"></a> <a id="generic_matches-class_method"></a>
+Not documented.
+
+### `limit(limits, key, fallback)` <a id="method-c-limit"></a> <a id="limit-class_method"></a>
+Not documented.
+
+### `matches?(rule, vector)` <a id="method-c-matches-3F"></a> <a id="matches?-class_method"></a>
+A runtime observation matches a rule when every required condition value
+matches and the decision outcome matches. Conditions Ruby skipped may only
+line up with don't-care positions.
+- **@return** [Boolean]
+
+### `not_calculated(decision_id, reason)` <a id="method-c-not_calculated"></a> <a id="not_calculated-class_method"></a>
+Not documented.
+
+### `overlay(decision_id:, rules:, vectors:, reachability: = true, indexed: = false)` <a id="method-c-overlay"></a> <a id="overlay-class_method"></a>
+Not documented.
+
+### `overlay_rule(decision_id, rule, vectors, diagnostics)` <a id="method-c-overlay_rule"></a> <a id="overlay_rule-class_method"></a>
+Public compatibility wrapper: callers historically passed all vectors, so
+retain matcher filtering for direct calls.
+
+### `overlay_rule_matches(decision_id, rule, matched, diagnostics)` <a id="method-c-overlay_rule_matches"></a> <a id="overlay_rule_matches-class_method"></a>
+Not documented.
+
+### `percentage(covered, required)` <a id="method-c-percentage"></a> <a id="percentage-class_method"></a>
+Not documented.
+
+### `representable?(node, condition_count)` <a id="method-c-representable-3F"></a> <a id="representable?-class_method"></a>
+Only AND, OR, NOT, and atoms within the decision's own condition range are
+representable; anything else leaves the table uncalculated rather than
+producing a table that does not describe the decision.
+- **@return** [Boolean]
+
+### `rule(decision_id, conditions, path, index, reachability: = true, prepared_constraints: = nil)` <a id="method-c-rule"></a> <a id="rule-class_method"></a>
+rubocop:disable-next Metrics/ParameterLists
+
+### `rule_id(decision_id, values, outcome)` <a id="method-c-rule_id"></a> <a id="rule_id-class_method"></a>
+Rule identity depends only on the decision, the normalized condition vector,
+the expected outcome, and the table schema version. It never depends on a test
+name, a runtime observation, or the Minitest seed.
+
+### `signature(values, outcome)` <a id="method-c-signature"></a> <a id="signature-class_method"></a>
+Not documented.
+
+### `static_reachability(conditions, values, prepared_constraints: = nil)` <a id="method-c-static_reachability"></a> <a id="static_reachability-class_method"></a>
+Conservative static reachability: prove impossibility, or answer unknown.
+
+### `summary(decision_id:, rules:, diagnostics:, reachability_analyzed: = true)` <a id="method-c-summary"></a> <a id="summary-class_method"></a>
+Not documented.
+
+### `unavailable_reason(decision, limits)` <a id="method-c-unavailable_reason"></a> <a id="unavailable_reason-class_method"></a>
+Names why a decision carries no Boolean table, or nil when it carries one.
+
+### `unique_atom_indices?(node, seen = {})` <a id="method-c-unique_atom_indices-3F"></a> <a id="unique_atom_indices?-class_method"></a>
+- **@return** [Boolean]
+
+### `unsupported_coverage_entry()` <a id="method-c-unsupported_coverage_entry"></a> <a id="unsupported_coverage_entry-class_method"></a>
+Not documented.

data/doc/Branchproof/FocusedReport.md

@@ -7,9 +7,12 @@
 
 Terminal renderings grouped around conditions or tests.
 
+## Constants
+### `DECISION_TABLE_LABELS` <a id="constant-DECISION_TABLE_LABELS"></a> <a id="DECISION_TABLE_LABELS-constant"></a>
+Not documented.
+
 ## Public Instance Methods
-### `initialize(document:, view:, level:, missing_only: = false)` <a id="method-i-initialize"></a> <a id="initialize-instance_method"></a>
-- **@raise** [ArgumentError]
+### `initialize(document:, view:, level:, missing_only: = false, coordinator: = nil)` <a id="method-i-initialize"></a> <a id="initialize-instance_method"></a>
 - **@return** [FocusedReport] a new instance of FocusedReport
 
 ### `render()` <a id="method-i-render"></a> <a id="render-instance_method"></a>

data/doc/Branchproof/Loader.md

@@ -7,10 +7,6 @@
 
 Owns the process-local CRuby compilation hook when the VM exposes it.
 
-## Constants
-### `STATUS_KEYS` <a id="constant-STATUS_KEYS"></a> <a id="STATUS_KEYS-constant"></a>
-Not documented.
-
 ## Public Instance Methods
 ### `diagnostics()` <a id="method-i-diagnostics"></a> <a id="diagnostics-instance_method"></a>
 Not documented.

data/doc/Branchproof/MinitestAdapter.md

@@ -15,9 +15,6 @@ Returns the value of attribute active_adapter.
 Returns the value of attribute tests.
 
 ## Public Instance Methods
-### `capabilities()` <a id="method-i-capabilities"></a> <a id="capabilities-instance_method"></a>
-Not documented.
-
 ### `initialize(runtime:)` <a id="method-i-initialize"></a> <a id="initialize-instance_method"></a>
 - **@return** [MinitestAdapter] a new instance of MinitestAdapter
 

data/doc/Branchproof/Report.md

@@ -11,9 +11,18 @@ Renders versioned terminal and JSON analysis reports.
 ### `CRITERION_VERSION` <a id="constant-CRITERION_VERSION"></a> <a id="CRITERION_VERSION-constant"></a>
 Not documented.
 
+### `DECISION_TABLE_LABELS` <a id="constant-DECISION_TABLE_LABELS"></a> <a id="DECISION_TABLE_LABELS-constant"></a>
+Not documented.
+
+### `DECISION_TABLE_STATUS_LABELS` <a id="constant-DECISION_TABLE_STATUS_LABELS"></a> <a id="DECISION_TABLE_STATUS_LABELS-constant"></a>
+Not documented.
+
 ### `SCHEMA_VERSION` <a id="constant-SCHEMA_VERSION"></a> <a id="SCHEMA_VERSION-constant"></a>
 Not documented.
 
+### `VIEWS` <a id="constant-VIEWS"></a> <a id="VIEWS-constant"></a>
+Not documented.
+
 ## Public Class Methods
 ### `from_document(document:, level: = nil, view: = :decisions, missing_only: = false)` <a id="method-c-from_document"></a> <a id="from_document-class_method"></a>
 Not documented.
@@ -32,6 +41,15 @@ Render the shared ladder in every terminal view.
 ### `coverage_status_label(status)` <a id="method-i-coverage_status_label"></a> <a id="coverage_status_label-instance_method"></a>
 Not documented.
 
+### `decision_table_expected_heading(decision)` <a id="method-i-decision_table_expected_heading"></a> <a id="decision_table_expected_heading-instance_method"></a>
+Not documented.
+
+### `decision_table_reachability(rule)` <a id="method-i-decision_table_reachability"></a> <a id="decision_table_reachability-instance_method"></a>
+Not documented.
+
+### `decision_table_requirement(value)` <a id="method-i-decision_table_requirement"></a> <a id="decision_table_requirement-instance_method"></a>
+Not documented.
+
 ### `diagnostic_message(diagnostic)` <a id="method-i-diagnostic_message"></a> <a id="diagnostic_message-instance_method"></a>
 Formats source context consistently in live and saved terminal views.
 

data/doc/Branchproof/Runtime.md

@@ -9,6 +9,10 @@ Process-local execution recorder. It deliberately never coerces or stores
 application values: Ruby's conditional expression is used for truthiness.
 Captures condition evaluations while preserving application values.
 
+## Constants
+### `FRAME_STATE_KEY` <a id="constant-FRAME_STATE_KEY"></a> <a id="FRAME_STATE_KEY-constant"></a>
+Not documented.
+
 ## Public Class Methods
 ### `boot(evidence:)` <a id="method-c-boot"></a> <a id="boot-class_method"></a>
 Not documented.

data/doc/Branchproof/SavedReport.md

@@ -17,12 +17,27 @@ Not documented.
 ### `DECISION_KINDS` <a id="constant-DECISION_KINDS"></a> <a id="DECISION_KINDS-constant"></a>
 Not documented.
 
+### `DECISION_TABLE_STATUSES` <a id="constant-DECISION_TABLE_STATUSES"></a> <a id="DECISION_TABLE_STATUSES-constant"></a>
+Not documented.
+
 ### `NONBOOLEAN_KINDS` <a id="constant-NONBOOLEAN_KINDS"></a> <a id="NONBOOLEAN_KINDS-constant"></a>
 Not documented.
 
 ### `REQUIRED_FIELDS` <a id="constant-REQUIRED_FIELDS"></a> <a id="REQUIRED_FIELDS-constant"></a>
 Not documented.
 
+### `RULE_CONDITION_VALUES` <a id="constant-RULE_CONDITION_VALUES"></a> <a id="RULE_CONDITION_VALUES-constant"></a>
+Not documented.
+
+### `RULE_COVERAGE_STATUSES` <a id="constant-RULE_COVERAGE_STATUSES"></a> <a id="RULE_COVERAGE_STATUSES-constant"></a>
+Not documented.
+
+### `RULE_REACHABILITY_STATUSES` <a id="constant-RULE_REACHABILITY_STATUSES"></a> <a id="RULE_REACHABILITY_STATUSES-constant"></a>
+Not documented.
+
+### `STRICT_FLOW_SCHEMAS` <a id="constant-STRICT_FLOW_SCHEMAS"></a> <a id="STRICT_FLOW_SCHEMAS-constant"></a>
+Not documented.
+
 ### `SUPPORTED_SCHEMAS` <a id="constant-SUPPORTED_SCHEMAS"></a> <a id="SUPPORTED_SCHEMAS-constant"></a>
 Not documented.
 

data/doc/Branchproof.md

@@ -2,7 +2,7 @@
 
 |  |  |
 | --- | --- |
-| **Defined in** | lib/branchproof.rb, lib/branchproof/cli.rb, lib/branchproof/limits.rb, lib/branchproof/loader.rb, lib/branchproof/report.rb, lib/branchproof/source.rb, lib/branchproof/worker.rb, lib/branchproof/project.rb, lib/branchproof/records.rb, lib/branchproof/runtime.rb, lib/branchproof/version.rb, lib/branchproof/analyzer.rb, lib/branchproof/evidence.rb, lib/branchproof/minimizer.rb, lib/branchproof/comparison.rb, lib/branchproof/instrumenter.rb, lib/branchproof/runtime_flow.rb, lib/branchproof/saved_report.rb, lib/branchproof/rails_support.rb, lib/branchproof/coverage_index.rb, lib/branchproof/focused_report.rb, lib/branchproof/decision_syntax.rb, lib/branchproof/minitest_adapter.rb, lib/branchproof/comparison_report.rb, lib/branchproof/flow_instrumentation.rb |
+| **Defined in** | lib/branchproof.rb, lib/branchproof/cli.rb, lib/branchproof/limits.rb, lib/branchproof/loader.rb, lib/branchproof/report.rb, lib/branchproof/source.rb, lib/branchproof/worker.rb, lib/branchproof/project.rb, lib/branchproof/records.rb, lib/branchproof/runtime.rb, lib/branchproof/version.rb, lib/branchproof/analyzer.rb, lib/branchproof/evidence.rb, lib/branchproof/minimizer.rb, lib/branchproof/comparison.rb, lib/branchproof/constraints.rb, lib/branchproof/instrumenter.rb, lib/branchproof/runtime_flow.rb, lib/branchproof/saved_report.rb, lib/branchproof/rails_support.rb, lib/branchproof/coverage_index.rb, lib/branchproof/decision_table.rb, lib/branchproof/focused_report.rb, lib/branchproof/decision_syntax.rb, lib/branchproof/minitest_adapter.rb, lib/branchproof/comparison_report.rb, lib/branchproof/flow_instrumentation.rb |
 
 Keep each bounded source rewrite together so its evaluation order can be
 audited. rubocop:disable Metrics/AbcSize, Metrics/MethodLength
@@ -17,8 +17,11 @@ Not documented.
 - [Branchproof/CLI.md](Branchproof/CLI.md)
 - [Branchproof/Comparison.md](Branchproof/Comparison.md)
 - [Branchproof/ComparisonReport.md](Branchproof/ComparisonReport.md)
+- [Branchproof/Constraints/Solver.md](Branchproof/Constraints/Solver.md)
+- [Branchproof/Constraints.md](Branchproof/Constraints.md)
 - [Branchproof/CoverageIndex.md](Branchproof/CoverageIndex.md)
 - [Branchproof/DecisionSyntax.md](Branchproof/DecisionSyntax.md)
+- [Branchproof/DecisionTable.md](Branchproof/DecisionTable.md)
 - [Branchproof/Error.md](Branchproof/Error.md)
 - [Branchproof/Evidence.md](Branchproof/Evidence.md)
 - [Branchproof/FlowInstrumentation.md](Branchproof/FlowInstrumentation.md)

data/doc/CHANGELOG.md

@@ -1,5 +1,40 @@
 ## [Unreleased]
 
+## [0.8.0] - 2026-09-17
+
+- Derive a reduced decision table for every supported Boolean decision from its
+  `AND`/`OR`/`NOT`/atom structure, preserving Ruby short-circuit semantics with
+  an explicit `dont_care` value instead of exhaustive Cartesian expansion.
+- Give every rule a stable identity derived from the decision, its normalized
+  condition vector, the expected outcome, and the table schema version, so
+  saved reports compare across runs, test order, and Minitest seeds.
+- Overlay the existing run's observations onto the rules, attribute covered
+  rules to their Minitest tests, and describe uncovered rules as condition-value
+  requirements. No additional test execution is performed.
+- Report Decision Table Coverage as its own criterion in the coverage ladder,
+  per decision and in aggregate, independently from MC/DC in both directions.
+- Add conservative reachability: `observed`, `unknown`, and
+  `statically_impossible` with stable reason codes. Constraint analysis version 2
+  requires safe source constraints before excluding rules, keeping arbitrary
+  comparison receivers, mutation, and unordered numeric cases unknown.
+- Exclude statically impossible rules from coverage denominators while keeping
+  them visible, and let runtime evidence withdraw an impossibility claim with a
+  `constraint_model_conflict` diagnostic.
+- Add `--view decision-tables`, which honours `--missing-only` and never lists
+  an impossible rule as a missing obligation.
+- Bound table derivation with the new `max_conditions_for_decision_table` and
+  `decision_table_rules_per_decision` limits.
+- Persist the table, rule identities, coverage, attribution, and reachability in
+  schema `1.3` reports, and distinguish rule-coverage changes from reachability
+  changes in offline comparison.
+- Enforce exact rule-limit boundaries and index runtime rule matching rather
+  than scanning all observations per rule.
+- Add `--no-reachability` to keep all generated rules as coverage obligations.
+- Align the JSON regression flag with decision-table CLI failures, report
+  analysis-version changes, and validate saved rule identities and evidence.
+- Keep uncalculated decision locations and reasons in missing-only reports;
+  label `unless` and `until` outcomes as predicate values.
+
 ## [0.7.0] - 2026-09-10
 
 - Discover Boolean loop predicates, subjectless case candidates, standalone

data/doc/README.md

@@ -1,10 +1,11 @@
 # Branchproof
 
-Branchproof measures decision, condition, and modified condition/decision
-coverage (MC/DC) from one serial Minitest run. It discovers Ruby decisions
-through Prism, records their runtime paths, and attributes evidence to tests.
-Boolean decisions receive the coverage ladder; `case`, pattern alternatives,
-safe navigation, and conditional assignments receive alternative coverage.
+Branchproof measures decision, condition, modified condition/decision (MC/DC),
+and decision-table coverage from one serial Minitest run. It discovers Ruby
+decisions through Prism, records their runtime paths, and attributes evidence
+to tests. Boolean decisions receive the coverage ladder; `case`, pattern
+alternatives, safe navigation, and conditional assignments receive alternative
+coverage.
 
 The gem and primary command are named `branchproof`. The `mcdc` command and
 `MCDC` namespace remain compatibility aliases with the same behavior.
@@ -128,7 +129,7 @@ json` when a consumer needs the complete identifiers and versioned schema.
 
 ### Coverage ladder
 
-Each successful `analyze` run calculates four criteria from the same completed
+Each successful `analyze` run calculates five criteria from the same completed
 observations. The report shows their status for each supported decision and
 aggregate counts with explicit denominators:
 
@@ -138,6 +139,7 @@ aggregate counts with explicit denominators:
 | Condition | Every atomic condition evaluated both true and false | Two required truth values per supported condition |
 | Condition/Decision | Both Decision and Condition Coverage hold for a decision | Supported decisions |
 | MC/DC | Every condition has an independence witness pair | Supported conditions |
+| Decision Table | Every executable logical rule was exercised | Non-impossible generated rules |
 
 For `logged_in? && admin?`, observations `[F-] => F` and `[TT] => T` give:
 
@@ -146,6 +148,7 @@ Decision                    PASS
 Condition                   FAIL (3/4 values observed)
 Condition/Decision          FAIL
 MC/DC                       FAIL (1/2 conditions proven)
+Decision Table              FAIL (2/3 rules covered)
 ```
 
 The skipped `admin?` in `[F-]` counts as neither true nor false. Conditions
@@ -155,6 +158,12 @@ for `logged_in?`; `admin?` still needs `[TF] => F`.
 
 Decision and Condition Coverage are calculated independently from the captured
 evidence. Condition/Decision requires both; MC/DC adds independence evidence.
+Decision Table Coverage is calculated independently of all of them: MC/DC asks
+whether each condition can independently affect the outcome, while Decision
+Table Coverage asks whether each logical rule was exercised. Neither status is
+inferred from the other, so `MC/DC PASS` with `Decision Table FAIL` and the
+reverse are both valid results.
+
 Unsupported decisions are excluded from every denominator, while
 unexecuted supported decisions remain in scope. Empty denominators are N/A.
 
@@ -170,6 +179,184 @@ under `analysis.decisions[].coverage`, and condition value evidence under
 pairs, counterpart constraints, and raw vectors remain available. Statuses
 distinguish `covered`, `partial`, `unexecuted`, and `unsupported` results.
 
+### Decision table coverage
+
+For a Boolean decision Branchproof can represent with `AND`, `OR`, `NOT`, and
+atomic conditions, it derives a reduced decision table statically from the
+Boolean structure and then overlays the runtime evidence of the same run. No
+application code is executed while the table is derived, and no extra test run
+is performed while it is overlaid.
+
+Rules come directly from the short-circuit evaluation paths of the Ruby expression,
+so a condition the interpreter would
+skip appears as an explicit don't-care (`-`) rather than as two separate rules.
+Exhaustive Boolean expansion is deferred; it is not required to calculate coverage
+and is never performed on the reporting path.
+For `premium? && (admin? || owner?)`:
+
+```text
+Decision Table: 3/4 rules covered (75.0%)
+  Rule  premium?  admin?  owner?  Result  Status
+  R1    F         -       -       F       COVERED
+  R2    T         T       -       T       COVERED
+  R3    T         F       T       T       MISSING
+  R4    T         F       F       F       COVERED
+  R1 tests: UserAccessTest#test_free_user
+  R2 tests: UserAccessTest#test_admin
+  R3
+  Need:
+    premium? = truthy
+    admin?   = falsey
+    owner?   = truthy
+  Expected decision:
+    true
+  Reachability:
+    unknown
+  R4 tests: UserAccessTest#test_denied
+```
+
+A missing rule describes condition values only. It does not claim which
+application inputs would produce them.
+
+An observation matches a rule when every required condition value matches and
+the decision outcome matches. Conditions Ruby skipped can only line up with
+don't-care positions; they never satisfy a required true or false. Every rule
+carries a stable identity derived from the decision, its normalized condition
+vector, the expected outcome, and the table schema version — never from a test
+name, an observation order, or the Minitest seed, so saved reports compare
+across runs.
+
+Decision tables are derived for `if`, `unless`, `elsif`, ternary, `while`,
+`until`, subjectless `case`/`when`, and supported Boolean pattern guards.
+Multi-way `case`/`when`, `case`/`in` alternatives, safe navigation, conditional
+assignment, and exception handling keep their alternative coverage model and
+produce no Boolean table.
+For `unless` and `until`, the outcome is the predicate value, not whether the
+body executes; the terminal report labels it accordingly.
+
+#### Reachability and impossible rules
+
+Each rule carries a reachability status: `observed`, `unknown`, or
+`statically_impossible`. Branchproof proves impossibility or leaves
+reachability unknown. It never infers impossibility from a missing test, a
+missing observation, application conventions, Rails validations, database
+constraints, comments, or method names.
+
+Constraint analysis version 2 requires evidence that a constraint is safe before
+using it to exclude a rule. A variable name and a numeric literal do not prove
+that the receiver is a number, that its comparison methods use built-in semantics,
+or that its value stays unchanged. Numeric, equality, and nil-check expressions
+are still normalized for inspection, but unproven source constraints remain
+`unknown`. The standalone constraint solver describes its explicit model, not
+arbitrary Ruby objects.
+
+Literal truth values can establish impossibility without invoking application
+methods. For `age && false`, the rule requiring the literal `false` to be truthy
+cannot execute:
+
+```text
+Decision Table: 2/2 rules covered (100.0%)
+Statically impossible rules excluded: 1
+  Rule  age  false  Result  Status
+  R1    F    -      F       COVERED
+  R2    T    F      F       COVERED
+  R3    T    T      T       EXCLUDED
+  R3 TT => T
+  Status:
+    EXCLUDED
+  Reachability:
+    STATICALLY IMPOSSIBLE
+  Reason:
+    conflicting Boolean literal requirements
+```
+
+Impossible rules stay visible in the full report but leave the coverage
+denominator. Reason codes are stable: `conflicting_numeric_bounds`,
+`conflicting_equalities`, `equality_outside_numeric_range`, `nil_conflict`, and
+`boolean_literal_conflict`. Human-readable messages may change independently.
+
+Runtime evidence is authoritative. If an observation matches a rule the static
+model called impossible, the rule becomes `observed`, the impossibility claim is
+withdrawn, the rule returns to the denominator, and a `constraint_model_conflict`
+diagnostic records the disagreement.
+
+For example, `age > 10 && age < 5` stays unknown without a proven domain;
+custom comparison methods can make both comparisons true. Similarly,
+`x > 10 && (x = 0) && x < 5` can execute successfully. `Float::NAN` also prevents
+treating a false comparison as its ordered complement. Runtime evidence can cover
+these rules, but lack of evidence cannot exclude them. Ruby truthiness remains
+distinct from Boolean equality: only `false` and `nil` are falsey.
+
+Use `analyze --no-reachability` to disable all static exclusions, including literal
+proofs. Every generated rule then remains an obligation; reports show
+`Reachability: not analyzed`. The mode is persisted with the report and considered
+when comparing analysis contexts. Reading a saved report preserves its original
+analysis; it does not recalculate it under a different mode.
+
+#### Decision table views and limits
+
+`--view decision-tables` groups the terminal report by decision table, and
+`--missing-only` narrows it to uncovered, non-impossible rules while retaining
+uncalculated decisions with their location and reason. `decision_tables` is an
+accepted compatibility spelling for the view:
+
+```sh
+bundle exec branchproof analyze 'lib/**/*.rb' \
+  --view decision-tables \
+  --missing-only
+```
+
+Tables grow exponentially with condition count, so
+`max_conditions_for_decision_table` (default 12) and
+`decision_table_rules_per_decision` (default 4096) bound the derivation. A
+decision above either limit reports `Decision Table: NOT CALCULATED` with the
+reason `decision_table_condition_limit_exceeded` or
+`decision_table_rule_limit_exceeded` instead of a partial table.
+
+JSON stores the table under `analysis.decisions[].decision_table` with its
+`schema_version`, `constraint_analysis_version`, rules, rule identities, rule
+coverage, test attribution, reachability, and reachability reason. This abbreviated
+example omits counts and evidence bookkeeping fields; full reports also retain
+rule indexes, vector IDs, unattributed counts, and withdrawn-impossibility details:
+
+```json
+{
+  "decision_table": {
+    "status": "calculated",
+    "schema_version": 1,
+    "constraint_analysis_version": 2,
+    "rules": [
+      {
+        "id": "8f1c...",
+        "label": "R1",
+        "conditions": ["false", "dont_care", "dont_care"],
+        "outcome": false,
+        "coverage": "covered",
+        "reachability": "observed",
+        "tests": ["..."]
+      },
+      {
+        "id": "3ad0...",
+        "label": "R3",
+        "conditions": ["true", "false", "true"],
+        "outcome": true,
+        "coverage": "missing",
+        "reachability": "unknown",
+        "tests": []
+      }
+    ]
+  }
+}
+```
+
+Aggregate counts live under `analysis.coverage.decision_table` and keep rule
+coverage and fully covered decisions as distinct metrics:
+
+```text
+DT (Decision table coverage): 83.9% (47/56 rules)
+Decision tables fully covered: 13/18 decisions
+```
+
 ### Find missing cases
 
 Use `--missing-only` to focus the terminal report on conditions that still
@@ -231,7 +418,7 @@ analysis even at Level 1. A failed, unsupported, or incomplete run is reported
 with its status and diagnostics and cannot become a successful coverage
 result by changing the display level.
 
-### Focused condition and test views
+### Focused condition, test, and decision-table views
 
 Use `--view conditions` to group the report by condition. Each condition shows
 its expression, decision, and project-relative source location with the
@@ -253,6 +440,10 @@ conditions. A test that evaluates both Boolean values is evidence of execution;
 it is a proof contributor only when the analyzer's independent witness pair
 uses its observations.
 
+Use `--view decision-tables` to group the report by decision table. See
+[Decision table coverage](#decision-table-coverage) for the rule, reachability,
+and attribution detail it renders.
+
 `--view` changes terminal grouping and does not change instrumentation or test
 execution. JSON output always contains the complete evidence document, so an
 explicit view cannot be combined with `--format json`. The `mcdc` executable
@@ -308,7 +499,12 @@ patterns is valid comparison context, and seed differences are disclosed.
 
 `compare` exits 0 for a complete comparison, including one with coverage
 changes; `--fail-on-regression` exits 1 when a complete comparable run loses
-proof. Invalid input or an incomplete comparison exits 2, which takes
+MC/DC proof or decision-table rule coverage. The JSON `regression` flag includes
+either kind of loss; `regressions` retains the MC/DC count and
+`decision_table_regressions` supplies the separate rule-loss count. Changes to
+table schemas, constraint-analysis versions, or reachability modes are reported
+as analysis context changes rather than silently treated as unchanged analysis.
+Invalid input or an incomplete comparison exits 2, which takes
 precedence. Reports are explicit snapshots: comparison never creates history,
 promotes a baseline, or overwrites either input.
 
@@ -389,8 +585,12 @@ exclusions. Ruby-defined custom `!` methods keep their runtime behavior;
 evidence that contradicts Boolean negation is rejected instead of proving
 coverage with an invalid logical model.
 
-New reports use schema `1.2`; saved schema `1.0` and `1.1` reports remain
-readable. Expanded discovery changes coverage denominators, so compare reports
+New reports use schema `1.3`; saved schema `1.0`, `1.1`, and `1.2` reports
+remain readable. Comparison distinguishes decision-table coverage movement
+(`rule coverage gained`, `rule coverage lost`) from analysis movement
+(`rule reachability changed`), and treats a structurally changed decision as a
+changed decision-table context instead of guessing which old rule a new rule
+corresponds to. Expanded discovery changes coverage denominators, so compare reports
 with their supported syntax scope in mind.
 
 ### Limits
@@ -398,7 +598,8 @@ with their supported syntax scope in mind.
 `--limits` accepts a JSON object containing positive integer overrides. The
 available keys are `conditions_per_decision`, `vectors_per_decision`,
 `owner_associations_per_run`, `tests_per_run`, `exact_candidates`,
-`exact_search_nodes`, and `constraint_search_states`.
+`exact_search_nodes`, `constraint_search_states`,
+`max_conditions_for_decision_table`, and `decision_table_rules_per_decision`.
 
 ```json
 {