Contract
What must remain true.
Inputs, observations, preconditions, postconditions, authority, persistence, atomicity, and allowed failure behavior.
meaning ≠ target encoding
Open formal-systems research
PSL investigates whether a stable semantic contract can survive materially different hardware generations while target realizations are independently checked and incompatible targets fail closed.
Hypothesis: one contract can survive
different faithful realizations.
01 / Research problem
A target does not become correct because a driver says it supports an operation. Its observable behavior must satisfy the semantic contract.
First falsification target
The current capability gate can say that a target supports a write. It cannot yet prove that the write reaches the right resource with the right representation and state transition.
Read the threat modelSetSetpoint(25.0 °C)25.0 °C → 250 → register 0x20config → write 250 @ 0x20 → ACKwrite 25 · 0x21 · wrong unit · wrong state02 / Three boundaries
Contract
Inputs, observations, preconditions, postconditions, authority, persistence, atomicity, and allowed failure behavior.
meaning ≠ target encoding
Evidence
A realization must justify its mapping and behavior. A boolean capability declaration is only an early gate.
claim ≠ proof
Device
Different targets may use different words, registers, protocols, state machines, or persistence mechanisms.
different realization · same contract
Hardware may change. Realizations may change. The accepted semantic obligation must not silently change.
03 / Adversarial model
The realization generator is treated as untrusted. The checker must detect errors that an ordinary protocol parser would happily accept.
The new work begins where the current boolean capability model stops: capability declaration is not realization correctness.
04 / Evidence, not hype
A theorem about a device model is not automatically a theorem about physical silicon. A virtual execution is evidence about that virtual implementation, not a proof of every real device.
05 / Current baseline
Repaired canonical abstract/control semantics
Lean forward-simulation results for the verified model
Finite Python → Lean compiler-output conformance bridge
Semantic identity separated from PVM32 target binding
Capability refusal witness — not yet realization proof
The current surface-language witness is historical prototype evidence, not the new research claim.
06 / Virtual hardware first
The primary laboratory is deterministic virtual hardware. QEMU, Renode, and small frozen emulators may instantiate device generations while Lean defines the formal boundary.
07 / Kill criteria
PSL should become smaller if standard refinement techniques provide the same result more directly or if the continuity boundary cannot localize change.
Wrong bindings cannot be rejected without trusting the driver.
A second target contaminates the semantic contract with hardware details.
Hardware substitution forces unrelated semantic proofs to be redone.
The checker becomes as complex or trusted as the realization itself.
Simulation-specific assumptions leak into the formal semantic layer.
No measurable advantage appears over a conventional refinement baseline.
08 / Research position
Verified compilation, proof-carrying systems, platform-independent models, verified drivers, legacy emulation, and multilingual syntax already have substantial prior art.
Not novel individually
“Can a stable semantic contract survive materially different hardware generations while independent realizations are checked for behavioral compatibility, incompatible targets fail closed, and upstream semantic evidence remains reusable?
current PSL research hypothesis
09 / Research documents
10 / North star
Require evidence for realization.
Refuse incompatible targets.
Keep every proof boundary visible.
Measure what survives evolution.