activity
20172023
most citedFormalization of the fundamental group in untyped set theory using auto2

6 citations · 6 across the 2 of their papers we have counts for

collaborators

6 papers

cs.SC2023

Efficient Local Search for Nonlinear Real Arithmetic

Zhonghan Wang, Bohua Zhan, Bohan Li +1

Local search has recently been applied to SMT problems over various arithmetic theories. Among these, nonlinear real arithmetic poses special challenges due to its uncountable solu…

cs.FL2019

Learning One-Clock Timed Automata

Jie An, Mingshuai Chen, Bohua Zhan +2

We present an algorithm for active learning of deterministic timed automata with a single clock. The algorithm is within the framework of Angluin's algorithm and inspired by…

cs.LO2019

NIL: Learning Nonlinear Interpolants

Mingshuai Chen, Jian Wang, Jie An +3

Nonlinear interpolants have been shown useful for the verification of programs and hybrid systems in contexts of theorem proving, model checking, abstract interpretation, etc. The…

cs.LO2019

HolPy: Interactive Theorem Proving in Python

Bohua Zhan

HolPy is an interactive theorem proving system implemented in Python. It uses higher-order logic as the logical foundation. Its main features include a pervasive use of macros in p…

cs.LO2018

Verifying Asymptotic Time Complexity of Imperative Programs in Isabelle

Bohua Zhan, Maximilian P. L. Haslbeck

We present a framework in Isabelle for verifying asymptotic time complexity of imperative programs. We build upon an extension of Imperative HOL and its separation logic to include…

cs.LO20176 cited

Formalization of the fundamental group in untyped set theory using auto2

Bohua Zhan

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 th…