Yang Luo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Yang Luo has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Qingni Shen
Peking University
2 shared publications - Zhonghai Wu
School of Software and Microelectronics, Peking University, Beijing, China
2 shared publications - Fajun Zhang
Microsoft, Beijing, China
1 shared publication - Ling Liang
Microsoft, Beijing, China
1 shared publication - Richard Yu
Microsoft, Beijing, China
1 shared publication - Yongqiang Xiong
Microsoft Research Asia, Beijing, China
1 shared publication
Latest Publications
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (5) , 11051-11068
Casbin: A Graph-Based Approach for Efficient and Verifiable Cloud Authorization
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (5) , 11051-11068
Casbin: A Graph-Based Approach for Efficient and Verifiable Cloud Authorization
- 24 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 8481-8496
PERM: Streamlining Cloud Authorization With Flexible and Scalable Policy Enforcement
Authorization is a key component of cloud security. However, the differences in access control mechanisms in heterogeneous cloud environments bring many challenges to cloud users, such as the need to learn multiple policy languages and the difficulty in implementing unified access control across clouds. To address these issues, this paper proposes a new access control policy language called PERM, which achieves flexible support for various fine-grained access control models by separating authorization logic from specific policy rules, and significantly reduces the complexity of policy definition. In addition, we also design a distributed PERM enforcement framework named List-Leafed Decision Tree (L2DT), which leverages a list-tree structure and distributed key-value storage to achieve efficient policy storage and execution. We implement prototypes of PERM and L2DT based on Java and Python, and conduct comprehensive evaluations using OpenStack and XACML datasets. Experimental results show that L2DT can achieve scalable policy execution with small latency overhead (an average of 8.63% in the OpenStack scenario and 5.45% in the XACML scenario). The research in this paper provides new ideas for building flexible, efficient, and scalable access control mechanisms in cloud environments.
- 24 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 8481-8496
PERM: Streamlining Cloud Authorization With Flexible and Scalable Policy Enforcement
Authorization is a key component of cloud security. However, the differences in access control mechanisms in heterogeneous cloud environments bring many challenges to cloud users, such as the need to learn multiple policy languages and the difficulty in implementing unified access control across clouds. To address these issues, this paper proposes a new access control policy language called PERM, which achieves flexible support for various fine-grained access control models by separating authorization logic from specific policy rules, and significantly reduces the complexity of policy definition. In addition, we also design a distributed PERM enforcement framework named List-Leafed Decision Tree (L2DT), which leverages a list-tree structure and distributed key-value storage to achieve efficient policy storage and execution. We implement prototypes of PERM and L2DT based on Java and Python, and conduct comprehensive evaluations using OpenStack and XACML datasets. Experimental results show that L2DT can achieve scalable policy execution with small latency overhead (an average of 8.63% in the OpenStack scenario and 5.45% in the XACML scenario). The research in this paper provides new ideas for building flexible, efficient, and scalable access control mechanisms in cloud environments.
- Open Access
- 27 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 2448-2449
Bridging Gaps in LLM Code Translation: Reducing Errors with Call Graphs and Bridged Debuggers
When using large language models (LLMs) for code translation of complex software, numerous compilation and runtime errors can occur due to insufficient context awareness. To address this issue, this paper presents a code translation method based on call graphs and bridged debuggers: TransGraph. TransGraph first obtains the call graph of the entire code project using the Language Server Protocol, which provides a detailed description of the function call relationships in the program. Through this structured view of the code, LLMs can more effectively handle large-scale and complex codebases, significantly reducing compilation errors. Furthermore, TransGraph, combined with bridged debuggers and dynamic test case generation, significantly reduces runtime errors, overcoming the limitations of insufficient test case coverage in traditional methods. In experiments on six datasets including CodeNet and Avatar, TransGraph outperformed existing code translation methods and LLMs in terms of translation accuracy, with improvements of up to 10.2%.
- 27 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 2448-2449
Open AccessBridging Gaps in LLM Code Translation: Reducing Errors with Call Graphs and Bridged Debuggers
When using large language models (LLMs) for code translation of complex software, numerous compilation and runtime errors can occur due to insufficient context awareness. To address this issue, this paper presents a code translation method based on call graphs and bridged debuggers: TransGraph. TransGraph first obtains the call graph of the entire code project using the Language Server Protocol, which provides a detailed description of the function call relationships in the program. Through this structured view of the code, LLMs can more effectively handle large-scale and complex codebases, significantly reducing compilation errors. Furthermore, TransGraph, combined with bridged debuggers and dynamic test case generation, significantly reduces runtime errors, overcoming the limitations of insufficient test case coverage in traditional methods. In experiments on six datasets including CodeNet and Avatar, TransGraph outperformed existing code translation methods and LLMs in terms of translation accuracy, with improvements of up to 10.2%.