## Stem uninterpret$ (all stems)

### 11 papers:

- ESOP-2006-GulwaniT #abstraction #linear
- Assertion Checking over Combined Abstraction of Linear Arithmetic and Uninterpreted Functions (SG, AT), pp. 279–293.
- SAS-2004-GulwaniN04a #analysis #linear
- Path-Sensitive Analysis for Linear Arithmetic and Uninterpreted Functions (SG, GCN), pp. 328–343.
- DAC-2003-SeshiaLB #hybrid #logic #satisfiability
- A hybrid SAT-based decision procedure for separation logic with uninterpreted functions (SAS, SKL, REB), pp. 425–430.
- CADE-2003-GulwaniN #random
- A Randomized Satisfability Procedure for Arithmetic and Uninterpreted Function Symbols (SG, GCN), pp. 167–181.
- CAV-2002-BryantLS #logic #modelling #using #verification
- Modeling and Verifying Systems Using a Logic of Counter Arithmetic with λ Expressions and Uninterpreted Functions (REB, SKL, SAS), pp. 78–92.
- CAV-2001-RodehS #equivalence #finite #logic
- Finite Instantiations in Equivalence Logic with Uninterpreted Functions (YR, OS), pp. 144–154.
- CAV-2001-VelevB #logic #named #similarity
- EVC: A Validity Checker for the Logic of Equality with Uninterpreted Functions and Memories, Exploiting Positive Equality, and Conservative Transformations (MNV, REB), pp. 235–240.
- CAV-1999-BryantGV #logic #similarity
- Exploiting Positive Equality in a Logic of Equality with Uninterpreted Functions (REB, SMG, MNV), pp. 470–482.
- CAV-1998-GoelSZAS #formal method #similarity
- BDD Based Procedures for a Theory of Equality with Uninterpreted Functions (AG, KS, HZ, AA, VS), pp. 244–255.
- CAV-1998-IslesHB #infinity #memory management
- Computing Reachable Control States of Systems Modeled with Uninterpreted Functions and Infinite Memory (AJI, RH, RKB), pp. 256–267.
- ML-1991-Pierce #learning #set
- Learning a Set of Primitive Actions with an Uninterpreted Sensorimotor Apparatus (DRP), pp. 338–342.