Yao Guo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Yao Guo has a total of 152 co-authors. Here are the top co-authors by number of shared publications:
- Ding Li
Key Laboratory of High-Confidence Software Technologies (MOE), School of Computer Science, Peking University, Beijing, China
28 shared publications - Xiangqun Chen
Peking University, Beijing, China
20 shared publications Xiangqun Chen
School of Computer Science Key Laboratory of High-Confidence Software Technologies (MOE) Peking University
11 shared publications- Ziqi Zhang
Department of Computer Science, University of Illinois Urbana-Champaign, Urbana, IL, USA
11 shared publications - Haoyu Wang
Huazhong University of Science and Technology, Wuhan, China
10 shared publications - Yifeng Cai
Peking University, Beijing, China
7 shared publications
Latest Publications
- 1 November 2026
- Published by Springer Nature
- p. 506-536
No Data? No Problem: Synthesizing Security Graphs for Better Intrusion Detection
- 1 November 2026
- Published by Springer Nature
- p. 506-536
No Data? No Problem: Synthesizing Security Graphs for Better Intrusion Detection
- Open Access
- 7 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 3908-3919
Towards Reliable Alarm Flood Reduction in Data Center via Grammar-Guided Verifiable LLM Reasoning
- 7 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 3908-3919
Open AccessTowards Reliable Alarm Flood Reduction in Data Center via Grammar-Guided Verifiable LLM Reasoning
- Open Access
- 1 October 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Software Engineering
- Vol. 3  (ISSTA) , 1649-1671
SymWeb: Feedback-Driven Context Exploration and Context-Aware Symbolic Execution for Browser-Embedded WebAssembly Vulnerability Detection
Browser-deployed WebAssembly (Wasm) modules often inherit memory-safety bugs from C and C++-style code, yet exploiting, and even reaching, these bugs in the Web threat model is fundamentally context-dependent. JavaScript (JS) controls the exported-call schedule and constructs the Wasm entry state, including arguments, globals, and linear-memory layouts, from attacker-influenced web inputs. This makes both Wasm-only analysis, which assumes static initial states, and prior browser-based testing such as Wemby ineffective. Wemby generates a fixed, Wasm-agnostic context pool and then only mutates Wasm parameters, which limits its ability to systematically reach deeper, Wasm-relevant contexts and gated behaviors. We present SymWeb, a feedback-driven closed-loop system that links external inputs to browser-reachable JS-induced Wasm contexts and then to context-aware Wasm symbolic execution. SymWeb couples an Feedback-driven Context Generator with an Context-Aware Wasm Symbolic Executor. The Feedback-driven Context Generator performs binary rewriting for ASan-like checks and observability, collects contexts in the browser, and uses Influence-guided Mutation to steer web inputs. The symbolic executor clusters and symbolizes contexts, performs coverage-guided symbolic execution under reachable entry states, and returns actionable constraints to steer the next online round. We evaluate SymWeb on 30 real-world Wasm-enabled websites. Under our Web threat model, SymWeb verifies 17 exploitable vulnerabilities and achieves 72.8% average Wasm basic-block coverage. Compared to the browser-based baseline Wemby, SymWeb finds 8 more verified vulnerabilities and improves coverage by 19.9 percentage points. Compared to the Wasm-only baseline WASEM, SymWeb finds 14 more verified vulnerabilities and improves coverage by 40.4 percentage points. Overall, these results show that closing the loop between browser-reachable context generation and context-aware Wasm analysis substantially improves both vulnerability-finding effectiveness and exploration depth in real Web environments.
- 1 October 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Software Engineering
- Vol. 3  (ISSTA) , 1649-1671
Open AccessSymWeb: Feedback-Driven Context Exploration and Context-Aware Symbolic Execution for Browser-Embedded WebAssembly Vulnerability Detection
Browser-deployed WebAssembly (Wasm) modules often inherit memory-safety bugs from C and C++-style code, yet exploiting, and even reaching, these bugs in the Web threat model is fundamentally context-dependent. JavaScript (JS) controls the exported-call schedule and constructs the Wasm entry state, including arguments, globals, and linear-memory layouts, from attacker-influenced web inputs. This makes both Wasm-only analysis, which assumes static initial states, and prior browser-based testing such as Wemby ineffective. Wemby generates a fixed, Wasm-agnostic context pool and then only mutates Wasm parameters, which limits its ability to systematically reach deeper, Wasm-relevant contexts and gated behaviors. We present SymWeb, a feedback-driven closed-loop system that links external inputs to browser-reachable JS-induced Wasm contexts and then to context-aware Wasm symbolic execution. SymWeb couples an Feedback-driven Context Generator with an Context-Aware Wasm Symbolic Executor. The Feedback-driven Context Generator performs binary rewriting for ASan-like checks and observability, collects contexts in the browser, and uses Influence-guided Mutation to steer web inputs. The symbolic executor clusters and symbolizes contexts, performs coverage-guided symbolic execution under reachable entry states, and returns actionable constraints to steer the next online round. We evaluate SymWeb on 30 real-world Wasm-enabled websites. Under our Web threat model, SymWeb verifies 17 exploitable vulnerabilities and achieves 72.8% average Wasm basic-block coverage. Compared to the browser-based baseline Wemby, SymWeb finds 8 more verified vulnerabilities and improves coverage by 19.9 percentage points. Compared to the Wasm-only baseline WASEM, SymWeb finds 14 more verified vulnerabilities and improves coverage by 40.4 percentage points. Overall, these results show that closing the loop between browser-reachable context generation and context-aware Wasm analysis substantially improves both vulnerability-finding effectiveness and exploration depth in real Web environments.
- Open Access
- 1 October 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Software Engineering
- Vol. 3  (ISSTA) , 1401-1423
WASCII: Bridging WebAssembly Specifications and Implementations through LLM-Enhanced Validation
The rapid evolution of WebAssembly (Wasm) has led to significant implementation inconsistencies between its specification and the behavior of various Wasm runtimes, posing critical threats to application reliability and security. Verifying that a runtime's implementation adheres to the natural-language specification is a profound challenge. While Large Language Models offer a promising way to bridge the semantic gap between specification text and source code, their inherent fallibility makes them untrustworthy for direct verification. In this paper, we introduce WASCII, a novel framework for bridging specification and implementation with execution-based validation. Our approach first constructs a Check Tree from the natural-language specification, which captures the validation rules that runtimes must enforce. We then align runtime code to the Check Tree, and employ a Clean Room design with execution-based validation to ensure the correctness of the bridging. The validated test cases are then used for cross-runtime differential testing to identify behavioral inconsistencies. Evaluated on seven major Wasm runtimes, WASCII identified 248 differential behaviors, among which 35 are confirmed as previously unknown specification conformance issues, with 17 confirmed or fixed by developers. These results demonstrate that our approach is a highly effective strategy for discovering subtle yet critical bugs in complex systems.
- 1 October 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Software Engineering
- Vol. 3  (ISSTA) , 1401-1423
Open AccessWASCII: Bridging WebAssembly Specifications and Implementations through LLM-Enhanced Validation
The rapid evolution of WebAssembly (Wasm) has led to significant implementation inconsistencies between its specification and the behavior of various Wasm runtimes, posing critical threats to application reliability and security. Verifying that a runtime's implementation adheres to the natural-language specification is a profound challenge. While Large Language Models offer a promising way to bridge the semantic gap between specification text and source code, their inherent fallibility makes them untrustworthy for direct verification. In this paper, we introduce WASCII, a novel framework for bridging specification and implementation with execution-based validation. Our approach first constructs a Check Tree from the natural-language specification, which captures the validation rules that runtimes must enforce. We then align runtime code to the Check Tree, and employ a Clean Room design with execution-based validation to ensure the correctness of the bridging. The validated test cases are then used for cross-runtime differential testing to identify behavioral inconsistencies. Evaluated on seven major Wasm runtimes, WASCII identified 248 differential behaviors, among which 35 are confirmed as previously unknown specification conformance issues, with 17 confirmed or fixed by developers. These results demonstrate that our approach is a highly effective strategy for discovering subtle yet critical bugs in complex systems.
- Open Access
- 1 October 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Software Engineering
- Vol. 3  (ISSTA) , 4356-4378
WITFuzz: Validity-Preserving Greybox Fuzzing for WebAssembly Interface Type Binding Generators
Modern build pipelines often rely on code generation to turn constraint-rich interface specifications into artifacts for target programming languages. In the WebAssembly component model, binding generators (bindgens) follow this pattern by translating WebAssembly Interface Types (WIT) packages into language-specific bindings that are later compiled with application code. This bindgen step already targets more than ten language ecosystems, and the Rust wit-bindgen crate alone has accumulated tens of millions of downloads. Yet a WIT package may pass WIT validation but still break this build pipeline: bindgens may crash or hang during generation (Phase I), or downstream toolchains may reject the generated bindings even when generation succeeds (Phase II). Testing bindgens at scale is challenging because WIT is strongly typed and constraint-rich, and Phase II failures require language-specific checking. We present WITFuzz, a validity-preserving greybox fuzzer for WIT bindgens. WITFuzz mutates resolved WIT abstract syntax trees via structure-aware rewrites expressed in a small domain-specific language, and propagates correlated updates to maintain WIT validity. When coverage plateaus, WITFuzz expands its strategy pool online using coverage-guided, LLM-assisted DSL synthesis, admitting only strategies that pass local validation. WITFuzz further uses a build-aware, multi-layer oracle that combines in-loop checks with selective asynchronous compilation/typechecking of generated bindings to capture non-crashing build breakers. Across 12 bindgens, WITFuzz improves average edge coverage by 8.3% over standalone wit-smith. It uncovers 40 previously unknown Phase I and Phase II build-breaking bugs, including 35 that are missed by all external baselines.
- 1 October 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Software Engineering
- Vol. 3  (ISSTA) , 4356-4378
Open AccessWITFuzz: Validity-Preserving Greybox Fuzzing for WebAssembly Interface Type Binding Generators
Modern build pipelines often rely on code generation to turn constraint-rich interface specifications into artifacts for target programming languages. In the WebAssembly component model, binding generators (bindgens) follow this pattern by translating WebAssembly Interface Types (WIT) packages into language-specific bindings that are later compiled with application code. This bindgen step already targets more than ten language ecosystems, and the Rust wit-bindgen crate alone has accumulated tens of millions of downloads. Yet a WIT package may pass WIT validation but still break this build pipeline: bindgens may crash or hang during generation (Phase I), or downstream toolchains may reject the generated bindings even when generation succeeds (Phase II). Testing bindgens at scale is challenging because WIT is strongly typed and constraint-rich, and Phase II failures require language-specific checking. We present WITFuzz, a validity-preserving greybox fuzzer for WIT bindgens. WITFuzz mutates resolved WIT abstract syntax trees via structure-aware rewrites expressed in a small domain-specific language, and propagates correlated updates to maintain WIT validity. When coverage plateaus, WITFuzz expands its strategy pool online using coverage-guided, LLM-assisted DSL synthesis, admitting only strategies that pass local validation. WITFuzz further uses a build-aware, multi-layer oracle that combines in-loop checks with selective asynchronous compilation/typechecking of generated bindings to capture non-crashing build breakers. Across 12 bindgens, WITFuzz improves average edge coverage by 8.3% over standalone wit-smith. It uncovers 40 previously unknown Phase I and Phase II build-breaking bugs, including 35 that are missed by all external baselines.
- Open Access
- 30 September 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies
- Vol. 10  (3) , 1-29
GUIA uditor : Enabling Post-hoc Child Safety Forensics via Action-Guided GUI Provenance on Mobile Devices
The proliferation of smart devices exposes children to online risks like grooming and financial scams that are deeply embedded within legitimate applications. Current approaches rely on automated prevention and detection, a paradigm that is fundamentally limited by its inherent fallibility. Whether rule-based or AI-driven, they inevitably produce false positives and negatives, failing to provide reliable protection. In this paper, we argue for a complementary, human-in-the-loop, post-hoc forensic paradigm. We present GUIA uditor , the first system designed to realize this vision by creating GUI Provenance: a queryable, semantic record of a child's interaction sequence. To generate this, GUIA uditor leverages a Multimodal Large Language Model (MLLM) to translate the temporal sequence of GUI events into a human-understandable narrative. To make this practical on mobile devices, a novel evidence distillation pipeline reduces the data requiring analysis by over 89.2% compared to periodic sampling approaches adopted by industry standards, with negligible impact on accuracy. On a new dataset of 295 interaction clips, GUIA uditor achieves a 95.23% Macro-F1 Score in logging significant events and, crucially, its two-stage forensic query engine successfully retrieves the correct evidence as the top result for over 90.20% of natural language questions. An end-to-end evaluation on three modern smartphones shows that the full pipeline, including on-device MLLM inference, adds 2.1W of power draw and 7.4s of per-event latency, with a peak memory footprint of ~3.1GB. These results show that post-hoc GUI forensics can run on modern mobile devices and provide useful context for guardian-led safety review.
- 30 September 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies
- Vol. 10  (3) , 1-29
Open AccessGUIA uditor : Enabling Post-hoc Child Safety Forensics via Action-Guided GUI Provenance on Mobile Devices
The proliferation of smart devices exposes children to online risks like grooming and financial scams that are deeply embedded within legitimate applications. Current approaches rely on automated prevention and detection, a paradigm that is fundamentally limited by its inherent fallibility. Whether rule-based or AI-driven, they inevitably produce false positives and negatives, failing to provide reliable protection. In this paper, we argue for a complementary, human-in-the-loop, post-hoc forensic paradigm. We present GUIA uditor , the first system designed to realize this vision by creating GUI Provenance: a queryable, semantic record of a child's interaction sequence. To generate this, GUIA uditor leverages a Multimodal Large Language Model (MLLM) to translate the temporal sequence of GUI events into a human-understandable narrative. To make this practical on mobile devices, a novel evidence distillation pipeline reduces the data requiring analysis by over 89.2% compared to periodic sampling approaches adopted by industry standards, with negligible impact on accuracy. On a new dataset of 295 interaction clips, GUIA uditor achieves a 95.23% Macro-F1 Score in logging significant events and, crucially, its two-stage forensic query engine successfully retrieves the correct evidence as the top result for over 90.20% of natural language questions. An end-to-end evaluation on three modern smartphones shows that the full pipeline, including on-device MLLM inference, adds 2.1W of power draw and 7.4s of per-event latency, with a peak memory footprint of ~3.1GB. These results show that post-hoc GUI forensics can run on modern mobile devices and provide useful context for guardian-led safety review.
- Open Access
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 693-703
Governing Global ASID/PCID Management for QoS Isolation in Shared-Kernel Mixed-Priority Systems
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 693-703
Open AccessGoverning Global ASID/PCID Management for QoS Isolation in Shared-Kernel Mixed-Priority Systems
- Open Access
- 25 June 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 23  (2) , 1-25
PredComp: Predicting Compiler Optimization Options with Multi-stage Learning
Standard compiler optimization levels, such as -O3 , which provides a fixed optimization strategy for all programs, often fail to deliver the optimal performance. Compiler auto-tuning techniques can deliver substantial speedups, but existing methods present a difficult tradeoff. While dynamic iterative approaches are effective, their requirement for repeated compilation and execution incurs high overhead, which limits their practicality. Conversely, static prediction methods offer a low-overhead alternative. However, they face a vast search space and must comprehensively learn both option-option interactions and option-program feature relationships. To overcome the challenge, we propose PredComp , a novel static framework that leverages the divide and conquer paradigm to predict desired option sets. PredComp decomposes the search space by partitioning options into distinct subspaces based on their relationships, making the prediction problem tractable. It first predicts promising option sub-sets within each subspace, focusing only on intra-subspace option interactions and their preferred program features. Then, it adopts a combination model that aggregates these top-ranked sub-sets, prioritizes inter-subspace option interactions and corresponding features to construct globally desired sets. Experiments on three widely used benchmark suites and one real-world application show that PredComp achieves average speedups of 1.1011× over -O3 with a single prediction. Notably, it achieves performance comparable to dynamic iterative methods while reducing tuning time from hours or days to seconds, thereby making static prediction a practical solution for large-scale and frequently evolving software.
- 25 June 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 23  (2) , 1-25
Open AccessPredComp: Predicting Compiler Optimization Options with Multi-stage Learning
Standard compiler optimization levels, such as -O3 , which provides a fixed optimization strategy for all programs, often fail to deliver the optimal performance. Compiler auto-tuning techniques can deliver substantial speedups, but existing methods present a difficult tradeoff. While dynamic iterative approaches are effective, their requirement for repeated compilation and execution incurs high overhead, which limits their practicality. Conversely, static prediction methods offer a low-overhead alternative. However, they face a vast search space and must comprehensively learn both option-option interactions and option-program feature relationships. To overcome the challenge, we propose PredComp , a novel static framework that leverages the divide and conquer paradigm to predict desired option sets. PredComp decomposes the search space by partitioning options into distinct subspaces based on their relationships, making the prediction problem tractable. It first predicts promising option sub-sets within each subspace, focusing only on intra-subspace option interactions and their preferred program features. Then, it adopts a combination model that aggregates these top-ranked sub-sets, prioritizes inter-subspace option interactions and corresponding features to construct globally desired sets. Experiments on three widely used benchmark suites and one real-world application show that PredComp achieves average speedups of 1.1011× over -O3 with a single prediction. Notably, it achieves performance comparable to dynamic iterative methods while reducing tuning time from hours or days to seconds, thereby making static prediction a practical solution for large-scale and frequently evolving software.
- Open Access
- 15 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 57-69
SymFlow: Event-Chain-Aware Symbolic Execution for Serverless Sensitive Data Flow Detection
- 15 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 57-69
Open AccessSymFlow: Event-Chain-Aware Symbolic Execution for Serverless Sensitive Data Flow Detection
- Open Access
- 15 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 193-206
Bridging the Memory Hotness Gap in Edge Systems with Hotness-Segregated Object Allocation
- 15 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 193-206
Open AccessBridging the Memory Hotness Gap in Edge Systems with Hotness-Segregated Object Allocation