4 citations · 7 across the 6 of their papers we have counts for
6 papers
Proof-Producing Translation of Functional Programs into a Time \& Space Reasonable Model
Kevin Kappelmann, Fabian Huch, Lukas Stevens +1
We present a semi-automated framework to construct and reason about programs in a deeply-embedded while-language. The while-language we consider is a simple computation model that…
Isabelle as Systems Platform: Managing Automated and Quasi-interactive Builds
Fabian Huch
Interactive theorem provers are complex systems that require sophisticated platform efforts - and hence systems programming environments - to manage effectively. The Isabelle platf…
The Isabelle Community Benchmark
Fabian Huch, Vincent Bode
Choosing hardware for theorem proving is no simple task: automated provers are highly complex and optimized programs, often utilizing a parallel computation model, and there is lit…
Structure in Theorem Proving: Analyzing and Improving the Isabelle Archive of Formal Proofs
Fabian Huch
The Isabelle Archive of Formal Proofs has grown to a significant size in the past years. It makes up for an impressive body of research, which enables a number of statistical appro…
A Linter for Isabelle: Implementation and Evaluation
Yecine Megdiche, Fabian Huch, Lukas Stevens
In interactive theorem proving, formalization quality is a key factor for maintainability and re-usability of developments and can also impact proof-checking performance. Commonly,…
FindFacts: A Scalable Theorem Search
Fabian Huch, Alexander Krauss
The Isabelle Archive of Formal Proofs (AFP) has grown to over 500 articles in late 2019. Meanwhile, finding formalizations in it has not exactly become easier. At the time of writi…