Skip to content
GitLab
Menu
Projects
Groups
Snippets
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
Menu
Open sidebar
Benoit Viguier
coq-verif-tweetnacl
Commits
93a90727
Commit
93a90727
authored
Feb 04, 2020
by
Benoit Viguier
Browse files
formalizm
parent
3aebe807
Changes
1
Hide whitespace changes
Inline
Side-by-side
paper/4.1-VST.tex
View file @
93a90727
...
...
@@ -148,7 +148,7 @@ This solution does not generate all the possible cases of aliasing over 3 pointe
To make the verification the smoothest, the Coq formal definition of the function
should be as close as possible to the C implementation behavior.
Optimizations of such definitions are often counter-productive as they increase the
amount of proofs required for
\eg
bounds checking, loops invariants
\ldots
.
amount of proofs required for
\eg
bounds checking, loops invariants.
In order to further speed-up the verification process, to prove the specification
\TNaCle
{
crypto
_
scalarmult
}
, we only need the specification of the subsequently
...
...
Write
Preview
Supports
Markdown
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment