Proof generation for CFG optimizations (Block coalescing and pruning of unreachable blocks) #10
Conversation
This file contains 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
copying of unoptimized blocks to be done
…anup, still need to run and check all examples
the previous versoin used explicit symbols, which cannot be parsed by Isabelle's command line tool
# Conflicts: # Source/ProofGeneration/BoogieIsaInterface/IsaBoogieTerm.cs
…gardless of labels
…neration of the before-phase programs
in particular need not be an Isabelle identifier
…y produce membership lemmas even if no phase correctness proofs are generated
…erge_cfg_opt_adjust_interface into cfg_optimizations This change includes the changes from the adjust_interface branch and initial adjustments to incorporate support for unique constants. Unique constants are now generated as part of a procedure. Proofs work only if there are no unique constants, but the used procedure correctness already takes unique constants into account (i.e., previous proofs that worked now instantiate the unique constants with the empty list because those examples do not have unique constants). # Conflicts: # Source/ProofGeneration/AstToCfg/AstToCfgEndToEnd.cs # Source/ProofGeneration/CFGOptimizations/CFGOptimizationsEndToEnd.cs # Source/ProofGeneration/ProofGenerationLayer.cs
…on of code Note that since the code has changed, the filtering leads to slightly different results than earlier versions because different Boogie versions have different conditions for rejecting (or for outputting data about) a program.
…gnoreFile) annotation Isabelle already defines the name xor. It would be good to change the proof generation to not use reserved Isabelle names in the first place so that such renamings are not required when generating proofs.
…sors In such a case a new block is added between the predecessor and the loop head. This new block asserts the invariant.
… loop head set representation in a to-be-applied lemma differs from loop head set lemma in proof goal (even after applying the simplifier on the proof goal)
…bpl to avoid Isabelle Lit clash
README minor
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.
No description provided.