Executable module boundaries and extraction evidence

This required 20–30-hour package supplies the enforcement core of guided Lab 1 and strengthens evidence in Labs 3–4. Allocate 5–7 hours to lessons and predictions, 9–15 to implementation and source integration, and 6–8 to assessment/repair. Reuse the resulting graph and checks; do not repeat them as additional labs. Estimates await learner pilots and semester reconciliation.

Prerequisite bridge

Review directed reachability and strongly connected components from algorithms, dependency inversion from software design, and retry/timeout uncertainty from Semester 06. From Module 01 retain measurable scenarios, evidence coverage and independent correctness gates.

Required sequence

1. Boundary semantics.
2. Cycle evidence.
3. Extraction evidence.
4. Implement module-boundary-contracts.zip with Python 3 standard library. Read README, then run python3 -B check.py starter. Open reference only after preserving your attempt.
5. Complete MB1–MB6, including actual source and network experiments.

The finite graph harness checks all 4,096 directed graphs without self-edges on four named code units, using an independent transitive-closure oracle. Separate cases cover self-dependency, duplicate edges, empty graphs and invalid metadata. It tests policy evaluation, not source extraction, runtime access or deployment independence. The original style catalog, shared-forces comparison, six-module coupling worksheet and extraction/reversal labs remain required.

Semester integration

The reconciled workload now includes this package, original module work, required strand and assessment. Its allocation supersedes earlier provisional timing notes; do not count reused artifacts twice.