activity
20152024
most citedLearning One-Clock Timed Automata

3 citations · 10 across the 12 of their papers we have counts for

collaborators
Showing cs.LOShow all

8 papers · 1 filter

cs.LO2024★ 1 cited

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…

cs.LO2023

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…

cs.LO2022

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…

cs.LO2022★ 1 cited

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…

cs.LO2022

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…

cs.LO2021★ 1 cited

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…

cs.LO2019★ 1 cited

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…

cs.LO2016★ 1 cited

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…