How about bug-triggering paths?-understanding and characterizing learning-based vulnerability detectors
Machine learning and its promising branch deep learning have proven to be effective in a
wide range of application domains. Recently, several efforts have shown success in …
wide range of application domains. Recently, several efforts have shown success in …
Recursive state machine guided graph folding for context-free language reachability
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 …
program analysis. A large variety of static analyses can be formulated as CFL-reachability …
PEARL: A Multi-Derivation Approach to Efficient CFL-Reachability Solving
Context-free language (CFL) reachability is a fundamental framework for formulating
program analyses. CFL-reachability analysis works on top of an edge-labeled graph by …
program analyses. CFL-reachability analysis works on top of an edge-labeled graph by …
Dynamic Transitive Closure-Based Static Analysis through the Lens of Quantum Search
Many existing static analysis algorithms suffer from cubic bottlenecks because of the need to
compute a dynamic transitive closure (DTC). For the first time, this article studies the …
compute a dynamic transitive closure (DTC). For the first time, this article studies the …
Context-Free Language Reachability via Skewed Tabulation
Context-free language reachability (CFL-reachability) is a prominent model for formulating
program analysis problems. Almost all CFL-reachability algorithms are based on the Reps …
program analysis problems. Almost all CFL-reachability algorithms are based on the Reps …
Iterative-Epoch Online Cycle Elimination for Context-Free Language Reachability
Context-free language reachability (CFL-reachability) is a fundamental framework for
implementing various static analyses. CFL-reachability utilizes context-free grammar (CFG) …
implementing various static analyses. CFL-reachability utilizes context-free grammar (CFG) …
Mutual Refinements of Context-Free Language Reachability
S Ding, Q Zhang - International Static Analysis Symposium, 2023 - Springer
Context-free language reachability is an important program analysis framework, but the
exact analysis problems can be intractable or undecidable, where CFL-reachability …
exact analysis problems can be intractable or undecidable, where CFL-reachability …
Better Not Together: Staged Solving for Context-Free Language Reachability
Context-free language reachability (CFL-reachability) is a fundamental formulation for
program analysis with many applications. CFL-reachability analysis is computationally …
program analysis with many applications. CFL-reachability analysis is computationally …
Two Birds with One Stone: Multi-Derivation for Fast Context-Free Language Reachability Analysis
Context-free language (CFL) reachability is a fundamental framework for formulating
program analyses. CFL-reachability analysis works on top of an edge-labeled graph by …
program analyses. CFL-reachability analysis works on top of an edge-labeled graph by …
Vulnerability Detection via Typestate-Guided Code Representation Learning
X Cheng - International Conference on Formal Engineering …, 2023 - Springer
Abstract Machine learning, including deep learning, has found success in various domains.
Recently, the focus has shifted to using deep learning, like graph neural networks, for static …
Recently, the focus has shifted to using deep learning, like graph neural networks, for static …