Verification for codecs and generated code #317
Merged
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
* unfold the loop in uint2int for verification, proves invertibility of some functions in ACN * invertibility * script to verify acn used functions * remove useless comments * refactor
…inversion property
…t in body and postcond
Conflicts: BackendAst/DAstACN.fs
Sequence invertibility
Conflicts: FrontEndAst/AcnCreateFromAntlr.fs
Merge with the latest changes
usr3-1415
added a commit
that referenced
this pull request
Dec 15, 2024
This bug was introduced by merging PR #317. The issue caused the ICD tables for sequences, choices, and similar components to be empty when their child components were primitive types.
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 (for the Scala backend only):
BitStreamCodecandACNfor the functions used by the PUS-C services (except floating-point and string-related)whileloops are transformed to recursive top-level functionsSEQUENCE ... OFand strings are now backed by aVectorand not anArraySEQUENCEwhen the-invertibilityoption is specified