3 citations · 10 across the 12 of their papers we have counts for
15 papers
Parf: Adaptive Parameter Refining for Abstract Interpretation
Zhongyi Wang, Linyu Yang, Mingshuai Chen +6
The core challenge in applying abstract interpretation lies in the configuration of abstraction and analysis strategies encoded by a large number of external parameters of static a…
HORAE: A Domain-Agnostic Language for Automated Service Regulation
Yutao Sun, Mingshuai Chen, Tiancheng Zhao +8
Artificial intelligence is rapidly encroaching on the field of service regulation. However, existing AI-based regulation techniques are often tailored to specific application domai…
Exact Bayesian Inference for Loopy Probabilistic Programs using Generating Functions
Lutz Klinkenberg, Christian Blumenthal, Mingshuai Chen +2
We present an exact Bayesian inference method for inferring posterior distributions encoded by probabilistic programs featuring possibly unbounded loops. Our method is built on a d…
Lower Bounds for Possibly Divergent Probabilistic Programs
Shenghua Feng, Mingshuai Chen, Han Su +3
We present a new proof rule for verifying lower bounds on quantities of probabilistic programs. Our proof rule is not confined to almost-surely terminating programs -- as is the ca…
Exact Probabilistic Inference Using Generating Functions
Lutz Klinkenberg, Tobias Winkler, Mingshuai Chen +1
Probabilistic programs are typically normal-looking programs describing posterior probability distributions. They intrinsically code up randomized algorithms and have long been at…
Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming
Qiuye Wang, Mingshuai Chen, Bai Xue +2
A barrier certificate often serves as an inductive invariant that isolates an unsafe region from the reachable set of states, and hence is widely used in proving safety of hybrid s…
PA-Boot: A Formally Verified Authentication Protocol for Multiprocessor Secure Boot
Zhuoruo Zhang, Rui Chang, Mingshuai Chen +5
Hardware supply-chain attacks are raising significant security threats to the boot process of multiprocessor systems. This paper identifies a new, prevalent hardware supply-chain a…
Does a Program Yield the Right Distribution? Verifying Probabilistic Programs via Generating Functions
Mingshuai Chen, Joost-Pieter Katoen, Lutz Klinkenberg +1
We study discrete probabilistic programs with potentially unbounded looping behaviors over an infinite state space. We present, to the best of our knowledge, the first decidability…
Probabilistic Program Verification via Inductive Synthesis of Inductive Invariants
Kevin Batz, Mingshuai Chen, Sebastian Junges +3
Essential tasks for the verification of probabilistic programs include bounding expected outcomes and proving termination in finite expected runtime. We contribute a simple yet eff…
Synthesizing Invariant Barrier Certificates via Difference-of-Convex Programming
Qiuye Wang, Mingshuai Chen, Bai Xue +2
A barrier certificate often serves as an inductive invariant that isolates an unsafe region from the reachable set of states, and hence is widely used in proving safety of hybrid s…
Unbounded-Time Safety Verification of Stochastic Differential Dynamics
Shenghua Feng, Mingshuai Chen, Bai Xue +2
In this paper, we propose a method for bounding the probability that a stochastic differential equation (SDE) system violates a safety specification over the infinite time horizon.…
Learning One-Clock Timed Automata
Jie An, Mingshuai Chen, Bohua Zhan +2
We present an algorithm for active learning of deterministic timed automata with a single clock. The algorithm is within the framework of Angluin's algorithm and inspired by…
NIL: Learning Nonlinear Interpolants
Mingshuai Chen, Jian Wang, Jie An +3
Nonlinear interpolants have been shown useful for the verification of programs and hybrid systems in contexts of theorem proving, model checking, abstract interpretation, etc. The…
Interpolation synthesis for quadratic polynomial inequalities and combination with EUF
Ting Gan, Liyun Dai, Bican Xia +3
An algorithm for generating interpolants for formulas which are conjunctions of quadratic polynomial inequalities (both strict and nonstrict) is proposed. The algorithm is based on…
On Termination of Polynomial Programs with Equality Conditions
Yangjia Li, Naijun Zhan, Mingshuai Chen +3
We investigate the termination problem of a family of multi-path polynomial programs (MPPs), in which all assignments to program variables are polynomials, and test conditions of l…