17 citations · 39 across the 12 of their papers we have counts for
4 papers · 1 filter
DynamiTe: Dynamic Termination and Non-termination Proofs
Ton Chanh Le, Timos Antonopoulos, Parisa Fathololumi +2
There is growing interest in termination reasoning for non-linear programs and, meanwhile, recent dynamic strategies have shown they are able to infer invariants for such challengi…
SoK: All You Ever Wanted to Know About x86/x64 Binary Disassembly But Were Afraid to Ask
Chengbin Pang, Ruotong Yu, Yaohui Chen +4
Disassembly of binary code is hard, but necessary for improving the security of binary software. Over the past few decades, research in binary disassembly has produced many tools a…
Program Verification via Predicate Constraint Satisfiability Modulo Theories
Hiroshi Unno, Yuki Satake, Tachio Terauchi +1
This paper presents a verification framework based on a new class of predicate Constraint Satisfaction Problems called pCSP where constraints are represented as clauses modulo firs…
Reducing Commutativity Verification to Reachability with Differencing Abstractions
Eric Koskinen, Kshitij Bansal
Commutativity of data structure methods is of ongoing interest, with roots in the database community. In recent years commutativity has been shown to be a key ingredient to enablin…