forked from maxime-esa/asn1scc
-
Notifications
You must be signed in to change notification settings - Fork 1
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
Precise bitindex #23
Merged
Merged
Precise bitindex #23
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
…ponding read function readNLeastSignificantBits - add read function readNBitsLSBFirst which is the counter part of appendBitsLSBFirst, and proved its post condition - proved additional postcondition of appendBitsLSBFirst, to prepare the invertabilitsy proof
…of bits specification, in place of the array of UByte
…ion (i.e. functions that read the bitstream and returns Then proves the equivalence between checkBits and the list specs
* verified appendNBits and appendNBitsLoops * remove lemma call * working on the verification of bitstream * - proved invertability of appendNLeastSignificantBits with its corresponding read function readNLeastSignificantBits - add read function readNBitsLSBFirst which is the counter part of appendBitsLSBFirst, and proved its post condition - proved additional postcondition of appendBitsLSBFirst, to prepare the invertabilitsy proof * verify invertibility appendBitsLSBFirst, with its corresponding lemma * working on proving appendBitsMSBFirstLoop, before moving to the list of bits specification, in place of the array of UByte * proved invertibility of appendBitsMSBFirst but with a List specification (i.e. functions that read the bitstream and returns Then proves the equivalence between checkBits and the list specs * verification script + stainless conf * verified BitStream * verify the by write functions * finish bitstream verification * make verification quicker for some VCs, in test
Conflicts: BackendAst/DAstACN.fs FrontEndAst/AcnEncodingClasses.fs FrontEndAst/DAst.fs
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.
This PR includes (only for Scala backend):
BitStream
while
loops are transformed to recursive top-level functionsSEQUENCE ... OF
and strings are now backed byVector
and not an array