Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
233 commits
Select commit Hold shift + click to select a range
2364f31
Check for, for-in and for-of statements, with [~In] heads, against th…
atiernan Nov 18, 2026
672f5d6
Check array and object literals against the tokens (7.3)
atiernan Nov 19, 2026
7470074
Check binding patterns against the tokens (7.3)
atiernan Nov 19, 2026
969b95b
Check assignment patterns against the tokens (7.3)
atiernan Nov 19, 2026
5541a4b
Check ++/--, a[b] and new against the tokens (7.3)
atiernan Nov 19, 2026
e80be5a
Check classes and methods against the tokens (7.3)
atiernan Nov 19, 2026
221ba19
Check template literals and tagged templates against the tokens (7.3)
atiernan Nov 19, 2026
2201fac
Check with and member-expression for-heads against the tokens (7.3)
atiernan Nov 19, 2026
a79d935
Check obj.#name against the tokens; document what the arena check cov…
atiernan Nov 19, 2026
967ecff
Merge claude/js-parser-impl-2 into claude/parser-codecheck
atiernan Nov 21, 2026
1cc14fc
js-syntax: cover optional chains, super, new.target, import(), import…
atiernan Nov 21, 2026
d2f4d1c
js-syntax: cover every import and export form in the derivation check…
atiernan Nov 21, 2026
3c73133
clazel-js-heap: the contract of element storage (spec, invariants, fa…
atiernan Nov 21, 2026
8a3bc1b
clazel-js-heap: elements, dense with a sparse fallback
atiernan Nov 21, 2026
eb56b34
clazel-js-heap: the contract of symbols and property keys
atiernan Nov 21, 2026
0a02b41
clazel-js-heap: symbols, well-known symbols and symbol property keys
atiernan Nov 21, 2026
70bd3d6
clazel-js-heap: Kani harnesses for elements and symbols
atiernan Nov 21, 2026
d7ab1b8
clazel-js-heap: the collector's contract (invariants GC1 to GC9, reac…
atiernan Nov 21, 2026
1fc07b0
clazel-js-heap: the collector (mark and sweep, ephemerons, WeakRef, F…
atiernan Nov 21, 2026
5044970
js-syntax: a proven early-error check over the arena, wired into pars…
atiernan Nov 21, 2026
b4f66d8
clazel-jit: the state relation and the refinement statements of the L…
atiernan Nov 21, 2026
9fd6116
clazel-js-heap: run 10 random element sequences under Miri, not 300
atiernan Nov 21, 2026
ab230f7
clazel-js-heap: Kani harness for the marker (GC1), Graph trait, slice…
atiernan Nov 21, 2026
9c675a0
clazel-js-syntax: proven early errors for function code
atiernan Nov 21, 2026
bcf42d9
clazel-js-syntax: proven early errors for scripts with a Use Strict D…
atiernan Nov 21, 2026
9e3b25b
clazel-jit: x86-64 templates for straight-line integer LIR, proven; e…
atiernan Nov 21, 2026
6caf12c
Merge a64-validator (#216) for the J.9 A64 acceptance test
atiernan Nov 21, 2026
9510ac0
Phase 7.10: the RegExp matcher (backtracking, bounded stack), case-fo…
atiernan Nov 21, 2026
fd4ea5d
clazel-js-syntax: proven early errors for lexical declarations and st…
atiernan Nov 21, 2026
7a4457a
clazel-jit: the state relation and the refinement statements of the L…
atiernan Nov 21, 2026
45b3f9d
Phase 7.12: the WebIDL parser and `cargo xtask bindings` (generated i…
atiernan Nov 21, 2026
e3588df
clazel-dom: spec and contracts for pre-insert, replace, replace all, …
atiernan Nov 21, 2026
149f059
clazel-js-regexp: shorter Miri runs for the differential and the cata…
atiernan Nov 21, 2026
347f36c
xtask: an ENGINE list, so engine crates reach no browser crate
atiernan Nov 21, 2026
88a03e3
clazel-js: the embedding API contract (phase 7.8, contract first)
atiernan Nov 21, 2026
ce0ef3a
clazel-jit: A64 templates for straight-line integer LIR, proven; emit…
atiernan Nov 21, 2026
60a4617
clazel-js-heap: size the collector's long tests for Miri
atiernan Nov 21, 2026
553edb8
clazel-dom: prove pre-insert, replace, replace all, clone, adopt and …
atiernan Nov 21, 2026
9733f46
clazel-dom: executable pre-insert, replace, replace all, clone, adopt…
atiernan Nov 21, 2026
70c8090
clazel-js-syntax: proven early errors for catch clauses
atiernan Nov 21, 2026
b0255e8
clazel-jit: A64 mutation kills with certificates; proof robustness
atiernan Nov 21, 2026
bdf6738
clazel-dom: certified mutations for the new operations, clippy fixes,…
atiernan Nov 21, 2026
7dad680
clazel-jit: the statements for control flow, memory instructions and …
atiernan Nov 21, 2026
60b3cb5
clazel-jit: composition over then, block and loop (x86-64), proven; t…
atiernan Nov 21, 2026
601442c
clazel-jit: br and br_if leaves and the condition test, proven
atiernan Nov 21, 2026
5aeb0dc
clazel-jit: if, the induction over every templated node, exit with op…
atiernan Nov 21, 2026
772f07f
clazel-css: bombs timing test uses the least of several runs per size
atiernan Nov 21, 2026
b306205
clazel tests: run the process-heavy browse_gpu tests one at a time, w…
atiernan Nov 21, 2026
d8cc9be
clazel-dom: state the children rules of DOM 4.2.3 steps 5 and 6 as a …
atiernan Nov 21, 2026
3a151b2
clazel-jit: the control-flow slice's imports under cfg(verus_only); t…
atiernan Nov 21, 2026
c5040cd
clazel-dom: prove steps 5 and 6 of pre-insert and replace validity en…
atiernan Nov 21, 2026
59e4665
clazel-dom: certified mutations of steps 5 and 6 of pre-insert and re…
atiernan Nov 21, 2026
a191418
clazel-treebuilder spec: the fragment context says whether it is in a…
atiernan Nov 21, 2026
5483d4d
clazel-treebuilder: ExecContext::in_form, fragment conformance for bo…
atiernan Nov 21, 2026
d8b3f9f
clazel-web: HTML fragment serialization (HTML 13.3) and innerHTML rou…
atiernan Nov 21, 2026
c58d56d
clazel-web: pin its workspace dependencies
atiernan Nov 21, 2026
9a40acb
Phase 7.6: state linear marking and the collection of shapes and keys…
atiernan Nov 21, 2026
9a563cc
xtask: skip the vendored-IDL parse test under Miri (it reads files)
atiernan Nov 21, 2026
89b5fd1
clazel-dom: split and give headroom to the two validity lemmas that r…
atiernan Nov 21, 2026
2e9e02f
clazel-jit: the J.10 front end's statement (bytecode refines step, as…
atiernan Nov 21, 2026
c18d38e
clazel-jit: front end lowerings of handler ops, moves, constants and …
atiernan Nov 21, 2026
2b4b75a
clazel-jit: check 40 generated programs under Miri, not 3000
atiernan Nov 21, 2026
3808562
clazel-dom: tighten the solver budget of lemma_pre_insert_violation s…
atiernan Nov 21, 2026
17ca5f3
clazel-jit: front end lowerings of small-integer add, sub and mul, pr…
atiernan Nov 21, 2026
34e9312
Phase 7.6: linear ephemeron marking, and collecting interned keys and…
atiernan Nov 21, 2026
f4766dc
clazel-jit: front end docs, certified mutations, qualified paths
atiernan Nov 21, 2026
815e5e3
clazel-js-heap: size the shape and key checks for Miri
atiernan Nov 21, 2026
d7f0d4c
clazel-dom: spec and contract of deep clone a node (relation, rollbac…
atiernan Nov 21, 2026
19066e9
clazel-jit: verify with the front end in scope, and make one certific…
atiernan Nov 21, 2026
4d3bd3f
Merge claude/jit-x64-backend into claude/jit-a64-backend (Miri size f…
atiernan Nov 21, 2026
e628c23
J.10: f64_of_int on int32s is order-preserving and injective, and ToI…
atiernan Nov 21, 2026
6bc61a0
J.10: lower and prove the int32 comparisons (Lt, Le, Gt, Ge, StrictEq…
atiernan Nov 21, 2026
b92fdda
clazel-js-regexp: Script, Script_Extensions and string-property tables
atiernan Nov 21, 2026
c6c8f7a
clazel-js-regexp: match Script, Script_Extensions and properties of s…
atiernan Nov 21, 2026
d9b96c1
Merge claude/jit-a64-backend into claude/jit-control-memory (Miri siz…
atiernan Nov 21, 2026
8040602
J.10: lower and prove the int32 bitwise ops and shifts (BitAnd, BitOr…
atiernan Nov 21, 2026
1834f6d
clazel-js-regexp: shorter Miri run for the scripts-and-strings differ…
atiernan Nov 21, 2026
7dcf4e2
J.10: lower and prove Inc, Dec, Neg and BitNot on int32s
atiernan Nov 21, 2026
6242e02
J.10: lower and prove Not, JumpIfTrue and JumpIfFalse on booleans and…
atiernan Nov 21, 2026
0d0d3a5
clazel-jit: preserved-forgets-the-stack-pointer is killed incidentall…
atiernan Nov 21, 2026
4e06f56
J.10: certified mutations for the second slice's lowerings
atiernan Nov 21, 2026
5772010
clazel-js-regexp: skip the RGI_Emoji union under Miri in the matching…
atiernan Nov 21, 2026
0f7dd11
J.10: lower and prove UShr on int32s; header of the front end; rlimits
atiernan Nov 21, 2026
e4df411
clazel-js-regexp: a stride over scripts under Miri
atiernan Nov 21, 2026
86f02aa
clazel-dom: deep clone a node as a worklist, proven against the relat…
atiernan Nov 21, 2026
809b1f3
clazel-web: name the round-trip test conformance_* so the suite line …
atiernan Nov 21, 2026
162fbcd
clazel-web: querySelector, querySelectorAll, matches and closest
atiernan Nov 22, 2026
9f37232
clazel-dom: eleven certified mutations of the deep clone relation's c…
atiernan Nov 22, 2026
6ddcc26
GPU process: fix glibc's arena limit, so a new thread cannot open a f…
atiernan Nov 22, 2026
9ac3d17
Host log: say where the call is named when a process dies of SIGSYS
atiernan Nov 22, 2026
94169e7
clazel-js-lexer: independent transcription from UAX #31 and Annex A, …
atiernan Nov 22, 2026
8e2e5e1
clazel-js-lexer: 15 more certified mutation kills, one per testable t…
atiernan Nov 22, 2026
e8977cb
clazel-js-lexer: Test262 conformance suites
atiernan Nov 22, 2026
7e735fc
clazel-dom: contract of deep clone: refused only if the copy does not…
atiernan Nov 22, 2026
eb77eea
clazel-js-lexer: import the independent transcription under cfg(verus…
atiernan Nov 22, 2026
105930a
Merge main into claude/js-api-contract
atiernan Nov 22, 2026
d7dc93c
clazel-js: skip the DefaultHost test under Miri (system clock, OS ran…
atiernan Nov 22, 2026
7eb69ce
clazel-dom: prove a deep clone adds exactly subtree_size nodes and is…
atiernan Nov 22, 2026
f93d7bc
clazel-jit: the statement for memory instructions and br_table: they …
atiernan Nov 22, 2026
80491e2
clazel-jit: templates for memory instructions and br_table (spec func…
atiernan Nov 22, 2026
dd221da
clazel-dom: twelve certified mutations of the deep clone size and ref…
atiernan Nov 22, 2026
ce35956
clazel-js-lexer exec: punctuators and plain comments proven maximal a…
atiernan Nov 22, 2026
98109c9
clazel-js-lexer exec: numeric literals proven: kind, flags, longest
atiernan Nov 22, 2026
34e4d74
clazel-js-lexer exec: string literals proven: SV, derivation, longest
atiernan Nov 22, 2026
c572200
clazel-js-lexer exec: document what is proven and what is open
atiernan Nov 22, 2026
d2d0298
clazel-js-lexer exec: newline_before is exactly the line terminators …
atiernan Nov 22, 2026
f7ea649
clazel-jit: bounds_check, load, store and br_table refine LIR (x86-64…
atiernan Nov 22, 2026
9d81a7f
clazel-jit: certified mutations for the memory and br_table templates…
atiernan Nov 22, 2026
8f6c862
clazel-jit: header and docs for the memory, br_table and emitter slice
atiernan Nov 22, 2026
81b7b14
clazel-js-lexer exec: longest match across the proven kinds, and the …
atiernan Nov 22, 2026
b28be05
clazel-js-lexer exec: what is proven and what is open, templates' con…
atiernan Nov 22, 2026
9125055
clazel-codecheck: the A64 confinement theorem, stated (J.6)
atiernan Nov 21, 2026
8454de3
clazel-codecheck: the A64 confinement theorem, proven (J.6)
atiernan Nov 21, 2026
9e05921
clazel-js-lexer: generate ID_Start and ID_Continue as indexed row acc…
atiernan Nov 22, 2026
ee4f715
clazel-js-lexer spec: ID_Start/ID_Continue as the Unicode 18 table; t…
atiernan Nov 22, 2026
253f5d9
clazel-js-lexer: prove the Unicode lookups are the spec's predicates
atiernan Nov 22, 2026
e309d33
clazel-js-lexer spec: import the table accessors for Verus only
atiernan Nov 22, 2026
d8a02f6
clazel-js-lexer: Unicode anchors, mutations and an independent table …
atiernan Nov 22, 2026
1e85b6c
clazel-js-lexer exec: identifiers and private identifiers proven; num…
atiernan Nov 22, 2026
46b60a8
clazel-web: cut the selector tests down under Miri to fit the time limit
atiernan Nov 22, 2026
82705c9
clazel-js-lexer: TemplateCharacters extend at the end and end uniquel…
atiernan Nov 22, 2026
4f007a9
clazel-js-vm: spec NewRegExp
atiernan Nov 21, 2026
b345b1e
clazel-js-vm: spec the ops for generators, async functions and for await
atiernan Nov 21, 2026
3d1bc94
clazel-js-vm: spec the ops for with, direct eval and delete of a vari…
atiernan Nov 21, 2026
8ec8f07
clazel-js-vm: compile regex literals, generators and async, with, dir…
atiernan Nov 21, 2026
a32f59d
clazel-js-vm: tests of the third compiler slice
atiernan Nov 21, 2026
7140eca
clazel-js-vm: spec GetImportBinding, ImportCall, ImportMeta and Direc…
atiernan Nov 21, 2026
6e40fc4
clazel-js-vm: compile modules, import(), import.meta and the remainin…
atiernan Nov 21, 2026
f786b79
clazel-js-vm: tests of the fourth compiler slice
atiernan Nov 21, 2026
2e0941b
clazel-js-lexer exec: scan_template_escape proven to produce a spec T…
atiernan Nov 22, 2026
ddac2f8
clazel-js-lexer exec: scan_template proven to return the one template…
atiernan Nov 22, 2026
8902d26
clazel-js-lexer exec: template literals join the proven kinds
atiernan Nov 22, 2026
ebd9bc1
clazel-jit: the control-flow emitter proven equal to ctmpl (emit_cf_b…
atiernan Nov 22, 2026
11411d3
clazel-jit: certified mutations for the emitter's limits; docs say th…
atiernan Nov 22, 2026
fe97552
clazel-js-lexer exec: silence an unused binding in a plain build
atiernan Nov 22, 2026
a36d4e4
clazel-js-lexer exec: discharge the unproven-kinds hypothesis away fr…
atiernan Nov 22, 2026
aaaa681
clazel-jit: the statement for A64 control flow, memory instructions a…
atiernan Nov 22, 2026
4138d1e
clazel-treebuilder: rlimit headroom for proofs that unfold the DOM's …
atiernan Nov 22, 2026
7eef784
clazel-js-lexer: ASCII-witness mutations for the ID_Start/ID_Continue…
atiernan Nov 22, 2026
dae7741
clazel-selectors spec: :scope, and a scoping root (Option<NodeId>) fo…
atiernan Nov 22, 2026
f43e0f8
clazel-jit: A64 control-flow composition (then, block, loop, if) and …
atiernan Nov 22, 2026
90018e1
Merge main into claude/js-heap-elements
atiernan Nov 22, 2026
03d1cf9
Merge claude/js-heap-elements into claude/js-heap-gc
atiernan Nov 22, 2026
800c191
Merge claude/js-heap-gc into claude/js-heap-gc-2
atiernan Nov 22, 2026
035f4e5
xtask: the ENGINE test's unlisted crate is a name no real crate has
atiernan Nov 22, 2026
04f0fa3
clazel-treebuilder: hide DOM insert and remove in four proofs instead…
atiernan Nov 22, 2026
6938d1c
clazel-selectors: :scope in the parser, the matcher and the proofs, w…
atiernan Nov 22, 2026
472c222
clazel-jit: A64 bounds_check, load, store and br_table refine LIR (pr…
atiernan Nov 22, 2026
b7ecf60
clazel-jit: A64 control-flow emitter proven equal to the templates; t…
atiernan Nov 22, 2026
6dd68ac
clazel-selectors: more rlimit for the two proofs that the scoping arg…
atiernan Nov 22, 2026
5c48961
clazel-jit: headers say the A64 control-flow, memory and emitter slic…
atiernan Nov 22, 2026
5f3eb27
clazel-js-lexer: prove regexp literals (scan_regexp, scan_regexp_class)
atiernan Nov 22, 2026
be926a7
clazel-js-lexer: certified mutations for regexp character boundaries
atiernan Nov 22, 2026
98e9106
Merge claude/jit-a64-backend into claude/jit-frontend
atiernan Nov 22, 2026
356f242
Merge claude/jit-frontend into claude/jit-frontend-2
atiernan Nov 22, 2026
7dc8a3d
clazel-json: independent transcription from RFC 8259, proven equivalent
atiernan Nov 21, 2026
936915a
clazel-js-lexer: verify line-terminator-adds-nel in module equivalence
atiernan Nov 22, 2026
348c078
clazel-js-lexer: Annex B HTML-like comments proven in the executable …
atiernan Nov 22, 2026
229ba74
clazel-js-lexer: next_token meets its contract; ExecLexer implements …
atiernan Nov 22, 2026
2e49b60
clazel-js-vm: the interpreter loop and first op handlers (7.8, first …
atiernan Nov 22, 2026
fc518c0
clazel-jit: the x86-64 control-flow emitter's blob is accepted by the…
atiernan Nov 22, 2026
d7c2fdf
clazel-js-vm: Kani harnesses for the interpreter's int32 arithmetic a…
atiernan Nov 22, 2026
6b81a12
clazel-jit: the A64 control-flow emitter's blob is accepted by the va…
atiernan Nov 22, 2026
f1910f6
clazel-js-vm: ToPrimitive, native constructors, intrinsics, bound fun…
atiernan Nov 22, 2026
ec8bf79
clazel-js-builtins: Object, Function, Error, Boolean, Number, String,…
atiernan Nov 22, 2026
5324cfb
clazel-js-syntax: rustfmt
atiernan Nov 22, 2026
33ab883
clazel-jit: steadier hints so the acceptance proofs verify in the who…
atiernan Nov 22, 2026
7bd3787
clazel-js-lexer: certified mutations for Annex B comments; keep ID_St…
atiernan Nov 22, 2026
6cb08f5
clazel-dom: the contracts under which raw insert and reparent keep ho…
atiernan Nov 22, 2026
9572f6f
clazel-dom: every operation keeps host_acyclic
atiernan Nov 22, 2026
cd99719
clazel-js-builtins: keep Math.pow's exact-value cases out of Miri, wh…
atiernan Nov 22, 2026
420573f
clazel-dom: isolate the host_acyclic proofs in their own solver runs
atiernan Nov 22, 2026
eb4b4f1
clazel-js-heap: raise to tier 1
atiernan Nov 22, 2026
a1c1f4b
clazel-js-vm: check exact powf results only natively
atiernan Nov 22, 2026
1992ffc
clazel-js-builtins: every third case under Miri
atiernan Nov 22, 2026
073f59e
Merge claude/js-interpreter into claude/js-builtins
atiernan Nov 22, 2026
f035601
Merge main into claude/js-api-contract
atiernan Nov 22, 2026
1507659
xtask: clazel-js-number and clazel-json join ENGINE
atiernan Nov 22, 2026
af3445a
Merge claude/dom-treebuilder-fix-2 (#261) into treebuilder-stack-inva…
atiernan Nov 22, 2026
7e7bfa5
Add four Kani harnesses for Big on two limbs and correct the proofs h…
atiernan Nov 22, 2026
f19c83b
clazel-js-number: array-backed FixedBig for the exact Number paths
atiernan Nov 22, 2026
7b1bd79
clazel-js-syntax: add Kani harnesses (Tier 1 groundwork)
atiernan Nov 22, 2026
c7b746a
clazel-treebuilder: the invariants that rule out a cycle through a te…
atiernan Nov 22, 2026
a79dc73
clazel-treebuilder: two proofs out of the way of new modules
atiernan Nov 22, 2026
d3f39a1
clazel-treebuilder: every reachable parser's document is host_acyclic
atiernan Nov 22, 2026
171f16f
clazel-treebuilder: a certified mutation of the template start tag's …
atiernan Nov 22, 2026
bbd19b1
Phase 7.14: DOM event dispatch (clazel-web)
atiernan Nov 22, 2026
ad8260e
J.11: the code cache, budgets and tiering policy (first slice)
atiernan Nov 22, 2026
6c7d4b3
Phase 7.14/7.15: the event loop, microtasks and timers (clazel-web)
atiernan Nov 22, 2026
3cd6d19
Merge #223 (clazel-js contract) into js-builtins; list clazel-js-buil…
atiernan Nov 22, 2026
927cadd
clazel-ipc spec: 7.16's FetchScript, UpdateUrl, ScriptResponse, Scrip…
atiernan Nov 22, 2026
556294b
Phase 7.8: an embedder slot in the VM, and DefinePropertyOrThrow public
atiernan Nov 22, 2026
908ae39
Phase 7.8: clazel-js, the embedding API implemented (first part)
atiernan Nov 22, 2026
f590b50
clazel-js-number: Kani harnesses for FixedBig and StringToNumber on b…
atiernan Nov 22, 2026
2290542
clazel-ipc: codec, lemmas, examples, tests and mutations for 7.16's m…
atiernan Nov 22, 2026
7ac82d4
clazel-kernel spec: 7.16's FetchScript, and theorem_script_fetch_shap…
atiernan Nov 22, 2026
216433c
clazel-kernel: FetchScript proven (fetch_sub, exec, theorem_script_fe…
atiernan Nov 22, 2026
7ebc3f4
clazel-js: a smaller heap limit in limits_are_the_embedders under Mir…
atiernan Nov 22, 2026
baaf361
WIP clazel-js-vm: array exotic objects, unfinished and untested
atiernan Nov 22, 2026
11fda43
Merge remote-tracking branch 'origin/claude/web-event-loop' into clau…
atiernan Nov 22, 2026
a84b908
Merge remote-tracking branch 'origin/claude/treebuilder-stack-invaria…
atiernan Nov 22, 2026
9f2f0cc
Merge remote-tracking branch 'origin/claude/js-lexer-html-comments' i…
atiernan Nov 22, 2026
19ca5f6
Merge remote-tracking branch 'origin/claude/js-compiler-modules' into…
atiernan Nov 22, 2026
8813d2c
Merge remote-tracking branch 'origin/claude/js-regexp-props' into cla…
atiernan Nov 22, 2026
f87d1fa
Merge remote-tracking branch 'origin/claude/js-heap-gc-2' into claude…
atiernan Nov 22, 2026
17566de
Merge remote-tracking branch 'origin/claude/js-api-contract' into cla…
atiernan Nov 22, 2026
f836aa8
Merge remote-tracking branch 'origin/claude/gpu-sigsys-arena-limit' i…
atiernan Nov 22, 2026
7a23c6b
Merge remote-tracking branch 'origin/claude/webidl-generator' into cl…
atiernan Nov 22, 2026
ed2ce31
Merge remote-tracking branch 'origin/claude/json-independent' into cl…
atiernan Nov 22, 2026
37f49e8
Merge remote-tracking branch 'origin/claude/selectors-scope' into cla…
atiernan Nov 22, 2026
da5162c
Merge remote-tracking branch 'origin/claude/js-heap-tier-1' into clau…
atiernan Nov 22, 2026
3ef655d
Merge remote-tracking branch 'origin/claude/js-number-kani' into clau…
atiernan Nov 22, 2026
a6d0b6c
Merge remote-tracking branch 'origin/claude/js-syntax-kani' into clau…
atiernan Nov 22, 2026
d9ba1cd
Merge remote-tracking branch 'origin/claude/a64-confinement' into cla…
atiernan Nov 22, 2026
bebfed6
Merge remote-tracking branch 'origin/claude/parser-codecheck' into cl…
atiernan Nov 22, 2026
e2afc70
Merge remote-tracking branch 'origin/ci/reliable-browse-and-css-timin…
atiernan Nov 22, 2026
3620490
Merge remote-tracking branch 'origin/claude/jit-code-cache' into clau…
atiernan Nov 22, 2026
d5eba66
Merge remote-tracking branch 'origin/claude/jit-frontend-2' into clau…
atiernan Nov 22, 2026
723e1a9
Merge remote-tracking branch 'origin/claude/js-builtins' into claude/…
atiernan Nov 22, 2026
9b2e2ba
xtask: clazel-js-builtins joins ENGINE
atiernan Nov 22, 2026
016b2b1
clazel-js-vm: the interpreter meets the compiler's third slice
atiernan Nov 22, 2026
fc5b4dc
Merge remote-tracking branch 'origin/claude/js-api-impl' into claude/…
atiernan Nov 22, 2026
6dd8d1e
clazel-js-vm, clazel-js-builtins: array exotic objects, Array and Arr…
atiernan Nov 22, 2026
d8917a9
clazel-js-vm: trailing elisions of an array literal set the length; t…
atiernan Nov 22, 2026
1dcf5d7
clazel-js-builtins: JSON.parse and JSON.stringify over clazel-json
atiernan Nov 22, 2026
74629cb
clazel-js-vm, clazel-js-builtins: clippy and doc fixes, Cargo.lock
atiernan Nov 22, 2026
426c670
clazel-ipc mutations: re-anchor two stale find strings on is_from_ren…
atiernan Nov 22, 2026
2b174eb
Merge remote-tracking branch 'origin/claude/js-number-array-big' into…
atiernan Nov 22, 2026
6bf1737
Merge remote-tracking branch 'origin/claude/kernel-script-fetch' into…
atiernan Nov 22, 2026
7d03d05
clazel-js-builtins: every eighth array and JSON case under Miri
atiernan Nov 22, 2026
76c4c08
Integration fixes: :scope in clazel-web, and a missing eval in Test262
atiernan Nov 22, 2026
f9b046a
Merge remote-tracking branch 'origin/claude/js-builtins-array-json' i…
atiernan Nov 22, 2026
ffbafce
Test262 runners: S7.4_A5 is a known gap until eval exists
atiernan Nov 22, 2026
File filter

Filter by extension

Filter by extension


Conversations
Failed to load comments.
Loading
Jump to
The table of contents is too big for display.
Diff view
Diff view
  •  
  •  
  •  
41 changes: 41 additions & 0 deletions Cargo.lock

Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.

2 changes: 1 addition & 1 deletion crates/clazel-codecheck/Cargo.toml
Original file line number Diff line number Diff line change
Expand Up @@ -4,7 +4,7 @@ version = "0.0.0"
edition.workspace = true
license.workspace = true
publish.workspace = true
description = "The JIT's code validators (docs/phases/jit.md item J.6), the x86-64 one and the A64 one: what an accepted code blob is, the contract of the validator, and the executable validator, proven sound and complete against the spec. The second x86-64 validator (dataflow) is there, proven sound, and the x86-64 confinement theorem (exit criterion 2) is stated and proven in confine; A64's confinement proof does not exist yet."
description = "The JIT's code validators (docs/phases/jit.md item J.6), the x86-64 one and the A64 one: what an accepted code blob is, the contract of the validator, and the executable validator, proven sound and complete against the spec. The second x86-64 validator (dataflow) is there, proven sound, and the confinement theorem (exit criterion 2) is stated once and proven for x86-64 and for A64 in confine."

[dependencies]
vstd = "=0.0.0-2026-10-04-0306"
Expand Down
300 changes: 300 additions & 0 deletions crates/clazel-codecheck/src/confine/a64/chain.rs
Original file line number Diff line number Diff line change
@@ -0,0 +1,300 @@
//! **Unit starts and their facts** (A64): what an accepted blob's scan guarantees,
//! phrased for the machine-level invariant. The units the scan takes from
//! instruction 0 ([`chain_facts`]) are the positions the invariant allows;
//! every entry and jump target is one, with no facts; each such unit has a
//! recognized shape and fits in the blob; the unit after one is again one.

#[allow(unused_imports)]
use super::spec::*;
#[allow(unused_imports)]
use vstd::prelude::*;

verus! {

/// The 4 bytes of the canonical encoding of `i` (kept opaque so that the
/// large `encode` is unfolded only where it must be).
#[verifier::opaque]
pub open spec fn word_of(i: Instr) -> Seq<u8> {
word_bytes(encode(i))
}

/// **What a configuration the sandbox may hand over says**, without the
/// large `encode` unfolded: the blob is the words [`word_of`] of the
/// instructions, which are valid, the policy holds, and the layout is
/// disjoint and below `2^47`.
pub proof fn lemma_cfg(c: Cfg)
requires
cfg_ok(c),
ensures
policy(c.ins, c.entries),
all_valid(c.ins),
c.blob.len() == 4 * c.ins.len(),
word_of_len(),
forall|j: int|
0 <= j < c.ins.len() ==> c.blob.subrange(4 * j, 4 * j + 4) == #[trigger] word_of(
c.ins[j],
),
c.bases.len() == abi::num_regions(),
c.bounds.len() == abi::num_regions(),
0 <= c.code,
c.code % 4 == 0,
c.code + c.blob.len() <= lim(),
0 <= c.ctx,
c.ctx + abi::ctx_size() <= lim(),
disjoint(c.code, c.blob.len() as int, c.ctx, abi::ctx_size()),
forall|k: int| 0 <= k < abi::num_regions() ==> #[trigger] region_ok(c, k),
0 <= c.sp < p2(64),
0 <= c.lr < p2(64),
disjoint(c.lr, 1, c.code, c.blob.len() as int),
{
reveal(cfg_ok);
reveal(word_of);
assert(decodes_to(c.blob, c.ins));
assert forall|j: int| 0 <= j < c.ins.len() implies c.blob.subrange(4 * j, 4 * j + 4)
== #[trigger] word_of(c.ins[j]) by {
assert(c.blob.subrange(4 * j, 4 * j + 4) == word_bytes(encode(c.ins[j])));
}
}

/// Every [`word_of`] has 4 bytes.
pub open spec fn word_of_len() -> bool {
forall|i: Instr| #[trigger] word_of(i).len() == 4
}

/// The proof of [`word_of_len`].
pub proof fn lemma_word_of_len()
ensures
word_of_len(),
{
reveal(word_of);
}

/// Forgetting twice is forgetting once.
pub proof fn lemma_forgotten_idem(c: Cfg, j: int, fs: Facts)
ensures
forgotten(c, j, forgotten(c, j, fs)) == forgotten(c, j, fs),
{
}

/// A fact list reached at a unit start is already forgotten there, and the
/// facts reached by continuing from `j` to `t2` are the ones reached by
/// continuing from `t`.
pub proof fn lemma_chain_append(c: Cfg, j: int, fs: Facts, t: int, f: Facts, t2: int)
requires
0 <= j <= t <= t2,
chain_facts(c, j, fs, t) == Some(f),
ensures
f == forgotten(c, t, f),
chain_facts(c, j, fs, t2) == chain_facts(c, t, f, t2),
decreases t - j,
{
let fs0 = forgotten(c, j, fs);
if j == t {
assert(f == fs0);
lemma_forgotten_idem(c, j, fs);
} else {
let u = unit_at(c.ins, j, fs0)->Some_0;
assert(unit_at(c.ins, j, fs0) is Some);
assert(u.len >= 1 && j + u.len <= t);
lemma_chain_append(c, j + u.len, u.facts, t, f, t2);
}
}

/// The facts at the next unit start: the unit's facts, forgotten there.
pub proof fn lemma_next_start(c: Cfg, t: int, f: Facts, u: Unit)
requires
start_facts(c, t) == Some(f),
0 <= t < c.ins.len(),
unit_at(c.ins, t, f) == Some(u),
u.len >= 1,
ensures
start_facts(c, t + u.len) == Some(forgotten(c, t + u.len, u.facts)),
{
lemma_chain_append(c, 0, no_facts(), t, f, t + u.len);
lemma_forgotten_idem(c, t, f);
reveal_with_fuel(chain_facts, 2);
assert(forgotten(c, t, f) == f);
assert(chain_facts(c, t, f, t + u.len) == Some(forgotten(c, t + u.len, u.facts)));
}

/// The scan from a reached unit start is the scan with the facts of that
/// start.
pub proof fn lemma_scan_reach(c: Cfg, j: int, fs: Facts, t: int, f: Facts)
requires
0 <= j <= t < c.ins.len(),
scan(c.ins, all_targets(c.ins, c.entries), j, fs) is Some,
chain_facts(c, j, fs, t) == Some(f),
ensures
scan(c.ins, all_targets(c.ins, c.entries), t, f) is Some,
decreases t - j,
{
let tg = all_targets(c.ins, c.entries);
let fs0 = forgotten(c, j, fs);
reveal_with_fuel(scan, 2);
if j == t {
lemma_forgotten_idem(c, j, fs);
assert(forgotten(c, t, f) == f);
} else {
let u = unit_at(c.ins, j, fs0)->Some_0;
lemma_scan_reach(c, j + u.len, u.facts, t, f);
}
}

/// **Every reached unit start has a unit that fits in the blob.**
pub proof fn lemma_unit_ok(c: Cfg, t: int, f: Facts)
requires
cfg_ok(c),
start_facts(c, t) == Some(f),
0 <= t < c.ins.len(),
ensures
unit_at(c.ins, t, f) is Some,
unit_at(c.ins, t, f)->Some_0.len >= 1,
t + unit_at(c.ins, t, f)->Some_0.len <= c.ins.len(),
{
let tg = all_targets(c.ins, c.entries);
lemma_cfg(c);
assert(policy(c.ins, c.entries));
assert(scan(c.ins, tg, 0, no_facts()) is Some);
lemma_scan_reach(c, 0, no_facts(), t, f);
lemma_chain_append(c, 0, no_facts(), t, f, t);
reveal_with_fuel(scan, 2);
assert(forgotten(c, t, f) == f);
}

/// Every offset the scan lists as a unit start is a unit start that the
/// chain from `j` reaches.
pub proof fn lemma_scan_chain_starts(c: Cfg, j: int, fs: Facts, x: int)
requires
0 <= j,
scan(c.ins, all_targets(c.ins, c.entries), j, fs) is Some,
seq_has(scan(c.ins, all_targets(c.ins, c.entries), j, fs)->Some_0, x),
ensures
exists|t: int|
j <= t < c.ins.len() && x == start_of(c.ins, t) && chain_facts(c, j, fs, t) is Some,
decreases c.ins.len() - j,
{
let tg = all_targets(c.ins, c.entries);
reveal_with_fuel(scan, 2);
if j < c.ins.len() {
let here = start_of(c.ins, j);
let fs0 = forgotten(c, j, fs);
let u = unit_at(c.ins, j, fs0)->Some_0;
let rest = scan(c.ins, tg, j + u.len, u.facts)->Some_0;
crate::a64::acc_lemmas::lemma_seq_has_concat(seq![here], rest, x);
crate::a64::acc_lemmas::lemma_seq_has_single(here, x);
if x != here {
lemma_scan_chain_starts(c, j + u.len, u.facts, x);
let t = choose|t: int|
j + u.len <= t < c.ins.len() && x == start_of(c.ins, t) && chain_facts(
c,
j + u.len,
u.facts,
t,
) is Some;
assert(chain_facts(c, j, fs, t) is Some);
} else {
assert(chain_facts(c, j, fs, j) is Some);
}
}
}

/// **Every entry and every jump target is a reached unit start.**
pub proof fn lemma_targets_are_starts(c: Cfg, x: int)
requires
cfg_ok(c),
seq_has(all_targets(c.ins, c.entries), x),
ensures
exists|t: int|
0 <= t < c.ins.len() && x == start_of(c.ins, t) && start_facts(c, t) is Some,
{
let tg = all_targets(c.ins, c.entries);
let starts = scan(c.ins, tg, 0, no_facts())->Some_0;
lemma_cfg(c);
assert(policy(c.ins, c.entries));
crate::a64::acc_lemmas::lemma_subset_elim(tg, starts, x);
lemma_scan_chain_starts(c, 0, no_facts(), x);
}

/// An entry is a target of the scan.
pub proof fn lemma_entry_in_targets(c: Cfg, e: int)
requires
seq_has(c.entries, e),
ensures
seq_has(all_targets(c.ins, c.entries), e),
{
crate::a64::acc_lemmas::lemma_seq_has_concat(c.entries, jump_targets(c.ins, 0), e);
}

/// The jump targets of `ins[j'..]` include the target of the jump at `j`.
pub proof fn lemma_jump_target_from(ins: Seq<Instr>, j0: int, j: int, x: int)
requires
0 <= j0 <= j < ins.len(),
jump_rel(ins[j]) is Some,
x == start_of(ins, j) + jump_rel(ins[j])->Some_0,
ensures
seq_has(jump_targets(ins, j0), x),
decreases j - j0,
{
crate::a64::validate::lemma_jump_targets_step(ins, j0);
let here: Seq<int> = match jump_rel(ins[j0]) {
Some(r) => seq![start_of(ins, j0) + r],
None => Seq::empty(),
};
if j0 == j {
crate::a64::acc_lemmas::lemma_seq_has_concat(here, jump_targets(ins, j0 + 1), x);
crate::a64::acc_lemmas::lemma_seq_has_single(x, x);
} else {
lemma_jump_target_from(ins, j0 + 1, j, x);
crate::a64::acc_lemmas::lemma_seq_has_concat(here, jump_targets(ins, j0 + 1), x);
}
}

/// **The target of every direct jump of the blob is a reached unit start**
/// (so it is where a unit begins, and what the scan knows there is nothing).
pub proof fn lemma_jump_target_is_start(c: Cfg, j: int)
requires
cfg_ok(c),
0 <= j < c.ins.len(),
jump_rel(c.ins[j]) is Some,
ensures
({
let x = start_of(c.ins, j) + jump_rel(c.ins[j])->Some_0;
exists|t: int|
0 <= t < c.ins.len() && x == start_of(c.ins, t) && start_facts(c, t) is Some
&& start_facts(c, t)->Some_0 == no_facts()
}),
{
let x = start_of(c.ins, j) + jump_rel(c.ins[j])->Some_0;
lemma_jump_target_from(c.ins, 0, j, x);
crate::a64::acc_lemmas::lemma_seq_has_concat(c.entries, jump_targets(c.ins, 0), x);
lemma_targets_are_starts(c, x);
let t = choose|t: int|
0 <= t < c.ins.len() && x == start_of(c.ins, t) && start_facts(c, t) is Some;
// The facts at a target are `no_facts()`: forgotten.
let f = start_facts(c, t)->Some_0;
lemma_chain_append(c, 0, no_facts(), t, f, t);
assert(seq_has(all_targets(c.ins, c.entries), start_of(c.ins, t)));
assert(f == forgotten(c, t, f));
assert(f == no_facts());
}

/// An entry is a unit start with no facts.
pub proof fn lemma_entry_is_start(c: Cfg, e: int)
requires
cfg_ok(c),
seq_has(c.entries, e),
ensures
exists|t: int|
0 <= t < c.ins.len() && e == start_of(c.ins, t) && start_facts(c, t) is Some
&& start_facts(c, t)->Some_0 == no_facts(),
{
lemma_entry_in_targets(c, e);
lemma_targets_are_starts(c, e);
let t = choose|t: int|
0 <= t < c.ins.len() && e == start_of(c.ins, t) && start_facts(c, t) is Some;
let f = start_facts(c, t)->Some_0;
lemma_chain_append(c, 0, no_facts(), t, f, t);
assert(f == forgotten(c, t, f));
}

} // verus!
Loading
Loading