#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2012

2017

- This year (1)
- Last 5 years (5)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Bohua Zhan, Shelby Kimmel, Avinatan Hassidim
- ITCS
- 2012

We give a quantum algorithm for evaluating a class of boolean formulas (such as NAND trees and 3-majority trees) on a restricted set of inputs. Due to the structure of the allowed inputs, our algorithm can evaluate a depth <i>n</i> tree using <i>O</i>(<i>n</i><sup>2+logω</sup>) queries, where ω is independent of <i>n</i> and depends only on the… (More)

- Bohua Zhan
- ITP
- 2016

We introduce a new theorem prover for classical higherorder logic named auto2. The prover is designed to make use of humanspecified heuristics when searching for proofs. The core algorithm is a best-first search through the space of propositions derivable from the initial assumptions, where new propositions are added by user-defined functions called proof… (More)

- Bohua Zhan
- ITP
- 2017

We present a new framework for formalizing mathematics in untyped set theory using auto2. Using this framework, we formalize in Isabelle/FOL the entire chain of development from the axioms of set theory to the definition of the fundamental group for an arbitrary topological space. The auto2 prover is used as the sole automation tool, and enables succinct… (More)

- Bohua Zhan
- ArXiv
- 2016

- Bohua Zhan
- 2016

We present a new system of automation for separation logic in the interactive theorem prover Isabelle. The system is based on the recently developed auto2 prover, and follows a natural, saturation-based approach to reasoning about imperative programs. In addition to standard examples on linked lists and binary search trees, we apply the automation to… (More)

- ‹
- 1
- ›