Tao Zan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Tao Zan has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Xiao He
School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing, China
6 shared publications - Zhenjiang Hu
Peking University, Beijing, China
4 shared publications - Xing Zhang
Peking University, Beijing, China
2 shared publications Fusen Wang
1 shared publicationGuanchen Guo
1 shared publication- Guanchen Guo
Peking University, Beijing, China
1 shared publication
Latest Publications
- Open Access
- 9 October 2026
- Published by Elsevier in SSRN Electronic Journal
Derivative-based Bidirectional Programming
The get-based and put-based approaches are two popular functional approaches to developing bidirectional transformations (BXs). They suffer from ambiguity and the difficulty of specifying the backward transformation, respectively. In this paper, we propose a novel derivative-based framework for bidirectional programming. In our framework, BXs are specified through get', i.e., the derivative of get, which describes how source updates correspond to view updates. We show how well-behaved BXs can be systematically derived from get', and prove completeness of the framework. We apply the framework to relational databases by designing a DSL, namely, dBX, and implementing a prototype. We evaluate the prototype on 42 representative examples to demonstrate the practical feasibility of our approach, showing its expressiveness and efficiency. We further demonstrate the generality of the framework by applying it to unordered trees and implementing classical tree combinators.
- 9 October 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessDerivative-based Bidirectional Programming
The get-based and put-based approaches are two popular functional approaches to developing bidirectional transformations (BXs). They suffer from ambiguity and the difficulty of specifying the backward transformation, respectively. In this paper, we propose a novel derivative-based framework for bidirectional programming. In our framework, BXs are specified through get', i.e., the derivative of get, which describes how source updates correspond to view updates. We show how well-behaved BXs can be systematically derived from get', and prove completeness of the framework. We apply the framework to relational databases by designing a DSL, namely, dBX, and implementing a prototype. We evaluate the prototype on 42 representative examples to demonstrate the practical feasibility of our approach, showing its expressiveness and efficiency. We further demonstrate the generality of the framework by applying it to unordered trees and implementing classical tree combinators.
- Open Access
- 15 May 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Software Engineering and Methodology
SpeSC + : An End-User Readable Domain-Specific Language for Smart Legal Contracts
Smart contracts are self-executing programs deployed on blockchains to enable automated and trustless transactions without intermediaries. However, existing smart contracts (e.g., those written in Solidity) resemble general-purpose programs rather than legal contracts, making them incomprehensible to non-technical users. To address this limitation, we present SpeSC + , a domain-specific language (DSL) designed for both readability and legal expressiveness. SpeSC + features a natural-language-like syntax and integrates domain-specific concepts for contractual logic, such as time expressions, parties and authorizations, and obligations and privileges. Unlike existing works that focus on utilizing natural languages for specification, we equip SpeSC + with a formally defined, Turing-complete semantics for precise execution, covering the entire execution process of a legal contract. We evaluated SpeSC + ’s expressiveness by implementing 35 real-world legal contracts across 10 business domains and 5 canonical Solidity examples. A controlled user study further demonstrated SpeSC + ’s superior readability over Solidity, particularly for users without programming expertise, without compromising expressiveness. We also measured the gas usage and detected vulnerabilities in the Solidity programs generated by the SpeSC + code generator. The evaluation results suggest that SpeSC + lowers the barrier to creating and understanding legally enforceable smart contracts.
- 15 May 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Software Engineering and Methodology
Open AccessSpeSC + : An End-User Readable Domain-Specific Language for Smart Legal Contracts
Smart contracts are self-executing programs deployed on blockchains to enable automated and trustless transactions without intermediaries. However, existing smart contracts (e.g., those written in Solidity) resemble general-purpose programs rather than legal contracts, making them incomprehensible to non-technical users. To address this limitation, we present SpeSC + , a domain-specific language (DSL) designed for both readability and legal expressiveness. SpeSC + features a natural-language-like syntax and integrates domain-specific concepts for contractual logic, such as time expressions, parties and authorizations, and obligations and privileges. Unlike existing works that focus on utilizing natural languages for specification, we equip SpeSC + with a formally defined, Turing-complete semantics for precise execution, covering the entire execution process of a legal contract. We evaluated SpeSC + ’s expressiveness by implementing 35 real-world legal contracts across 10 business domains and 5 canonical Solidity examples. A controlled user study further demonstrated SpeSC + ’s superior readability over Solidity, particularly for users without programming expertise, without compromising expressiveness. We also measured the gas usage and detected vulnerabilities in the Solidity programs generated by the SpeSC + code generator. The evaluation results suggest that SpeSC + lowers the barrier to creating and understanding legally enforceable smart contracts.
- 30 December 2025
- Published by Elsevier in Journal of Systems and Software
- Vol. 235
Enabling direct manipulation of plain-text output for template programs
- 30 December 2025
- Published by Elsevier in Journal of Systems and Software
- Vol. 235
Enabling direct manipulation of plain-text output for template programs
- Open Access
- 24 February 2025
- Published by MDPI AG in Information
- Vol. 16 (3) , 169
Intentionally Fusing Direct Manipulations into SVG Programs
Bidirectional live programming is a programming paradigm that enhances the developer experience by allowing direct modifications to the output, with changes instantly reflected back to the source program. Existing operation-based approaches allow modifying the constant values and expressions of programs, while they lack control over modifications originating from multiple updatable locations. To control the updatability of the source program, our approach introduces non-updatable expressions, which guide the fusion of updates to the intended locations. The correctness properties, GetPut and WeakPutGet, ensure output consistency. We have implemented a prototype, FuseSVG, and tested it with 14 nontrivial SVG-drawing benchmarks, demonstrating the effectiveness of our approach.
- 24 February 2025
- Published by MDPI AG in Information
- Vol. 16 (3) , 169
Open AccessIntentionally Fusing Direct Manipulations into SVG Programs
Bidirectional live programming is a programming paradigm that enhances the developer experience by allowing direct modifications to the output, with changes instantly reflected back to the source program. Existing operation-based approaches allow modifying the constant values and expressions of programs, while they lack control over modifications originating from multiple updatable locations. To control the updatability of the source program, our approach introduces non-updatable expressions, which guide the fusion of updates to the intended locations. The correctness properties, GetPut and WeakPutGet, ensure output consistency. We have implemented a prototype, FuseSVG, and tested it with 14 nontrivial SVG-drawing benchmarks, demonstrating the effectiveness of our approach.
- 27 June 2024
- Published by Elsevier in Journal of Systems and Software
- Vol. 216
BIT: A template-based approach to incremental and bidirectional model-to-text transformation
- 27 June 2024
- Published by Elsevier in Journal of Systems and Software
- Vol. 216
BIT: A template-based approach to incremental and bidirectional model-to-text transformation
- Open Access
- 2 January 2024
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 8 (POPL) , 1211-1238
Fusing Direct Manipulations into Functional Programs
Bidirectional live programming systems (BLP) enable developers to modify a program by directly manipulating the program output, so that the updated program can produce the manipulated output. One state-of-the-art approach to BLP systems is operation-based, which captures the developer's intention of program modifications by taking how the developer manipulates the output into account. The program modifications are usually hard coded for each direct manipulation in these BLP systems, which are difficult to extend. Moreover, to reflect the manipulations to the source program, these BLP systems trace the modified output to appropriate code fragments and perform corresponding code transformations. Accordingly, they require direct manipulation users be aware of the source code and how it is changed, making “direct” manipulation (on output) be “indirect”. In this paper, we resolve this problem by presenting a novel operation-based framework for bidirectional live programming, which can automatically fuse direct manipulations into the source code, thus supporting code-insensitive direct manipulations. Firstly, we design a simple but expressive delta language DM capable of expressing common direct manipulations for output values. Secondly, we present a fusion algorithm that propagates direct manipulations into the source functional programs and applies them to the constants whenever possible; otherwise, the algorithm embeds manipulations into the “proper positions” of programs. We prove the correctness of the fusion algorithm that the updated program executes to get the manipulated output. To demonstrate the expressiveness of DM and the effectiveness of our fusion algorithm, we have implemented FuseDM, a prototype SVG editor that supports GUI-based operations for direct manipulation, and successfully designed 14 benchmark examples starting from blank code using FuseDM.
- 2 January 2024
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 8 (POPL) , 1211-1238
Open AccessFusing Direct Manipulations into Functional Programs
Bidirectional live programming systems (BLP) enable developers to modify a program by directly manipulating the program output, so that the updated program can produce the manipulated output. One state-of-the-art approach to BLP systems is operation-based, which captures the developer's intention of program modifications by taking how the developer manipulates the output into account. The program modifications are usually hard coded for each direct manipulation in these BLP systems, which are difficult to extend. Moreover, to reflect the manipulations to the source program, these BLP systems trace the modified output to appropriate code fragments and perform corresponding code transformations. Accordingly, they require direct manipulation users be aware of the source code and how it is changed, making “direct” manipulation (on output) be “indirect”. In this paper, we resolve this problem by presenting a novel operation-based framework for bidirectional live programming, which can automatically fuse direct manipulations into the source code, thus supporting code-insensitive direct manipulations. Firstly, we design a simple but expressive delta language DM capable of expressing common direct manipulations for output values. Secondly, we present a fusion algorithm that propagates direct manipulations into the source functional programs and applies them to the constants whenever possible; otherwise, the algorithm embeds manipulations into the “proper positions” of programs. We prove the correctness of the fusion algorithm that the updated program executes to get the manipulated output. To demonstrate the expressiveness of DM and the effectiveness of our fusion algorithm, we have implemented FuseDM, a prototype SVG editor that supports GUI-based operations for direct manipulation, and successfully designed 14 benchmark examples starting from blank code using FuseDM.
- Open Access
- 3 January 2023
- Published by MDPI AG in Electronics
- Vol. 12 (1) , 250
VoiceJava: A Syntax-Directed Voice Programming Language for Java
About 5–10% of software engineers suffer from repetitive strain injury, and it would be better to provide an alternative way to write code instead of using a mouse and keyboard and sitting on a chair the whole day. Coding by voice is an attractive approach, and quite a bit of work has been done in that direction. At the same time, dictating plain Java text with low accuracy through the existing voice recognition engines or providing complex panels controlled by the voice makes the coding process even more complex. We argue that current programming languages are suitable for programming by hand, not by mouth. We try to solve this problem by designing a new programming language, VoiceJava, suitable for dictating. A Java program is constructed in a syntax-directed way through a sequence of VoiceJava commands. As a result, users do not need to dictate spaces, parentheses, and commas, reducing the vocal load.
- 3 January 2023
- Published by MDPI AG in Electronics
- Vol. 12 (1) , 250
Open AccessVoiceJava: A Syntax-Directed Voice Programming Language for Java
About 5–10% of software engineers suffer from repetitive strain injury, and it would be better to provide an alternative way to write code instead of using a mouse and keyboard and sitting on a chair the whole day. Coding by voice is an attractive approach, and quite a bit of work has been done in that direction. At the same time, dictating plain Java text with low accuracy through the existing voice recognition engines or providing complex panels controlled by the voice makes the coding process even more complex. We argue that current programming languages are suitable for programming by hand, not by mouth. We try to solve this problem by designing a new programming language, VoiceJava, suitable for dictating. A Java program is constructed in a syntax-directed way through a sequence of VoiceJava commands. As a result, users do not need to dictate spaces, parentheses, and commas, reducing the vocal load.