GAP-8: A RISC-V SoC for AI at the Edge of the IoT

E Flamand, D Rossi, F Conti, I Loi… - 2018 IEEE 29th …, 2018 - ieeexplore.ieee.org
Current ultra-low power smart sensing edge devices, operating for years on small batteries,
are limited to low-bandwidth sensors, such as temperature or pressure. Enabling the next …

Oddfuzz: Discovering java deserialization vulnerabilities via structure-aware directed greybox fuzzing

S Cao, B He, X Sun, Y Ouyang, C Zhang… - … IEEE Symposium on …, 2023 - ieeexplore.ieee.org
Java deserialization vulnerability is a severe threat in practice. Researchers have proposed
static analysis solutions to locate candidate vulnerabilities and fuzzing solutions to generate …

Safe memory-leak fixing for c programs

Q Gao, Y Xiong, Y Mi, L Zhang, W Yang… - 2015 IEEE/ACM 37th …, 2015 - ieeexplore.ieee.org
Automatic bug fixing has become a promising direction for reducing manual effort in
debugging. However, general approaches to automatic bug fixing may face some …

Graspan: A single-machine disk-based graph system for interprocedural static analyses of large-scale systems code

K Wang, A Hussain, Z Zuo, G Xu… - ACM SIGARCH Computer …, 2017 - dl.acm.org
There is more than a decade-long history of using static analysis to find bugs in systems
such as Linux. Most of the existing static analyses developed for these systems are simple …

Compositional information flow analysis for WebAssembly programs

Q Stiévenart, C De Roover - 2020 IEEE 20th International …, 2020 - ieeexplore.ieee.org
WebAssembly is a new W3C standard, providing a portable target for compilation for various
languages. All major browsers can run WebAssembly programs, and its use extends beyond …

Recursive state machine guided graph folding for context-free language reachability

Y Lei, Y Sui, SH Tan, Q Zhang - … of the ACM on Programming Languages, 2023 - dl.acm.org
Context-free language reachability (CFL-reachability) is a fundamental framework for
program analysis. A large variety of static analyses can be formulated as CFL-reachability …

Optimal Dyck reachability for data-dependence and alias analysis

K Chatterjee, B Choudhary… - Proceedings of the ACM on …, 2017 - dl.acm.org
A fundamental algorithmic problem at the heart of static analysis is Dyck reachability. The
input is a graph where the edges are labeled with different types of opening and closing …

Automatic building of java projects in software repositories: A study on feasibility and challenges

F Hassan, S Mostafa, ESL Lam… - 2017 ACM/IEEE …, 2017 - ieeexplore.ieee.org
Despite the advancement in software build tools such as Maven and Gradle, human
involvement is still often required in software building. To enable large-scale advanced …

Change-aware build prediction model for stall avoidance in continuous integration

F Hassan, X Wang - 2017 ACM/IEEE International Symposium …, 2017 - ieeexplore.ieee.org
Continuous Integration (CI) is a widely used development practice where developers
integrate their work after submitting code changes at central repository. CI servers usually …

Fast graph simplification for interleaved-dyck reachability

Y Li, Q Zhang, T Reps - ACM Transactions on Programming Languages …, 2022 - dl.acm.org
Many program-analysis problems can be formulated as graph-reachability problems.
Interleaved Dyck language reachability (InterDyck-reachability) is a fundamental framework …