ram footprint
ProvedResourceScheduling.Graph.ram_footprintalgorithmspolynomial-time
A structured register program preserves every register outside its syntactic write footprint, including across loops.
Preamble
import Definitions.Def_ResourceScheduling_Graph_RAMCode open CookPvsNP ResourceScheduling.Graph
Formal statement
namespace ResourceScheduling.Graph
theorem ram_footprint {V : Type} [DecidableEq V] (p : RAMCode V) (v : V)
(h : p.writes v = false) (s : RAMState V) : (p.eval s).val v = s.val v := by sorry
end ResourceScheduling.GraphSource
New auxiliary formalization for the ResourceScheduling Q2 reduction. The target is the unchanged CookPvsNP one-tape machine model, following Cook, The P versus NP problem, Clay Mathematics Institute (2000), Appendix. This explicit finite-column stack compiler and its simulation lemmas are new contributions, not numbered claims from Cook or the scheduling source paper.