Share This Author
Making Smart Contracts Smarter
- Loi Luu, D. Chu, Hrishi Olickel, P. Saxena, Aquinas Hobor
- Computer ScienceIACR Cryptol. ePrint Arch.
- 24 October 2016
This paper investigates the security of running smart contracts based on Ethereum in an open distributed network like those of cryptocurrencies, and proposes ways to enhance the operational semantics of Ethereum to make contracts less vulnerable.
S3: syntax- and semantic-guided repair synthesis via programming by examples
- Xuan-Bach D. Le, D. Chu, D. Lo, Claire Le Goues, W. Visser
- Computer ScienceESEC/SIGSOFT FSE
- 21 August 2017
This work presents S3, a new repair synthesis engine that leverages programming-by-examples methodology to synthesize high-quality bug repairs and compares S3’s repair effectiveness with state-of-the-art synthesis engines Angelix, Enumerative, and CVC4.
Progressive Reasoning over Recursively-Defined Strings
A progressive search algorithm to not only mitigate the problem of non-terminating reasoning but also guide the search towards a “minimal solution” when the input formula is in fact satisfiable.
S3: A Symbolic String Solver for Vulnerability Detection in Web Applications
This work presents S3, a new symbolic string solver that employs a new algorithm for a constraint language that is expressive enough for widespread applicability and demonstrates both its robustness and its efficiency against the state-of-the-art.
Automatic induction proofs of data-structures in imperative programs
A proof method which – beyond U+M – performs automatic formula re-writing by treating previously encountered obligations in each proof path as possible induction hypotheses, and can automatically reason about a new class of formulas arising from practical program verification.
Symbolic simulation on complicated loops for WCET Path Analysis
This work addresses the Worst-Case Execution Time (WCET) Path Analysis problem for bounded programs, formalized as discovering a tight upper bound of a resource variable by adopting a brute-force strategy by simply unrolling loops.
Model Counting for Recursively-Defined Strings
This work presents a new algorithm for model counting of a class of string constraints that includes length constraints on the string expressions, which means, by requiring reasoning about numbers, that the class faces a multi-sorted logic.
JFIX: semantics-based repair of Java programs via symbolic PathFinder
JFix is presented, a semantics-based APR framework that targets Java, and is designed to be sufficiently generic to support a variety of such techniques, and supports the claim that the framework can both support developers seeking semantics- based repair of bugs in Java programs, as well as enable larger scale empirical studies comparing syntactic- and semantics-Based APR targeting Java.
A Complete Method for Symmetry Reduction in Safety Verification
The key idea is to perform symmetric transformations on state interpolation, a concept which has been used widely for pruning in SMT and CEGAR and which naturally favors "quite symmetric" systems.
A Framework to Synergize Partial Order Reduction with State Interpolation
This work addresses the problem of reasoning about interleavings in safety verification of concurrent programs with a framework that synergistically combines POR with state interpolation so that the sum is more than its parts.