Full experimental validation of dual decomposition protocol for JIT compiler inlining on the MIR lightweight JIT compiler. Implements a three-phase pipeline: Phase 1 synthetic profiling (execution frequencies derived from benchmark structure), Phase 2 shadow-price-guided mutation pass (MIR_CALL → MIR_INLINE promotion), Phase 3 wall-clock benchmarking across five conditions (no inlining, blind inline-all, random 50%, shadow-price, inverted-price). Includes two benchmark suites (3-function and 8-function workloads), raw timing data (20 runs × 5 conditions per benchmark), statistical analysis (Cohen's d effect sizes), and publication-quality figures (PNG + SVG). Key results: P3 (shadow vs. inverted-price) confirmed with d = 2.65–4.42 across both benchmarks; shadow-price matches blind inline-all performance with half the mutations on the 8-function benchmark (4 vs. 8 promotions, d = −0.02); P1 (shadow vs. random) falsified on 3-function benchmark due to fixed RNG seed. Companion to theory paper (DOI: 10.5281/zenodo.18715390) and Paper 1 empirical consistency results (DOI: 10.5281/zenodo.18735516).
compiler optimization · shadow pricing · empirical validation · JIT compilation · inlining · network utility maximization · dual decomposition · statistical hypothesis testing