Yuepeng Wang

Yuepeng Wang

Auto-generated profile, based on publicly available information

Yuepeng Wang

Simon Fraser University, Burnaby, Canada

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 April 2024 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
YHYang He
Yang He
PZPinhan Zhao
Pinhan Zhao
XWXinyu Wang
Xinyu Wang
YWYuepeng Wang
Yuepeng Wang
The task of SQL query equivalence checking is important in various real-world applications (including query rewriting and automated grading) that involve complex queries with integrity constraints; yet, state-of-the-art techniques are very limited in their capability of reasoning about complex features (e.g., those that involve sorting, case statement, rich integrity constraints, etc.) in real-life queries. To the best of our knowledge, we propose the first SMT-based approach and its implementation, VeriEQL, capable of proving and disproving bounded equivalence of complex SQL queries. VeriEQL is based on a new logical encoding that models query semantics over symbolic tuples using the theory of integers with uninterpreted functions. It is simple yet highly practical -- our comprehensive evaluation on over 20,000 benchmarks shows that VeriEQL outperforms all state-of-the-art techniques by more than one order of magnitude in terms of the number of benchmarks that can be proved or disproved. VeriEQL can also generate counterexamples that facilitate many downstream tasks (such as finding serious bugs in systems like MySQL and Apache Calcite).

2 January 2024 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
SPShankara Pailoor
Shankara Pailoor
YWYuepeng Wang
Yuepeng Wang
IDIşıl Dillig
Işıl Dillig
Modifications to the data representation of an abstract data type (ADT) can require significant semantic refactoring of the code. Motivated by this observation, this paper presents a new method to automate semantic code refactoring tasks. Our method takes as input the original ADT implementation, a new data representation, and a so-called relational representation invariant (relating the old and new data representations), and automatically generates a new ADT implementation that is semantically equivalent to the original version. Our method is based on counterexample-guided inductive synthesis (CEGIS) but leverages three key ideas that allow it to handle real-world refactoring tasks. First, our approach reduces the underlying relational synthesis problem to a set of (simpler) programming-by-example problems, one for each method in the ADT. Second, it leverages symbolic reasoning techniques, based on logical abduction, to deduce code snippets that should occur in the refactored version. Finally, it utilizes a notion of partial equivalence to make inductive synthesis much more effective in this setting. We have implemented the proposed approach in a new tool called Revamp for automatically refactoring Java classes and evaluated it on 30 Java class mined from Github. Our evaluation shows that Revamp can correctly refactor the entire ADT in 97% of the cases and that it can successfully re-implement 144 out of the 146 methods that require modifications.

31 October 2022 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
YCYanju Chen
Yanju Chen
YWYuepeng Wang
Yuepeng Wang
MGMaruth Goyal
Maruth Goyal
JDJames Dong
James Dong
YFYu Feng
Yu Feng
IDIşil Dillig
Işil Dillig
Since executing a smart contract on the Ethereum blockchain costs money (measured in gas ), smart contract developers spend significant effort in reducing gas usage. In this paper, we propose a new technique for reducing the gas usage of smart contracts by changing the underlying data layout. Given a smart contract P and a type-level transformation, our method automatically synthesizes a new contract P ′ that is functionally equivalent to P . Our approach provides a convenient DSL for expressing data type refactorings and employs program synthesis to generate the new version of the contract. We have implemented our approach in a tool called Solidare and demonstrate its capabilities on real-world smart contracts from Etherscan and GasStation. In particular, we show that our approach is effective at automating the desired data layout transformation and that it is useful for reducing gas usage of smart contracts that use rich data structures.

23 February 2014 in Journal of Combinatorial Optimization
Verified
Journal Article
Closed access
PDF file
YWYuepeng Wang
Yuepeng Wang
YWYuexuan Wang
Yuexuan Wang
Dongxiao YuDongxiao Yu
Dongxiao Yu
JYJiguo Yu
Jiguo Yu
FLFrancis C Lau
Francis C Lau

8 July 2023 in ACS Sustainable Chemistry & Engineering
Verified
Journal Article
Closed access
RLRuipeng Li
Ruipeng Li
XZXing Zhou
Xing Zhou
ZLZhiyong Li
Zhiyong Li
YWYuepeng Wang
Yuepeng Wang
YZYanfei Zhao
Yanfei Zhao
JWJianji Wang
Jianji Wang

12 April 2024
Verified
Conference Paper
Open access
HCHaoxian Chen
Haoxian Chen
LLLan Lu
Lan Lu
BMBrendan Massey
Brendan Massey
YWYuepeng Wang
Yuepeng Wang
BLBoon Thau Loo
Boon Thau Loo
Smart contracts manage a large number of digital assets nowadays. Bugs in these contracts have led to significant financial loss. Verifying the correctness of smart contracts is, therefore, an important task. This paper presents an automated safety verification tool, DCV, that targets declarative smart contracts written in De-Con, a logic-based domain-specific language for smart contract implementation and specification. DCV proves safety properties by mathematical induction and can automatically infer inductive invariants using heuristic patterns, without annotations from the developer. Our evaluation on 23 benchmark contracts shows that DCV is effective in verifying smart contracts adapted from public repositories, and can verify contracts not supported by other tools. Furthermore, DCV significantly outperforms baseline tools in verification time.