Skip to content
Discussion options

You must be logged in to vote

In my opinion, the Leftpad example does not demonstrate any strong features of TLA+/Quint and Apalache. It needs a purely functional specification that does plenty of iterative computations. No wonder that all proof systems shine there. As for SMT, the Dafny spec is nice and simple. Will's encoding is using the theory of strings, which is working here well, too. F* proof also looks nice and simple.

Is there any realistic use case that would motivate us to further think about that? Leftpad is a typical example of verifying simple sequential code using Hoare logic.

Replies: 1 comment 1 reply

Comment options

You must be logged in to vote
1 reply
@bugarela
Comment options

bugarela Apr 30, 2025
Maintainer Author

Answer selected by bugarela
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Category
Q&A
Labels
None yet
2 participants