-
Updated
May 22, 2020 - Rust
formal-methods
Here are 172 public repositories matching this topic...
-
Updated
Mar 19, 2020
After #829, it is all squashed on a single line. One option is to pass it through rustfmt, but we should make sure that's not adding too much compilation time. Also that would only work on nightly (I think) so if we ever want to switch to stable it may be a problem.
This almost immediately follows from the mean value theorem.
-
Updated
May 8, 2020
-
Updated
May 7, 2020
Consider changing warnings "found topics with non-existent parents"
into errors, just as we already treat broken links as errors. A
simple fix might be to replace the following code in the definition of
function save-json-files, in file books/xdoc/save-fancy.lisp.
(or (not orphans)
(cw "~|~%WARNING: found topics with non-existent parents:~%~x0~%These ~
-
Updated
Jul 1, 2019 - Ada
The TlaDocumentSymbolsProvider stumbles on operators while parsing constants and doesn't report them as model symbols. As a result, const operator names don't appear in the outline panel and in completion suggestions. Such operators also prevent parsing of the following constants.
A simple case:
CONSTANT Foo(_), BarNeither Foo nor Bar makes it to the model symbols list
We believe that the term “normal weak residual” is more appropriate than the term “standard weak residual”. The term “normal weak residual” is being used already in @jeltsch’s WFLP ’19 contribution. Our goal is to switch to this term in identifiers and documentation.
"A Process Calculus for Formal
-
Updated
May 15, 2020 - OCaml
-
Updated
Apr 30, 2020 - C
-
Updated
Sep 16, 2019 - Scala
-
Updated
Feb 17, 2020 - Python
Description
Only partial satisfiable spec for square root function in Web documentation.
Steps to Reproduce
Documentation on http://overturetool.org/languages/
Text:
"For example, a function SQRT for calculating a square root of a natural number might be defined as follows: ... "
Expected behavior:
A general satisfiable specification defines an eps > 0 for the distanc
-
Updated
Jun 25, 2015 - LLVM
-
Updated
Apr 16, 2020 - Haskell
The following model is accepted by TorXakis:
PROCDEF p [Input1, Input2 :: Int; Output :: Int] () ::=
Input1 ? x
>-> Input2 ? y [[ x <> y ]]
>-> Output ! x + y | Input1 ?x | Input2 ?y [[ x == y ]]
>-> Output ! x + y
>-> STOP
ENDDEF
CHANDEF chans ::= Input1,Input2, Output :: Int ENDDEF
MODELDEF M ::=
CHAN IN Input1, Input2
CHAN OUT Output
SY
When building the IP sniffer test, I forgot to run Verify_Message before checking Structural_Valid_Message. While this was not a correctness issue (the context of cause was invalid), it took me some time to realize that. I wonder if we should add a predicate to those convenience operations that work on a whole message that states/requires that a verification has been attempted on a context. Th
-
Updated
Apr 29, 2020 - OCaml
-
Updated
Nov 26, 2017 - C#
For example, if two alpha-equivalent nodes appear twice in the same path, probably something has gone wrong.
We can improve the accuracy of pruning by developing assertions on the log/path.
-
Updated
Apr 18, 2020 - Python
-
Updated
Aug 1, 2019 - Coq
-
Updated
Mar 12, 2019 - Haskell
-
Updated
May 19, 2020 - TeX
-
Updated
Mar 16, 2020 - Reason
-
Updated
Mar 10, 2020 - SMT
Improve this page
Add a description, image, and links to the formal-methods topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the formal-methods topic, visit your repo's landing page and select "manage topics."
How do I include the Hacl* library in the
libfolder when extracting my code to OCaml?Currently I am stuck with this, which can extract successfully for F* codes only using the F* libraries.