Jianhong Zhao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jianhong Zhao has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Yongwang Zhao
Zhejiang University, Hangzhou, China
3 shared publications - Fanlang Zeng
Zhejiang University, Hangzhou, China
2 shared publications - Kui Ren
Zhejiang University
2 shared publications - Bohua Zhan
Huawei Technologies Co., Ltd, Beijing, China
1 shared publication - Everett Hildenbrandt
Runtime Verification Inc., USA
1 shared publication - Jilin Hu
School of Cyber Science and Technology, College of Computer Science and Technology, Zhejiang University, Hangzhou, China
1 shared publication
Latest Publications
- Open Access
- 28 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Software Engineering and Methodology
Compiling by Proving in \({\mathbb{K}}\) : From All-Path Reachability Proofs to Single-Step Semantic RulesThe \({\mathbb{K}}\) framework generates language tools from formal semantics and hosts comprehensive semantics for real-world languages including C, Java, JavaScript, and the Ethereum Virtual Machine, with industrial adoption in blockchain verification. However, the generated executors interpret programs by applying semantic rules step by step, causing performance overhead that limits practical scalability. We present compiling by proving , a language-agnostic mechanism that eliminates this overhead. Given a code unit, we use symbolic execution to prove that its specification holds across all execution paths, generating a proof graph that encodes the complete input-output behavior. We compile this proof graph into a single-step rule that directly maps inputs to outputs, replacing step-by-step interpretation with one-step execution. Because the pipeline is language-agnostic, it benefits any language formalized in \({\mathbb{K}}\) . We evaluate on EVM and Rust MIR semantics, showing speedups in concrete and symbolic execution, and demonstrate applications to semantic equivalence verification and compositional smart contract verification.- 28 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Software Engineering and Methodology
Open AccessCompiling by Proving in \({\mathbb{K}}\) : From All-Path Reachability Proofs to Single-Step Semantic RulesThe \({\mathbb{K}}\) framework generates language tools from formal semantics and hosts comprehensive semantics for real-world languages including C, Java, JavaScript, and the Ethereum Virtual Machine, with industrial adoption in blockchain verification. However, the generated executors interpret programs by applying semantic rules step by step, causing performance overhead that limits practical scalability. We present compiling by proving , a language-agnostic mechanism that eliminates this overhead. Given a code unit, we use symbolic execution to prove that its specification holds across all execution paths, generating a proof graph that encodes the complete input-output behavior. We compile this proof graph into a single-step rule that directly maps inputs to outputs, replacing step-by-step interpretation with one-step execution. Because the pipeline is language-agnostic, it benefits any language formalized in \({\mathbb{K}}\) . We evaluate on EVM and Rust MIR semantics, showing speedups in concrete and symbolic execution, and demonstrate applications to semantic equivalence verification and compositional smart contract verification. - Open Access
- 25 January 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Software Engineering and Methodology
- Vol. 34 (2) , 1-40
KBX: Verified Model Synchronization via Formal Bidirectional Transformation
Complex safety-critical systems require multiple models for a comprehensive description, resulting in error-prone development and laborious verification. Bidirectional transformation (BX) is an approach to automatically synchronizing these models. However, existing BX frameworks lack formal verification to enforce these models’ consistency rigorously. This paper introduces KBX, a formal bidirectional transformation framework for verified model synchronization. First, we present a matching logic-based BX model, providing a logical foundation for constructing BX definitions within the \(\mathbb{K}\) framework. Second, we propose algorithms to synthesize formal BX definitions from unidirectional ones, which allows developers to focus on crafting the unidirectional definitions while disregarding the reverse direction and missing information recovery for synchronization. Afterward, we harness \(\mathbb{K}\) to generate a formal synchronizer from the synthesized definitions for consistency maintenance and verification. To evaluate the effectiveness of KBX, we conduct a comparative analysis against existing BX frameworks. Furthermore, we demonstrate the application of KBX in constructing a BX between UML and HCSP for real-world scenarios, showcasing an 72% reduction in BX development effort compared to manual specification writing in \(\mathbb{K}\) .- 25 January 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Software Engineering and Methodology
- Vol. 34 (2) , 1-40
Open AccessKBX: Verified Model Synchronization via Formal Bidirectional Transformation
Complex safety-critical systems require multiple models for a comprehensive description, resulting in error-prone development and laborious verification. Bidirectional transformation (BX) is an approach to automatically synchronizing these models. However, existing BX frameworks lack formal verification to enforce these models’ consistency rigorously. This paper introduces KBX, a formal bidirectional transformation framework for verified model synchronization. First, we present a matching logic-based BX model, providing a logical foundation for constructing BX definitions within the \(\mathbb{K}\) framework. Second, we propose algorithms to synthesize formal BX definitions from unidirectional ones, which allows developers to focus on crafting the unidirectional definitions while disregarding the reverse direction and missing information recovery for synchronization. Afterward, we harness \(\mathbb{K}\) to generate a formal synchronizer from the synthesized definitions for consistency maintenance and verification. To evaluate the effectiveness of KBX, we conduct a comparative analysis against existing BX frameworks. Furthermore, we demonstrate the application of KBX in constructing a BX between UML and HCSP for real-world scenarios, showcasing an 72% reduction in BX development effort compared to manual specification writing in \(\mathbb{K}\) . - 11 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 21 (6) , 5341-5358
ProveriT: A Parameterized, Composable, and Verified Model of TEE Protection Profile
The Trusted Execution Environment (TEE) plays a crucial role in modern computer systems and the compromise of TEE can result in enormous losses. Although numerous TEE products have been proposed, most of them lack robust security guarantees. To address this concern, GlobalPlatform (GP) defines the TEE security standard, Protection Profile (PP), which has gained widespread adoption in the TEE development and Common Criteria (CC) evaluation. However, despite its importance, GPTEE PP has never been formally specified and verified. In this paper, we present ProveriT , a parameterized, composable, and formally verified model of GPTEE PP. Firstly, we propose the first formal specification of GPTEE PP in a parameterized manner, encompassing the definition of security problems, security objectives, and security functional requirements. Secondly, we provide a compositional framework, utilizing horizontal calculus and vertical calculus, to flexibly combine specific security functional requirements for TEE developers and reduce proof efforts for verification. ProveriT is extensible and reusable for the verification and CC evaluation of specific TEE products. Thirdly, we conduct a comprehensive formal verification of rationales in the model to ensure the correctness of GPTEE PP. During the verification, 8 issues are discovered and we provide suggestions to resolve them. Finally, we demonstrate the extensibility and effectiveness of ProveriT by applying it to the verification of a commercial TEE. All the specifications and verification are carried out in the Isabelle/HOL theorem prover.
- 11 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 21 (6) , 5341-5358
ProveriT: A Parameterized, Composable, and Verified Model of TEE Protection Profile
The Trusted Execution Environment (TEE) plays a crucial role in modern computer systems and the compromise of TEE can result in enormous losses. Although numerous TEE products have been proposed, most of them lack robust security guarantees. To address this concern, GlobalPlatform (GP) defines the TEE security standard, Protection Profile (PP), which has gained widespread adoption in the TEE development and Common Criteria (CC) evaluation. However, despite its importance, GPTEE PP has never been formally specified and verified. In this paper, we present ProveriT , a parameterized, composable, and formally verified model of GPTEE PP. Firstly, we propose the first formal specification of GPTEE PP in a parameterized manner, encompassing the definition of security problems, security objectives, and security functional requirements. Secondly, we provide a compositional framework, utilizing horizontal calculus and vertical calculus, to flexibly combine specific security functional requirements for TEE developers and reduce proof efforts for verification. ProveriT is extensible and reusable for the verification and CC evaluation of specific TEE products. Thirdly, we conduct a comprehensive formal verification of rationales in the model to ensure the correctness of GPTEE PP. During the verification, 8 issues are discovered and we provide suggestions to resolve them. Finally, we demonstrate the extensibility and effectiveness of ProveriT by applying it to the verification of a commercial TEE. All the specifications and verification are carried out in the Isabelle/HOL theorem prover.