WebMay 22, 2024 · SymInfer: Inferring Numerical Invariants using Symbolic States pp. 197-201. SynTest-Solidity: Automated Test Case Generation and Fuzzing for Smart Contracts pp. 202-206. Synthia: a Generic and Flexible Data Structure Generator pp. 207-211. WebFeb 19, 2024 · In the SymInfer paper, read from the beginning of Section 5 up to (and including) 5B: Analyzing Program Correctness to see how the experiment was done. Run dig on some of the NLA programs several times , e.g., CohenDiv, Ps4, etc so that you have a feel on what the results would look like.
Experiment-Java programs · Issue #2 · dynaroars/dig · GitHub
WebMar 26, 2024 · A representation invariant is a property that holds of all values of abstract type produced by a module. Representation invariants play important roles in software engineering and program verification. WebWe demonstrate the implementation and usage of SymInfer, a tool that automatically discovers numerical invariants using concrete and symbolic states collected from dynamic and symbolic executions. SymInfer supports expressive invariants under various forms, including nonlinear equalities, octagonal inequalities, and disjunctive min/max invariants. randal bays attorney conroe tx
ThanhVu H. Nguyen - Google Scholar
WebMay 24, 2024 · Abstract: We demonstrate the implementation and usage of SymInfer, a tool that automatically discovers numerical invariants using concrete and symbolic states … WebAug 24, 2024 · In [8, 10], we introduce SymInfer, a technique that targets the inference of rich forms of numerical invariants using symbolic program states captured by a symbolic … WebWhile being interesting, SymInfer’s polynomial equalities are just too strict to capture the complexity of most programs. For example, unless the value of the counter variable is exactly equal to 2, Syminfer cannot compute the necessary equality to conclude that the program has a quadratic complexity. randal booth