Johannes Hölzl

Orcid: 0000-0003-0869-9250

According to our database1, Johannes Hölzl authored at least 30 papers between 2010 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Formalizing the Solution to the Cap Set Problem.
Proceedings of the 10th International Conference on Interactive Theorem Proving, 2019

2018
Probabilistic Timed Automata.
Arch. Formal Proofs, 2018

MDP + TA = PTA: Probabilistic Timed Automata, Formalized (Short Paper).
Proceedings of the Interactive Theorem Proving - 9th International Conference, 2018

2017
Markov Chains and Markov Decision Processes in Isabelle/HOL.
J. Autom. Reason., 2017

A Formally Verified Proof of the Central Limit Theorem.
J. Autom. Reason., 2017

Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic.
Proceedings of the Frontiers of Combining Systems - 11th International Symposium, 2017

Markov processes in Isabelle/HOL.
Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, 2017

2016
Formalising Semantics for Expected Running Time of Probabilistic Programs.
Proceedings of the Interactive Theorem Proving - 7th International Conference, 2016

2015
A Zoo of Probabilistic Systems.
Arch. Formal Proofs, 2015

Verification of the UpDown Scheme.
Arch. Formal Proofs, 2015

A Formalized Hierarchy of Probabilistic System Types - Proof Pearl.
Proceedings of the Interactive Theorem Proving - 6th International Conference, 2015

2014
A Verified Compiler for Probability Density Functions.
Arch. Formal Proofs, 2014

Probabilistic Noninterference.
Arch. Formal Proofs, 2014

Recursive Functions on Lazy Lists via Domains and Topologies.
Proceedings of the Interactive Theorem Proving - 5th International Conference, 2014

Truly Modular (Co)datatypes for Isabelle/HOL.
Proceedings of the Interactive Theorem Proving - 5th International Conference, 2014

2013
Construction and stochastic applications of measure spaces in higher-order logic.
PhD thesis, 2013

Formal Verification of Language-Based Concurrent Noninterference.
J. Formaliz. Reason., 2013

Type Classes and Filters for Mathematical Analysis in Isabelle/HOL.
Proceedings of the Interactive Theorem Proving - 4th International Conference, 2013

Formalizing Probabilistic Noninterference.
Proceedings of the Certified Programs and Proofs - Third International Conference, 2013

Noninterfering Schedulers - When Possibilistic Noninterference Implies Probabilistic Noninterference.
Proceedings of the Algebra and Coalgebra in Computer Science, 2013

2012
Interactive verification of Markov chains: Two distributed protocol case studies
Proceedings of the Proceedings Quantities in Formal Methods, 2012

Possibilistic Noninterference.
Arch. Formal Proofs, 2012

Ordinary Differential Equations.
Arch. Formal Proofs, 2012

Markov Models.
Arch. Formal Proofs, 2012

Verifying pCTL Model Checking.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2012

Numerical Analysis of Ordinary Differential Equations in Isabelle/HOL.
Proceedings of the Interactive Theorem Proving - Third International Conference, 2012

Proving Concurrent Noninterference.
Proceedings of the Certified Programs and Proofs - Second International Conference, 2012

2011
Three Chapters of Measure Theory in Isabelle/HOL.
Proceedings of the Interactive Theorem Proving - Second International Conference, 2011

2010
Specifying and verifying sparse matrix codes.
Proceedings of the Proceeding of the 15th ACM SIGPLAN international conference on Functional programming, 2010

Quantitative Information Flow Analysis in Isabelle.
Proceedings of the Joint Workshop of the German Research Training Groups in Computer Science, 2010


  Loading...