-
The implementations of compositional verification for Java and LLVM overlap to a very significant degree. We've put a good deal of effort into factoring out common code, with some success, but I expec…
-
At the moment, x86 verification is possible but requires writing proof scripts in Haskell code. Exposing that infrastructure in a way similar to `crucible_llvm_verify` would significantly reduce the e…
atomb updated
2 years ago
-
This issue summarises the problems that exist when it comes to connecting the outcome of running`setUp` functions (and contract constructors) with the initial states of their associated tests, in sym…
-
## Formal verification
1. [Modular, Compositional, and Executable Formal Semantics for LLVM IR](https://dl.acm.org/doi/pdf/10.1145/3473572)
2. [Alive2: Bounded Translation Validation for LLVM](https…
-
We currently raise a verification error if the arguments to a `calloc` call overflow when multiplied together. This, probably, is incorrect. The consensus seems to be that `calloc` should return `NU…
-
[to be updated]
- RedLeaf: https://www.ics.uci.edu/~aburtsev/doc/redleaf-hotos19.pdf
- https://link.springer.com/article/10.1007/s13389-019-00216-4
-
## Background
**Definition**
- **Verifiable outsourced computation**: designing protocols where it is impossible for a provider to cheat.
- **Incentive-based verifiable computation**: cheating is…
-
When processing SAWCore terms that will be injected into the symbolic simulator, the current default behavior is to generate a fresh What4 symbolic variable to represent that term and record this bind…
-
When educating clients in this work, I've always said that verifying a VP includes verifying the VCs entailed within.
However, Section 3.3.2 https://w3c-ccg.github.io/vc-api/#verify-presentation do…
-
TLA+ has unbounded integers, which Apalache translates to SMT integers. We have seen examples where the actual set of integers is quite small. Nevertheless, z3 has to solve equations over LIA.
Cons…