Skip to content

safety proof of EWD687a#215

Open
muenchnerkindl wants to merge 1 commit into
masterfrom
ewd687a
Open

safety proof of EWD687a#215
muenchnerkindl wants to merge 1 commit into
masterfrom
ewd687a

Conversation

@muenchnerkindl

Copy link
Copy Markdown
Collaborator

Updated EWD687a according to the changes in the Graphs community module, and contributed a proof of the safety property of the algorithm.

Signed-off-by: Stephan Merz <stephan.merz@loria.fr>
(* there is no need to change upEdge[p] in the Idle subaction. *)
(***************************************************************************)
Idle(p) == /\ active' = [active EXCEPT ![p] = FALSE]
Idle(p) == /\ active[p] \* otherwise this step is subsumed by stuttering

Copy link
Copy Markdown
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I suggest elaborating on why this is an issue.

/\ O.edge # {} => G!IsTreeWithRoot(O, Leader)
\* All nodes of the overlay tree are non-neutral.
/\ N:: \A n \in O.node: ~neutral(n))
\* The original definition includes every node occurring in the tree

Copy link
Copy Markdown
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

The comment about the original definition can likely be omitted.

P3 = P3
\* MV CONSTANT definitions
MaxCounter = 3
Leader = L

Copy link
Copy Markdown
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Only keep Leader or L?

@lemmy lemmy left a comment

Copy link
Copy Markdown
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

LGTM

@lemmy

lemmy commented Jul 20, 2026

Copy link
Copy Markdown
Member

Can the reduction of proof effort be soley attributed to the introduction of GraphTheorems?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Development

Successfully merging this pull request may close these issues.

2 participants