MYMingqi Yang

Mingqi Yang

*This is an algorithmically generated author record based on publicly available information.

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:


Latest Publications

  • Fixed-Point Reasoning for Stochastic Systems

    by Zhiyang Li, Mingqi Yang, Shenghua Feng, Mingshuai Chen

  • Open Access

    Boosting Gas Revenues of Ethereum Miners

    by Togzhan Barakbayeva, Soroush Farokhnia, Amir K. Goharshady, Sergei Novozhilov

  • Open Access

    A Tale of 1001 LoC: Potential Runtime Error-Guided Specification Synthesis for Verifying Large-Scale Programs

    by Zhongyi Wang, Tengjie Lin, Mingshuai Chen, Haokun Li, Mingqi Yang, Xiao Yi, Shengchao Qin, Yixing Luo, Xiaofeng Li, Bin Gu, et al.

    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

    Preguss: It Analyzes, It Specifies, It Verifies

    by Zhongyi Wang, Tengjie Lin, Mingshuai Chen, Mingqi Yang, Haokun Li, Xiao Yi, Shengchao Qin, Jianwei Yin


  • Open Access

    Preguss: It Analyzes, It Specifies, It Verifies

    by Zhongyi Wang, Tengjie Lin, Mingshuai Chen, Mingqi Yang, Haokun Li, Xiao Yi, Shengchao Qin, Jianwei Yin

    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

    On the Almost-Sure Termination of Probabilistic Counter Programs

    by Sergei Novozhilov, Mingqi Yang, Mingshuai Chen, Zhiyang Li, Jianwei Yin

    This paper introduces k -d PCPs – the class of probabilistic counter programs with $$k \in \mathbb {N}$$ k ∈ 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.


    • 12 June 2025
    • Published by HAL in HAL
    Open Access

    On the Almost-Sure Termination of Probabilistic Counter Programs

    by Sergei Novozhilov, Mingqi Yang, Mingshuai Chen, Zhiyang Li, Jianwei Yin

    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.