activity
20232026
most citedIncremental Satisfiability Modulo Theory for Verification of Deep Neural Networks

1 citations · 1 across the 5 of their papers we have counts for

collaborators

5 papers

cs.CR2026

Synthesizing Probabilistic Saturating Counters with Differentially Private Formal Guarantees

Zhiming Chi, Lutan Zhao, Depeng Liu +8

Branch predictors improve instruction-level parallelism in modern processors and are commonly modeled using saturating counters. However, classical saturating counters are determin…

cs.AI2026

PAC Approximation and DIRECT Optimization for Parametric Markov Models

Zhiming Chi, Ying Liu, Andrea Turrini +2

In this paper, we consider the parameter synthesis and optimization problem for parametric Markov decision processes (pMDPs), the extension of classical MDPs where exact probabilit…

cs.RO2026

Resource-Constrained Robotic Planning in the face of Mixed Uncertainty

Yihao Yin, Pian Yu, Andrea Turrini +3

Robots operate under significant uncertainty, from quantifiable noise to unquantifiable unknowns, and must account for strict operational constraints, such as limited resources. In…

cs.LG2024

Patch Synthesis for Property Repair of Deep Neural Networks

Zhiming Chi, Jianan Ma, Pengfei Yang +4

Deep neural networks (DNNs) are prone to various dependability issues, such as adversarial attacks, which hinder their adoption in safety-critical domains. Recently, NN repair tech…

cs.AI2023★ 1 cited

Incremental Satisfiability Modulo Theory for Verification of Deep Neural Networks

Pengfei Yang, Zhiming Chi, Zongxin Liu +4

Constraint solving is an elementary way for verification of deep neural networks (DNN). In the domain of AI safety, a DNN might be modified in its structure and parameters for its…