Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Refactor abstract consensus specification #6475

Merged
merged 4 commits into from
Sep 27, 2024
Merged

Conversation

lemmy
Copy link
Contributor

@lemmy lemmy commented Sep 12, 2024

  • Refactor (simplify) TypeOK to use (more concise) Sequences!Seq operator.
  • Define InitialLogs less explicitly.
  • Add assumptions about abs.tla's constants (TLAPS will likely need those assumptions should we attempt writing a proof).
  • Mitigate state-space explosion during explicit-state model checking by declaring constant Servers to be symmetric.

@lemmy lemmy added the tla TLA+ specifications label Sep 12, 2024
@lemmy lemmy marked this pull request as ready for review September 18, 2024 04:35
@lemmy lemmy requested a review from a team as a code owner September 18, 2024 04:35
@achamayou
Copy link
Member

@lemmy could you add a short description to the PR capture its goal(s)? The overall impression I get from the commit is that this is trying to simplify things, but it adds a net 34 lines.

tla/consensus/abs.tla Outdated Show resolved Hide resolved
@lemmy
Copy link
Contributor Author

lemmy commented Sep 18, 2024

@lemmy could you add a short description to the PR capture its goal(s)? The overall impression I get from the commit is that this is trying to simplify things, but it adds a net 34 lines.

  • Align spec with CCF by replacing global upper bound MaxLogLength with MaxUncommittedCount (see max_uncommitted_tx_count in raft.h) that restricts the length by which a log may be extended in each step.

  • Move refinement mapping from TLC-specific module into ccfraft. Clearly, refinement mapping belongs in ccfraft, but we couldn't do that up until recently because of a limitation in TLC)

  • Refactor (simplify) TypeOK to use (more concise) Sequences!Seq operator.

  • Define InitialLogs less explicitly.

  • Add assumptions about abs.tla's constants (TLAPS will likely need those assumptions should we attempt writing a proof).

  • Mitigate state-space explosion during explicit-state model checking by declaring constant Servers to be symmetric.

  • Limit the global length of all logs to 7 during model checking (maintains the checked state space).

I propose not to squash the commits.

@lemmy lemmy force-pushed the mku-abs branch 2 times, most recently from 14d63f5 to 80fc286 Compare September 18, 2024 20:00
tla/consensus/abs.tla Outdated Show resolved Hide resolved
tla/consensus/abs.tla Outdated Show resolved Hide resolved
Copy link
Member

@heidihoward heidihoward left a comment

Choose a reason for hiding this comment

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

I'm good for this to be merged once the ci is green.

I would suggest double checking the impact of refinement checking on the ci times for consensus with reconfiguration once its finishing properly

@lemmy
Copy link
Contributor Author

lemmy commented Sep 26, 2024

I'm good for this to be merged once the ci is green.

I would suggest double checking the impact of refinement checking on the ci times for consensus with reconfiguration once its finishing properly

I removed all commits with semantic changes from this PR. Will continue with those in a separate PR, after this has moved through the merge queue.

@lemmy lemmy added this pull request to the merge queue Sep 26, 2024
@github-merge-queue github-merge-queue bot removed this pull request from the merge queue due to no response for status checks Sep 27, 2024
@lemmy lemmy merged commit 6fb0b5f into microsoft:main Sep 27, 2024
17 checks passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
tla TLA+ specifications
Projects
None yet
Development

Successfully merging this pull request may close these issues.

3 participants