23 citations · 63 across the 17 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.LO2015★ 23 cited
On Deciding Local Theory Extensions via E-matching
Kshitij Bansal, Andrew Reynolds, Tim King +2
Satisfiability Modulo Theories (SMT) solvers incorporate decision procedures for theories of data types that commonly occur in software. This makes them important tools for automat…
cs.PL2015★ 23 cited
Learning Invariants using Decision Trees
Siddharth Krishna, Christian Puhrsch, Thomas Wies
The problem of inferring an inductive invariant for verifying program safety can be formulated in terms of binary classification. This is a standard problem in machine learning: gi…