Search Results for author:
Found 8 papers, 5 papers with code
Compression of enumerations and gain
We study the compressibility of enumerations, and its role in the relative Kolmogorov complexity of computably enumerable sets, with respect to density.
Learning One-Clock Timed Automata
We present an algorithm for active learning of deterministic timed automata with a single clock.
Formal Languages and Automata Theory
NIL: Learning Nonlinear Interpolants
Nonlinear interpolants have been shown useful for the verification of programs and hybrid systems in contexts of theorem proving, model checking, abstract interpretation, etc.
holpy: Interactive Theorem Proving in Python
The design of modern proof assistants is faced with several sometimes conflicting goals, including scalability, extensibility, and soundness of proof checking.
Logic in Computer Science
Verifying Asymptotic Time Complexity of Imperative Programs in Isabelle
We present a framework in Isabelle for verifying asymptotic time complexity of imperative programs.
Logic in Computer Science
Formalization of the fundamental group in untyped set theory using auto2
We present a new framework for formalizing mathematics in untyped set theory using auto2.
Logic in Computer Science
Efficient verification of imperative programs using auto2
We also verify several algorithms making use of these data structures.
Logic in Computer Science
AUTO2, a saturation-based heuristic prover for higher-order logic
We introduce a new theorem prover for classical higher-order logic named auto2.
Logic in Computer Science
