17 citations · 81 across the 44 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.LO2017★ 1 cited
Finding polynomial loop invariants for probabilistic programs
Yijun Feng, Lijun Zhang, David N. Jansen +2
Quantitative loop invariants are an essential element in the verification of probabilistic programs. Recently, multivariate Lagrange interpolation has been applied to synthesizing…
cs.LO2017★ 1 cited
Compositional Hoare-style Reasoning about Hybrid CSP in the Duration Calculus
Dimitar Guelev, Shuling Wang, Naijun Zhan
Deductive methods for the verification of hybrid systems vary on the format of statements in correctness proofs. Building on the example of Hoare triple-based reasoning, we have in…