activity
20172020
most citedSoK: All You Ever Wanted to Know About x86/x64 Binary Disassembly But Were Afraid to Ask

7 citations · 14 across the 4 of their papers we have counts for

collaborators

5 papers

cs.CR20207 cited

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…

cs.PL20206 cited

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…

cs.PL20201 cited

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…

cs.PL2019

Specification and Inference of Trace Refinement Relations

Timos Antonopoulos, Eric Koskinen, Ton-Chanh Le

Modern software is constantly changing. Researchers and practitioners are increasingly aware that verification tools can be impactful if they embrace change through analyses that a…

cs.DC2017

Adding Concurrency to Smart Contracts

Thomas Dickerson, Paul Gazzillo, Maurice Herlihy +1

Modern cryptocurrency systems, such as Ethereum, permit complex financial transactions through scripts called smart contracts. These smart contracts are executed many, many times,…