Conversation
Copy link
Copy Markdown
Member
Sorry, something went wrong.
lemmy
force-pushed
the
mku-flash
branch
2 times, most recently
from
321c79c to
6873785
Compare
August 18, 2026 15:16
lemmy
marked this pull request as ready for review
August 18, 2026 15:16
Model checking covers one node count at a time. CMP method of Chou, Mannava and Park proposed the following workaround: keep a few nodes concrete, summarize the rest in one abstract node Other, and add rules that over-approximate what it may do. The abstraction is pushed into FlashWithMutexCMP. TLAPS can prove the protocol for every constant value. Thus, a proof should not have to carry rules that exist to make one node count stand for all of them, nor should a reader of the protocol -- and both were carrying them, as ABS_* rules interleaved with the protocol's own, an Env_o conjunct in every UNCHANGED list, and NodeU widened by Other throughout. Co-authored-by: Claude Opus 5 <noreply@anthropic.com> Signed-off-by: Markus Alexander Kuppe <github.com@lemmster.de>
Qian-Cheng-nju
pushed a commit
to specula-org/tlaps-bench
that referenced
this pull request
Aug 18, 2026
Upstream tlaplus/Examples#226 moves the Murphi model's CMP Other-node abstraction into a separate FlashWithMutexCMP.tla. That abstraction exists so that model checking one node count stands for all of them; TLAPS proves the protocol for every constant value, so its ABS_* rules, the Env_o conjunct in every UNCHANGED list, and the Other-widened NodeU were only ever noise in a proof target -- and noise interleaved with the protocol's own actions. The benchmark tracks the protocol alone. All 17 theorem statements are unchanged, so the targets are the same; the regenerated model drops 268 lines and nine Defs files lose the ABS_* actions and the fairness conjuncts that existed to keep them live.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Model checking covers one node count at a time. CMP method of Chou, Mannava and Park proposed the following workaround: keep a few nodes concrete, summarize the rest in one abstract node Other, and add rules that over-approximate what it may do. The abstraction is pushed into FlashWithMutexCMP.
TLAPS can prove the protocol for every constant value. Thus, a proof should not have to carry rules that exist to make one node count stand for all of them, nor should a reader of the protocol -- and both were carrying them, as ABS_* rules interleaved with the protocol's own, an Env_o conjunct in every UNCHANGED list, and NodeU widened by Other throughout.