Yang Ziyi

Mr. Yang Ziyi


Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
9 April 2025 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
YZYang Ziyi
Yang Ziyi
ISIlya Sergey
Ilya Sergey
We present an approach to automatically synthesise recursive predicates in Separation Logic (SL) from concrete data structure instances using Inductive Logic Programming (ILP) techniques. The main challenges to make such synthesis effective are (1) making it work without negative examples that are required in ILP but are difficult to construct for heap-based structures in an automated fashion, and (2) to be capable of summarising not just the shape of a heap (e.g., it is a linked list), but also the properties of the data it stores (e.g., it is a sorted linked list). We tackle these challenges with a new predicate learning algorithm. The key contributions of our work are (a) the formulation of ILP-based learning only using positive examples and (b) an algorithm that synthesises property-rich SL predicates from concrete memory graphs based on the positive-only learning. We show that our framework can efficiently and correctly synthesise SL predicates for structures that were beyond the reach of the state-of-the-art tools, including those featuring non-trivial payload constraints (e.g., binary search trees) and nested recursion (e.g., n -ary trees). We further extend the usability of our approach by a memory graph generator that produces positive heap examples from programs. Finally, we show how our approach facilitates deductive verification and synthesis of correct-by-construction code.

17 October 2024
Verified
Conference Paper
Open access
YLYunjeong Lee
Yunjeong Lee
KGKiran Gopinathan
Kiran Gopinathan
YZYang Ziyi
Yang Ziyi
MFMatthew Flatt
Matthew Flatt
ISIlya Sergey
Ilya Sergey
Domain-Specific Languages (DSLs) are a popular way to simplify and streamline programmatic solutions of commonly occurring yet specialized tasks. While the design of frameworks for implementing DSLs has been a popular topic of study in the research community, significantly less attention has been given to studying how those frameworks end up being used by practitioners and assessing utility of their features for building DSLs "in the wild". In this paper, we conduct such a study focusing on a particular framework for DSL construction: the Racket programming language. We provide (a) a novel taxonomy of language design intents enabled by Racket-embedded DSLs, and (b) a classification of ways to utilize Racket's mechanisms that make the implementation of those intents possible. We substantiate our taxonomy with an analysis of 30 popular Racket-based DSLs, discussing how they make use of the available mechanisms and accordingly achieve their design intents. The taxonomy serves as a reusable measure that can help language designers to systematically develop, compare, and analyze DSLs in Racket as well as other frameworks.

1 January 2023 in Accounting, Auditing and Finance
Verified
Journal Article
Open access
PDF file
YZYang Ziyi
Yang Ziyi
In this study focused on Yinzhou District, Ningbo City, the determination of typhoon catastrophe insurance rates is explored using a discrete relational, matrixed catastrophe insurance actuarial model. The initial phase involved calculating the expected loss rate for residential typhoon insurance, utilizing historical data on insurance claims and tropical cyclone records. Further, the study integrated Yinzhou District yearbooks with typhoon insurance claim data to assess the vulnerability of individual streets and towns within the district. This assessment led to the creation of four gradient levels based on the vulnerability rankings and clustering. The research then involved calculating both the actual and adjusted risk gradient coefficients for each area within these gradient levels under varying scenarios. Findings indicated a significant disparity in the actual risk gradient coefficients across different areas, with the most vulnerable areas exhibiting coefficients that were 813 times greater than those of the least vulnerable. To address the high actual risk gradient coefficients, the study proposed adjustments that took into account factors such as residential risk, policyholders' payment capacity, and government support. The implementation of these three adjustment schemes significantly reduced the discrepancy in insurance rates among the different areas, more accurately reflecting the typhoon risk situation in Yinzhou District and aiding in the precise determination of catastrophic insurance rates.

1 October 2026 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
YZYang Ziyi
Yang Ziyi
ISIlya Sergey
Ilya Sergey
Combinatorial search—finding solutions that meet constraints within an exponentially large space of candidates—underpins problems from hardware verification to scheduling and combinatorial design. The most successful approach in practice is Propositional Satisfiability (SAT) solving, but modelling a problem for a SAT solver requires manually translating high-level requirements into conjunctions of boolean clauses, a tedious step that sacrifices clarity and modularity. Answer Set Programming (ASP) offers a higher-level alternative, with a rule-based language whose variables and finite-domain reasoning yield more compact problem descriptions that can be automatically compiled into low-level solver input. Yet, ASP has its own shortcomings: its semantics, defined via a notion of stable models, is hard to build intuition for; it does not allow arbitrary first-order logic formulas as constraints; and its programs tend to be monolithic, making modular design and reuse difficult. We propose SetLah!, a semi-declarative language for combinatorial search that addresses the shortcomings of both SAT and ASP. A SetLah! program is a sequence of stratified blocks, each containing rules that define the search space and arbitrary first-order logic constraints that prune it. This block structure enables modular problem decomposition, allowing for an intuitive semantics: candidate solutions are generated and filtered block by block. We built a compiler from SetLah! programs into ASP, allowing us to take full advantage of the existing efficient ASP solvers, while also automatically optimising the generated encodings. Our empirical evaluation demonstrates that SetLah! offers substantially more concise and intuitive specifications for common combinatorial search problems, and its compiled ASP encodings can significantly outperform SAT-based tools.