Heiko Becker is a software engineer and language engineer with 11 years of experience, based in Saarbrücken, who specializes in designing domain-specific languages and building correct-by-construction software. With a PhD from Saarland University and a strong background in theorem proving, he contributes to formally verified systems such as CakeML and HOL4, focusing on core algorithms, FP arithmetic, and proof development. His work emphasizes maintainable, readable code that encodes correctness from the start, bringing research-grade rigor to practical DSL engineering for customers. Notably, he has made substantive low-level contributions to well-known formal verification projects, bridging academic theory and production-quality implementations.
11 years of coding experience
Master of Science - MS, Computer Science, Master of Science - MS, Computer Science at Universität des Saarlandes
Doktor der Ingenieurswissenschaften, Computer Science, Doktor der Ingenieurswissenschaften, Computer Science at Saarland University
Contributions:11 reviews, 510 commits, 15 PRs in 5 years 6 months
Contributions summary:Heiko primarily contributed to the verification and implementation of the core ML algorithm in CakeML. The commits focus on defining the repeat function and supporting lemmas, defining new constant terms and implementing FP operations. The user made changes in many files including characteristic/cfDivScript.sml, and many proofs. These changes focused on the core algorithms and core semantics.
Canonical sources for HOL4 theorem-proving system. Branch develop is where “mainline development” occurs; when develop passes our regression tests, master is merged forward to catch up.
Role in this project:
Back-end Developer
Contributions:1 review, 46 commits, 24 PRs in 5 years 8 months
Contributions summary:Heiko contributed to the HOL4 theorem-proving system, focusing on modifying and extending the core functionalities of the system. They implemented changes to tactics (MATCH_MP_TAC), added new theorems about rounding in floating-point arithmetic, and introduced functions for searching constants of a given type. Furthermore, the user enhanced the system's capabilities by adding functionality to handle option binding and by fixing bugs related to the loading of snippets for the Emacs mode. They also added test cases to verify the contributions.
pythonsatsat-solversourcesmerged
Find and Hire Top DevelopersWe’ve analyzed the programming source code of over 60 million software developers on GitHub and scored them by 50,000 skills. Sign-up on Prog,AI to search for software developers.