150 citations · 341 across the 17 of their papers we have counts for
4 papers · 1 filter
Learning Probabilistic Systems from Tree Samples
Anvesh Komuravelli, Corina S. Pasareanu, Edmund M. Clarke
We consider the problem of learning a non-deterministic probabilistic system consistent with a given finite set of positive and negative tree samples. Consistency is defined with r…
Assume-Guarantee Abstraction Refinement for Probabilistic Systems
Anvesh Komuravelli, Corina S. Pasareanu, Edmund M. Clarke
We describe an automated technique for assume-guarantee style checking of strong simulation between a system and a specification, both expressed as non-deterministic Labeled Probab…
Delta-Decidability over the Reals
Sicun Gao, Jeremy Avigad, Edmund Clarke
Given any collection F of computable functions over the reals, we show that there exists an algorithm that, given any L_F-sentence φcontaining only bounded quantifiers, and any pos…
Delta-Complete Decision Procedures for Satisfiability over the Reals
Sicun Gao, Jeremy Avigad, Edmund Clarke
We introduce the notion of "δ-complete decision procedures" for solving SMT problems over the real numbers, with the aim of handling a wide range of nonlinear functions including t…