Mingqi Yang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Mingqi Yang has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Mingshuai Chen
Zhejiang University, Hangzhou, China
6 shared publications - Jianwei Yin
School of Software Technology, Zhejiang University, Ningbo, China
4 shared publications - Jianwei Yin
Zhejiang University
3 shared publications - Shengchao Qin
Xidian University, Xi'an, China
3 shared publications - Tengjie Lin
Zhejiang University, Hangzhou, China
3 shared publications - Zhongyi Wang
Zhejiang University, Hangzhou, China
3 shared publications
Latest Publications
- 11 May 2026
- Published by Springer Nature
- p. 101-125
Fixed-Point Reasoning for Stochastic Systems
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 3724-3736
Boosting Gas Revenues of Ethereum Miners
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 3724-3736
Open AccessBoosting Gas Revenues of Ethereum Miners
- Open Access
- 10 April 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 10 (OOPSLA1) , 1874-1902
A Tale of 1001 LoC: Potential Runtime Error-Guided Specification Synthesis for Verifying Large-Scale Programs
Fully automated verification of large-scale software and hardware systems is arguably the holy grail of formal methods. Large language models (LLMs) have recently demonstrated their potential for enhancing the degree of automation in formal verification by, e.g., generating formal specifications as essential to deductive verification, yet exhibit poor scalability due to long-context reasoning limitations and, more importantly, the difficulty of inferring complex, interprocedural specifications. This paper presents Preguss - a modular, fine-grained framework for automating the generation and refinement of formal specifications. Preguss synergizes between static analysis and deductive verification by steering two components in a divide-and-conquer fashion: (i) potential runtime error-guided construction and prioritization of verification units, and (ii) LLM-aided synthesis of interprocedural specifications at the unit level. We show that Preguss substantially outperforms state-of-the-art LLM-based approaches and, in particular, it enables highly automated RTE-freeness verification for real-world programs with over a thousand LoC, with a reduction of 80.6%~88.9% human verification effort.
- 10 April 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 10 (OOPSLA1) , 1874-1902
Open AccessA Tale of 1001 LoC: Potential Runtime Error-Guided Specification Synthesis for Verifying Large-Scale Programs
Fully automated verification of large-scale software and hardware systems is arguably the holy grail of formal methods. Large language models (LLMs) have recently demonstrated their potential for enhancing the degree of automation in formal verification by, e.g., generating formal specifications as essential to deductive verification, yet exhibit poor scalability due to long-context reasoning limitations and, more importantly, the difficulty of inferring complex, interprocedural specifications. This paper presents Preguss - a modular, fine-grained framework for automating the generation and refinement of formal specifications. Preguss synergizes between static analysis and deductive verification by steering two components in a divide-and-conquer fashion: (i) potential runtime error-guided construction and prioritization of verification units, and (ii) LLM-aided synthesis of interprocedural specifications at the unit level. We show that Preguss substantially outperforms state-of-the-art LLM-based approaches and, in particular, it enables highly automated RTE-freeness verification for real-world programs with over a thousand LoC, with a reduction of 80.6%~88.9% human verification effort.
- Open Access
- 9 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 118-123
Preguss: It Analyzes, It Specifies, It Verifies
- 9 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 118-123
Open AccessPreguss: It Analyzes, It Specifies, It Verifies
- Open Access
Preguss: It Analyzes, It Specifies, It Verifies
Fully automated verification of large-scale software and hardware systems is arguably the holy grail of formal methods. Large language models (LLMs) have recently demonstrated their potential for enhancing the degree of automation in formal verification by, e.g., generating formal specifications as essential to deductive verification, yet exhibit poor scalability due to context-length limitations and, more importantly, the difficulty of inferring complex, interprocedural specifications. This paper outlines Preguss - a modular, fine-grained framework for automating the generation and refinement of formal specifications. Preguss synergizes between static analysis and deductive verification by orchestrating two components: (i) potential runtime error (RTE)-guided construction and prioritization of verification units, and (ii) LLM-aided synthesis of interprocedural specifications at the unit level. We envisage that Preguss paves a compelling path towards the automated verification of large-scale programs.
Open AccessPreguss: It Analyzes, It Specifies, It Verifies
Fully automated verification of large-scale software and hardware systems is arguably the holy grail of formal methods. Large language models (LLMs) have recently demonstrated their potential for enhancing the degree of automation in formal verification by, e.g., generating formal specifications as essential to deductive verification, yet exhibit poor scalability due to context-length limitations and, more importantly, the difficulty of inferring complex, interprocedural specifications. This paper outlines Preguss - a modular, fine-grained framework for automating the generation and refinement of formal specifications. Preguss synergizes between static analysis and deductive verification by orchestrating two components: (i) potential runtime error (RTE)-guided construction and prioritization of verification units, and (ii) LLM-aided synthesis of interprocedural specifications at the unit level. We envisage that Preguss paves a compelling path towards the automated verification of large-scale programs.
- Open Access
- 22 July 2025
- Published by Springer Nature
- p. 82-104
On the Almost-Sure Termination of Probabilistic Counter Programs
This paper introduces k -d PCPs – the class of probabilistic counter programs with $$k \in \mathbb {N}$$ counter variables inducing possibly infinite-state Markov chains. We show that the universal (positive) almost-sure termination problem is undecidable for k -d PCPs in general, yet decidable for 1-d PCPs. We present an efficient decision procedure for the latter leveraging the technique of Markov chain finitization . Moreover, we identify several classes of k -d PCPs that are reducible to 1-d PCPs – thus their termination properties can be inferred automatically. Experiments demonstrate that our decision procedure can certify (positive) almost-sure termination – without resorting to invariants or supermartingales – of non-trivial probabilistic programs beyond the scope of existing tools.- 22 July 2025
- Published by Springer Nature
- p. 82-104
Open AccessOn the Almost-Sure Termination of Probabilistic Counter Programs
This paper introduces k -d PCPs – the class of probabilistic counter programs with $$k \in \mathbb {N}$$ counter variables inducing possibly infinite-state Markov chains. We show that the universal (positive) almost-sure termination problem is undecidable for k -d PCPs in general, yet decidable for 1-d PCPs. We present an efficient decision procedure for the latter leveraging the technique of Markov chain finitization . Moreover, we identify several classes of k -d PCPs that are reducible to 1-d PCPs – thus their termination properties can be inferred automatically. Experiments demonstrate that our decision procedure can certify (positive) almost-sure termination – without resorting to invariants or supermartingales – of non-trivial probabilistic programs beyond the scope of existing tools. - Open Access
On the Almost-Sure Termination of Probabilistic Counter Programs
This paper introduces $k$-d PCPs -- the class of \emph{probabilistic counter programs} with $k \in \NN$ counter variables inducing possibly infinite-state Markov chains. We show that the universal (positive) almost-sure termination problem is \emph{undecidable} for $k$-d PCPs in general, yet \emph{decidable} for $1$-d PCPs. We present an efficient decision procedure for the latter leveraging the technique of \emph{Markov chain finitization}. Moreover, we identify several classes of $k$-d PCPs that are reducible to $1$-d PCPs -- thus their termination properties can be inferred automatically. Experiments demonstrate that our decision procedure can certify (positive) almost-sure termination -- without resorting to invariants or supermartingales -- of non-trivial probabilistic programs beyond the scope of existing tools.Open AccessOn the Almost-Sure Termination of Probabilistic Counter Programs
This paper introduces $k$-d PCPs -- the class of \emph{probabilistic counter programs} with $k \in \NN$ counter variables inducing possibly infinite-state Markov chains. We show that the universal (positive) almost-sure termination problem is \emph{undecidable} for $k$-d PCPs in general, yet \emph{decidable} for $1$-d PCPs. We present an efficient decision procedure for the latter leveraging the technique of \emph{Markov chain finitization}. Moreover, we identify several classes of $k$-d PCPs that are reducible to $1$-d PCPs -- thus their termination properties can be inferred automatically. Experiments demonstrate that our decision procedure can certify (positive) almost-sure termination -- without resorting to invariants or supermartingales -- of non-trivial probabilistic programs beyond the scope of existing tools.