runtimeverification / runtimeverification/haskell-backend
Non-terminating simplifications
Nobody has claimed this yet.
- Dominant language
- Haskell
- Stars
- 224
- Forks
- 43
- PR merge metrics
- No merged PRs in 30d
Description
WIth the activation of syntactic checks post-simplification (which I think are important), the booster simplifications appear to no longer be terminating, or at least completing in tractable times. I'm attaching a bug report and an output transcript for a proof run with
--kore-rpc-command='kore-rpc-booster -l Aborts --equation-max-recursion 1 --no-post-exec-simplify --solver-transcript new-solver --log-context "*booster*simplify*'
just to provide the backend team with a request to start from. I will try to investigate now what happens when the maximal recursion depth is set to 2 and report here.
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by reviewing the syntactic checks post-simplification change in pull request 3870 and reproduce the proof run with the provided kore-rpc-booster command. Inspect new-report.tar.gz and new-transcript.txt, then compare recursion-depth behavior. Done means booster simplifications terminate or complete in tractable time without disabling the post-simplification checks.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- haskell
- Domain
- backend
- Issue type
- Bug
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 30/100