Yang Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yang Zhang has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Rui Yao
Beijing Institute of Computer Technology and Application, Beijing, China
2 shared publications - Dong Liu
Beijing University of Posts and Telecommunications, Beijing, China
1 shared publication - Hongliang Liang
Beijing University of Posts and Telecommunications, Beijing, China
1 shared publication - Jinyuan Zhang
Beijing Institute of Computer Technology and Application, Beijing, China
1 shared publication - Lei Wang
Beijing University of Posts and Telecommunications, Beijing, China
1 shared publication - Qiuping Yi
Beijing University of Posts and Telecommunications, Beijing, China
1 shared publication
Latest Publications
- Open Access
- 29 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 30-42
Wasm Runtimes for Edge Computing: A Survey
- 29 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 30-42
Open AccessWasm Runtimes for Edge Computing: A Survey
- 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.
- Open Access
- 18 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 750-754
Heap Memory Vulnerability Detection and Protection in Embedded Real-Time Operating Systems
In application software development, memory defects are difficult to detect. Traditional memory defect detection tools generally face issues of high performance overhead and excessive memory consumption, which limits their applicability in embedded operating systems. To address this, a method called EHD (Embedded Heap Detect) is proposed. This method combines memory defect detection technology with the memory management mechanisms of embedded operating systems to effectively and quickly detect heap memory vulnerabilities, selecting appropriate times for detection to reduce the number of detections and lower performance overhead.
- 18 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 750-754
Open AccessHeap Memory Vulnerability Detection and Protection in Embedded Real-Time Operating Systems
In application software development, memory defects are difficult to detect. Traditional memory defect detection tools generally face issues of high performance overhead and excessive memory consumption, which limits their applicability in embedded operating systems. To address this, a method called EHD (Embedded Heap Detect) is proposed. This method combines memory defect detection technology with the memory management mechanisms of embedded operating systems to effectively and quickly detect heap memory vulnerabilities, selecting appropriate times for detection to reduce the number of detections and lower performance overhead.