Abstract. Applications in software verification often require determining the satisfiability of first-order formulæ with respect to some background theories. During development...
We consider equational theories for functions defined via recursion involving equations between closed terms with natural rules based on recursive definitions of the function symb...
Abstract. We introduce the notion of array-based system as a suittraction of infinite state systems such as broadcast protocols or sorting programs. By using a class of quantified-...
We present a novel approach to automatic synthesis of loopfree programs. The approach is based on a combination of oracle-guided learning from examples, and constraint-based synth...
Susmit Jha, Sumit Gulwani, Sanjit A. Seshia, Ashis...
Modifying the methods of Z. Adamowicz's paper Herbrand consistency and bounded arithmetic (Fund. Math. 171 (2002)), we show that there exists a number n such that m Sm (the u...