29 citations · 102 across the 28 of their papers we have counts for
3 papers · 1 filter
Exploring Approximations for Floating-Point Arithmetic using UppSAT
Aleksandar Zeljic, Peter Backeman, Christoph M. Wintersteiger +1
We consider the problem of solving floating-point constraints obtained from software verification. We present UppSAT --- a new implementation of a systematic approximation refineme…
Fair Termination for Parameterized Probabilistic Concurrent Systems (Technical Report)
Ondrej Lengal, Anthony W. Lin, Rupak Majumdar +1
We consider the problem of automatically verifying that a parameterized family of probabilistic concurrent systems terminates with probability one for all instances against adversa…
Learning to Prove Safety over Parameterised Concurrent Systems (Full Version)
Yu-Fang Chen, Chih-Duo Hong, Anthony W. Lin +1
We revisit the classic problem of proving safety over parameterised concurrent systems, i.e., an infinite family of finite-state concurrent systems that are represented by some fin…