Johannes Hölzl

According to our database, Johannes Hölzl authored at least 32 papers between 2010 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

AutoCorres2.

Matthew Brecknell, David Greenaway, Johannes Hölzl, Fabian Immler, Gerwin Klein, Rafal Kolanski, Japheth Lim, Michael Norrish, Norbert Schirmer, Salomon Sickert, Thomas Sewell, Harvey Tuch, Simon Wimmer

Arch. Formal Proofs, 2024

2022

Towards a beneficial management of personal health records.

Christian Kop, Gerhard Leitner, Peter Schartner, Volodymyr A. Shekhovtsov, Claudia Steinberger, Eleni Zografou, Daniela Elisabeth Ströckl, Christoph Voutsinas, Herbert Groiss, Johannes Hölzl, Markus Irrasch

Proceedings of the CENTERIS 2022 - International Conference on ENTERprise Information Systems / ProjMAN - International Conference on Project MANagement / HCist, 2022

2019

Formalizing the Solution to the Cap Set Problem.

Sander R. Dahmen, Johannes Hölzl, Robert Y. Lewis

Proceedings of the 10th International Conference on Interactive Theorem Proving, 2019

2018

Probabilistic Timed Automata.

Simon Wimmer, Johannes Hölzl

Arch. Formal Proofs, 2018

MDP + TA = PTA: Probabilistic Timed Automata, Formalized (Short Paper).

Simon Wimmer, Johannes Hölzl

Proceedings of the Interactive Theorem Proving - 9th International Conference, 2018

2017

Markov Chains and Markov Decision Processes in Isabelle/HOL.

Johannes Hölzl

J. Autom. Reason., 2017

A Formally Verified Proof of the Central Limit Theorem.

Jeremy Avigad, Johannes Hölzl, Luke Serafin

J. Autom. Reason., 2017

Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic.

Julian Biendarra, Jasmin Christian Blanchette, Aymeric Bouzy, Martin Desharnais, Mathias Fleury, Johannes Hölzl, Ondrej Kuncar, Andreas Lochbihler, Fabian Meier, Lorenz Panny, Andrei Popescu, Christian Sternagel, René Thiemann, Dmitriy Traytel

Proceedings of the Frontiers of Combining Systems - 11th International Symposium, 2017

Markov processes in Isabelle/HOL.

Johannes Hölzl

Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, 2017

2016

Formalising Semantics for Expected Running Time of Probabilistic Programs.

Johannes Hölzl

Proceedings of the Interactive Theorem Proving - 7th International Conference, 2016

2015

A Zoo of Probabilistic Systems.

Johannes Hölzl, Andreas Lochbihler, Dmitriy Traytel

Arch. Formal Proofs, 2015

Verification of the UpDown Scheme.

Johannes Hölzl

Arch. Formal Proofs, 2015

A Formalized Hierarchy of Probabilistic System Types - Proof Pearl.

Johannes Hölzl, Andreas Lochbihler, Dmitriy Traytel

Proceedings of the Interactive Theorem Proving - 6th International Conference, 2015

2014

A Verified Compiler for Probability Density Functions.

Manuel Eberl, Johannes Hölzl, Tobias Nipkow

Arch. Formal Proofs, 2014

Probabilistic Noninterference.

Andrei Popescu, Johannes Hölzl

Arch. Formal Proofs, 2014

Recursive Functions on Lazy Lists via Domains and Topologies.

Andreas Lochbihler, Johannes Hölzl

Proceedings of the Interactive Theorem Proving - 5th International Conference, 2014

Truly Modular (Co)datatypes for Isabelle/HOL.

Jasmin Christian Blanchette, Johannes Hölzl, Andreas Lochbihler, Lorenz Panny, Andrei Popescu, Dmitriy Traytel

Proceedings of the Interactive Theorem Proving - 5th International Conference, 2014

2013

Construction and stochastic applications of measure spaces in higher-order logic.

Johannes Hölzl

PhD thesis, 2013

Formal Verification of Language-Based Concurrent Noninterference.

Andrei Popescu, Johannes Hölzl, Tobias Nipkow

J. Formaliz. Reason., 2013

Type Classes and Filters for Mathematical Analysis in Isabelle/HOL.

Johannes Hölzl, Fabian Immler, Brian Huffman

Proceedings of the Interactive Theorem Proving - 4th International Conference, 2013

Formalizing Probabilistic Noninterference.

Andrei Popescu, Johannes Hölzl, Tobias Nipkow

Proceedings of the Certified Programs and Proofs - Third International Conference, 2013

Noninterfering Schedulers - When Possibilistic Noninterference Implies Probabilistic Noninterference.

Andrei Popescu, Johannes Hölzl, Tobias Nipkow

Proceedings of the Algebra and Coalgebra in Computer Science, 2013

2012

Interactive verification of Markov chains: Two distributed protocol case studies

Johannes Hölzl, Tobias Nipkow

Proceedings of the Proceedings Quantities in Formal Methods, 2012

Possibilistic Noninterference.

Andrei Popescu, Johannes Hölzl

Arch. Formal Proofs, 2012

Ordinary Differential Equations.

Fabian Immler, Johannes Hölzl

Arch. Formal Proofs, 2012

Markov Models.

Johannes Hölzl, Tobias Nipkow

Arch. Formal Proofs, 2012

Verifying pCTL Model Checking.

Johannes Hölzl, Tobias Nipkow

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2012

Numerical Analysis of Ordinary Differential Equations in Isabelle/HOL.

Fabian Immler, Johannes Hölzl

Proceedings of the Interactive Theorem Proving - Third International Conference, 2012

Proving Concurrent Noninterference.

Andrei Popescu, Johannes Hölzl, Tobias Nipkow

Proceedings of the Certified Programs and Proofs - Second International Conference, 2012

2011

Three Chapters of Measure Theory in Isabelle/HOL.

Johannes Hölzl, Armin Heller

Proceedings of the Interactive Theorem Proving - Second International Conference, 2011

2010

Specifying and verifying sparse matrix codes.

Gilad Arnold, Johannes Hölzl, Ali Sinan Köksal, Rastislav Bodík, Mooly Sagiv

Proceedings of the Proceeding of the 15th ACM SIGPLAN international conference on Functional programming, 2010

Quantitative Information Flow Analysis in Isabelle.

Johannes Hölzl

Proceedings of the Joint Workshop of the German Research Training Groups in Computer Science, 2010