Hongliang Liang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Hongliang Liang has a total of 104 co-authors. Here are the top co-authors by number of shared publications:
- Qiuping Yi
Beijing University of Posts and Telecommunications, Beijing, China
11 shared publications - Da Xiao
Beijing University of Posts and Telecommunications
4 shared publications - Guohao Wu
Beijing University of Posts and Telecommunications, Beijing, China
4 shared publications Jie Liu
4 shared publications- Jie Liu
TSIS Laboratory, Beijing University of Posts and Telecommunications, Beijing, China
3 shared publications - Pengbo Du
Beijing University of Posts and Telecommunications, Beijing, China
3 shared publications
Latest Publications
- Open Access
- 7 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 3114-3126
PELSE: Asymmetric-Evidence-Guided MCU Peripheral Model Synthesis
- 7 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 3114-3126
Open AccessPELSE: Asymmetric-Evidence-Guided MCU Peripheral Model Synthesis
- Open Access
- 1 October 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Software Engineering
- Vol. 3  (ISSTA) , 2840-2861
OptiMine: Scalable and Precise Code Optimization for Android Apps via LLM-Driven Semantic Analysis
As Android applications grow in scale, latent performance issues increasingly degrade user experience and business outcomes, yet systematically identifying optimization opportunities in large codebases remains challenging. We present OptiMine, a hybrid knowledge-to-code framework that integrates large language models (LLMs) with static program analysis to automatically uncover actionable performance optimizations. OptiMine systematically transforms unstructured expert knowledge from documents, commit diffs, and reports into structured Optimization Signatures, enabling reproducible and context-aware program reasoning. These signatures drive scalable candidate retrieval via declarative Datalog queries, while LLM-guided semantic validation performs precise applicability checking, side-effect analysis, and impact-aware ranking. We evaluate OptiMine on a public benchmark and a large industrial Android codebase. The results show that OptiMine achieves higher precision and broader coverage than heuristic- and pattern-based baselines, while scaling effectively to industrial settings. Overall, OptiMine enables reliable and scalable performance auditing, bridging expert knowledge and actionable performance improvements in real-world mobile systems.
- 1 October 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Software Engineering
- Vol. 3  (ISSTA) , 2840-2861
Open AccessOptiMine: Scalable and Precise Code Optimization for Android Apps via LLM-Driven Semantic Analysis
As Android applications grow in scale, latent performance issues increasingly degrade user experience and business outcomes, yet systematically identifying optimization opportunities in large codebases remains challenging. We present OptiMine, a hybrid knowledge-to-code framework that integrates large language models (LLMs) with static program analysis to automatically uncover actionable performance optimizations. OptiMine systematically transforms unstructured expert knowledge from documents, commit diffs, and reports into structured Optimization Signatures, enabling reproducible and context-aware program reasoning. These signatures drive scalable candidate retrieval via declarative Datalog queries, while LLM-guided semantic validation performs precise applicability checking, side-effect analysis, and impact-aware ranking. We evaluate OptiMine on a public benchmark and a large industrial Android codebase. The results show that OptiMine achieves higher precision and broader coverage than heuristic- and pattern-based baselines, while scaling effectively to industrial settings. Overall, OptiMine enables reliable and scalable performance auditing, bridging expert knowledge and actionable performance improvements in real-world mobile systems.
- Open Access
- 4 September 2026
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 58  (15) , 1-35
Detecting Vulnerabilities in Embedded Systems via Taint Analysis: A Survey
Embedded systems are plagued by various security vulnerabilities that can lead to severe attacks. Therefore, it is crucial to detect and mitigate these vulnerabilities quickly and accurately. In this article, we survey existing research on vulnerability detection in embedded systems, with taint analysis as the central perspective. Specifically, we describe and categorize embedded systems, highlight the challenges posed by embedded systems for taint analysis, examine state-of-the-art techniques, and categorize dozens of tools in this field. Our goal is to provide stakeholders with a better understanding of potential solutions to enhance the security and reliability of embedded systems. Finally, we predict and discuss some future directions for taint analysis in embedded systems.
- 4 September 2026
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 58  (15) , 1-35
Open AccessDetecting Vulnerabilities in Embedded Systems via Taint Analysis: A Survey
Embedded systems are plagued by various security vulnerabilities that can lead to severe attacks. Therefore, it is crucial to detect and mitigate these vulnerabilities quickly and accurately. In this article, we survey existing research on vulnerability detection in embedded systems, with taint analysis as the central perspective. Specifically, we describe and categorize embedded systems, highlight the challenges posed by embedded systems for taint analysis, examine state-of-the-art techniques, and categorize dozens of tools in this field. Our goal is to provide stakeholders with a better understanding of potential solutions to enhance the security and reliability of embedded systems. Finally, we predict and discuss some future directions for taint analysis in embedded systems.
- 21 August 2026
- Published by Elsevier in Journal of Systems and Software
- Vol. 243
LeakGuard: Accurate and scalable memory leak detection in real-world projects
- 21 August 2026
- Published by Elsevier in Journal of Systems and Software
- Vol. 243
LeakGuard: Accurate and scalable memory leak detection in real-world projects
- 7 May 2026
- Published by Elsevier in Journal of Systems and Software
- Vol. 240
BinSleuth: Scalable vulnerability discovery in binaries via automated source identification and path optimization
- 7 May 2026
- Published by Elsevier in Journal of Systems and Software
- Vol. 240
BinSleuth: Scalable vulnerability discovery in binaries via automated source identification and path optimization
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 740-751
ViTAL: LLM-Powered Taint Analysis for GUI Field Visualization Auditing in Android
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 740-751
Open AccessViTAL: LLM-Powered Taint Analysis for GUI Field Visualization Auditing in Android
- Open Access
- 10 April 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 10  (OOPSLA1) , 934-958
Efficient Directed Hybrid Fuzzing via Target-Centric Seed Selection and Generation
Software vulnerabilities pose severe security threats, highlighting the need for effective automated detection. Directed hybrid fuzzing, which combines the rapid exploration of fuzz testing with the precise constraint solving of symbolic execution, has made notable advancements in vulnerability discovery. However, existing directed hybrid fuzzing approaches still face two key challenges: (1) inefficient seed selection, leading to inadequate prioritization of optimal inputs for symbolic execution, and (2) inefficient seed generation, resulting in suboptimal seed generation. To address these issues, we propose TACO-Fuzz, TArget-Centric cOncolic Fuzzing, which introduces a two-phase target-centric seed selection strategy to prioritize under-explored paths and a target-centric seed generation approach based on constructing extended path conditions, thereby improving seed quality. Our evaluation on a selected set of public benchmarks shows that TACO-Fuzz can outperform several representative state-of-the-art directed fuzzing tools, achieving up to an average speedup of nearly 10x in reaching target locations, along with comparable improvements in reproducing real-world vulnerabilities. Moreover, TACO-Fuzz contributed to the discovery of 17 previously unknown vulnerabilities, each assigned a CVE, and demonstrated faster vulnerability discovery and reproduction in most cases.
- 10 April 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 10  (OOPSLA1) , 934-958
Open AccessEfficient Directed Hybrid Fuzzing via Target-Centric Seed Selection and Generation
Software vulnerabilities pose severe security threats, highlighting the need for effective automated detection. Directed hybrid fuzzing, which combines the rapid exploration of fuzz testing with the precise constraint solving of symbolic execution, has made notable advancements in vulnerability discovery. However, existing directed hybrid fuzzing approaches still face two key challenges: (1) inefficient seed selection, leading to inadequate prioritization of optimal inputs for symbolic execution, and (2) inefficient seed generation, resulting in suboptimal seed generation. To address these issues, we propose TACO-Fuzz, TArget-Centric cOncolic Fuzzing, which introduces a two-phase target-centric seed selection strategy to prioritize under-explored paths and a target-centric seed generation approach based on constructing extended path conditions, thereby improving seed quality. Our evaluation on a selected set of public benchmarks shows that TACO-Fuzz can outperform several representative state-of-the-art directed fuzzing tools, achieving up to an average speedup of nearly 10x in reaching target locations, along with comparable improvements in reproducing real-world vulnerabilities. Moreover, TACO-Fuzz contributed to the discovery of 17 previously unknown vulnerabilities, each assigned a CVE, and demonstrated faster vulnerability discovery and reproduction in most cases.
- Open Access
- 10 April 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 10  (OOPSLA1) , 1126-1152
LARTS: Language Abstractions for Real-Time and Secure Systems
Real-time systems must simultaneously deliver predictable timing, fault isolation, and memory safety, yet current operating systems expose only low-level primitives that force developers to manually balance concurrency, isolation, and performance. This paper presents LARTS, a language-aided runtime system that elevates these requirements into language abstractions with enforceable semantics. LARTS introduces execution domain, a unified process–thread abstraction that combines thread-level responsiveness with process-level isolation. Memory is managed through deterministic memory contracts, which bind allocation at load time to eliminate runtime failures and unpredictable latencies. Domain interactions are expressed via deterministic communication channels that integrate efficient transfer, type safety, and priority inheritance, ensuring analyzable end-to-end bounds. Moreover, LARTS enforces secure-by-construction semantics, making classes of bugs such as double fetch and use-after-free unrepresentable in the programming model. We formalize the core semantics of LARTS and show how they guarantee determinism and safety by design. A prototype built on RTEMS demonstrates that LARTS preserves competitive real-time performance while substantially reducing programming complexity and eliminating vulnerabilities in realistic case studies. Our results suggest that high-assurance real-time programming can be treated not as an ad-hoc engineering problem, but as a first-class abstraction with verifiable semantics.
- 10 April 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 10  (OOPSLA1) , 1126-1152
Open AccessLARTS: Language Abstractions for Real-Time and Secure Systems
Real-time systems must simultaneously deliver predictable timing, fault isolation, and memory safety, yet current operating systems expose only low-level primitives that force developers to manually balance concurrency, isolation, and performance. This paper presents LARTS, a language-aided runtime system that elevates these requirements into language abstractions with enforceable semantics. LARTS introduces execution domain, a unified process–thread abstraction that combines thread-level responsiveness with process-level isolation. Memory is managed through deterministic memory contracts, which bind allocation at load time to eliminate runtime failures and unpredictable latencies. Domain interactions are expressed via deterministic communication channels that integrate efficient transfer, type safety, and priority inheritance, ensuring analyzable end-to-end bounds. Moreover, LARTS enforces secure-by-construction semantics, making classes of bugs such as double fetch and use-after-free unrepresentable in the programming model. We formalize the core semantics of LARTS and show how they guarantee determinism and safety by design. A prototype built on RTEMS demonstrates that LARTS preserves competitive real-time performance while substantially reducing programming complexity and eliminating vulnerabilities in realistic case studies. Our results suggest that high-assurance real-time programming can be treated not as an ad-hoc engineering problem, but as a first-class abstraction with verifiable semantics.
- 4 April 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 342
One perturbation fools all: An adversarial perturbation can attack different vision models
- 4 April 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 342
One perturbation fools all: An adversarial perturbation can attack different vision models
- 25 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. PP  (00985589) , 1-17
FENSE: Feedback-Driven Incremental Symbolic Execution for Redundant Path Elimination
Incremental symbolic execution aims to address the scalability challenges of traditional symbolic execution by concentrating on behavioural differences between program versions introduced during program evolution. Despite progress in the field, existing techniques often struggle to explore these behaviors both efficiently and accurately. In this paper, we introduce FENSE, a novel approach for incremental symbolic execution that improves efficiency by identifying and eliminating redundant paths. FENSE achieves this by summarizing previously explored paths and monitoring variables that may induce divergent incremental behaviors at each branching point. This summarization process enables FENSE to detect whether a newly explored path subsumes distinct incremental behaviors compared to prior explorations. By effectively pruning redundant paths that exhibit identical incremental behaviors as those previously explored, FENSE achieves a potentially exponential reduction in the number of explored paths. We implemented a prototype of FENSE and evaluated it on a diverse set of real-world applications. Experimental results demonstrate that FENSE outperforms state-of-the-art techniques by significantly reducing both path exploration and execution time. When applied to real-world commits from the GNU Coreutils project, FENSE achieved an average of 76% reduction in explored paths and a 139× speedup over KLEE.
- 25 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. PP  (00985589) , 1-17
FENSE: Feedback-Driven Incremental Symbolic Execution for Redundant Path Elimination
Incremental symbolic execution aims to address the scalability challenges of traditional symbolic execution by concentrating on behavioural differences between program versions introduced during program evolution. Despite progress in the field, existing techniques often struggle to explore these behaviors both efficiently and accurately. In this paper, we introduce FENSE, a novel approach for incremental symbolic execution that improves efficiency by identifying and eliminating redundant paths. FENSE achieves this by summarizing previously explored paths and monitoring variables that may induce divergent incremental behaviors at each branching point. This summarization process enables FENSE to detect whether a newly explored path subsumes distinct incremental behaviors compared to prior explorations. By effectively pruning redundant paths that exhibit identical incremental behaviors as those previously explored, FENSE achieves a potentially exponential reduction in the number of explored paths. We implemented a prototype of FENSE and evaluated it on a diverse set of real-world applications. Experimental results demonstrate that FENSE outperforms state-of-the-art techniques by significantly reducing both path exploration and execution time. When applied to real-world commits from the GNU Coreutils project, FENSE achieved an average of 76% reduction in explored paths and a 139× speedup over KLEE.