default search action
Johannes Hölzl
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j12]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:
AutoCorres2. Arch. Formal Proofs 2024 (2024) - 2022
- [c20]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:
Towards a beneficial management of personal health records. CENTERIS/ProjMAN/HCist 2022: 1145-1152
2010 – 2019
- 2019
- [c19]Sander R. Dahmen, Johannes Hölzl, Robert Y. Lewis:
Formalizing the Solution to the Cap Set Problem. ITP 2019: 15:1-15:19 - [i3]Sander R. Dahmen, Johannes Hölzl, Robert Y. Lewis:
Formalizing the Solution to the Cap Set Problem. CoRR abs/1907.01449 (2019) - 2018
- [j11]Simon Wimmer, Johannes Hölzl:
Probabilistic Timed Automata. Arch. Formal Proofs 2018 (2018) - [c18]Simon Wimmer, Johannes Hölzl:
MDP + TA = PTA: Probabilistic Timed Automata, Formalized (Short Paper). ITP 2018: 597-603 - 2017
- [j10]Johannes Hölzl:
Markov Chains and Markov Decision Processes in Isabelle/HOL. J. Autom. Reason. 59(3): 345-387 (2017) - [j9]Jeremy Avigad, Johannes Hölzl, Luke Serafin:
A Formally Verified Proof of the Central Limit Theorem. J. Autom. Reason. 59(4): 389-423 (2017) - [c17]Johannes Hölzl:
Markov processes in Isabelle/HOL. CPP 2017: 100-111 - [c16]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:
Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic. FroCoS 2017: 3-21 - [i2]Manuel Eberl, Johannes Hölzl, Tobias Nipkow:
A Verified Compiler for Probability Density Functions. CoRR abs/1707.06901 (2017) - 2016
- [c15]Johannes Hölzl:
Formalising Semantics for Expected Running Time of Probabilistic Programs. ITP 2016: 475-482 - 2015
- [j8]Johannes Hölzl:
Verification of the UpDown Scheme. Arch. Formal Proofs 2015 (2015) - [j7]Johannes Hölzl, Andreas Lochbihler, Dmitriy Traytel:
A Zoo of Probabilistic Systems. Arch. Formal Proofs 2015 (2015) - [c14]Manuel Eberl, Johannes Hölzl, Tobias Nipkow:
A Verified Compiler for Probability Density Functions. ESOP 2015: 80-104 - [c13]Johannes Hölzl, Andreas Lochbihler, Dmitriy Traytel:
A Formalized Hierarchy of Probabilistic System Types - Proof Pearl. ITP 2015: 203-220 - 2014
- [j6]Andrei Popescu, Johannes Hölzl:
Probabilistic Noninterference. Arch. Formal Proofs 2014 (2014) - [j5]Manuel Eberl, Johannes Hölzl, Tobias Nipkow:
A Verified Compiler for Probability Density Functions. Arch. Formal Proofs 2014 (2014) - [c12]Jasmin Christian Blanchette, Johannes Hölzl, Andreas Lochbihler, Lorenz Panny, Andrei Popescu, Dmitriy Traytel:
Truly Modular (Co)datatypes for Isabelle/HOL. ITP 2014: 93-110 - [c11]Andreas Lochbihler, Johannes Hölzl:
Recursive Functions on Lazy Lists via Domains and Topologies. ITP 2014: 341-357 - [i1]Jeremy Avigad, Johannes Hölzl, Luke Serafin:
A formally verified proof of the Central Limit Theorem. CoRR abs/1405.7012 (2014) - 2013
- [b1]Johannes Hölzl:
Construction and stochastic applications of measure spaces in higher-order logic. Technical University Munich, 2013, pp. 1-110 - [j4]Andrei Popescu, Johannes Hölzl, Tobias Nipkow:
Formal Verification of Language-Based Concurrent Noninterference. J. Formaliz. Reason. 6(1): 1-30 (2013) - [c10]Andrei Popescu, Johannes Hölzl, Tobias Nipkow:
Noninterfering Schedulers - When Possibilistic Noninterference Implies Probabilistic Noninterference. CALCO 2013: 236-252 - [c9]Andrei Popescu, Johannes Hölzl, Tobias Nipkow:
Formalizing Probabilistic Noninterference. CPP 2013: 259-275 - [c8]Johannes Hölzl, Fabian Immler, Brian Huffman:
Type Classes and Filters for Mathematical Analysis in Isabelle/HOL. ITP 2013: 279-294 - 2012
- [j3]Johannes Hölzl, Tobias Nipkow:
Markov Models. Arch. Formal Proofs 2012 (2012) - [j2]Fabian Immler, Johannes Hölzl:
Ordinary Differential Equations. Arch. Formal Proofs 2012 (2012) - [j1]Andrei Popescu, Johannes Hölzl:
Possibilistic Noninterference. Arch. Formal Proofs 2012 (2012) - [c7]Andrei Popescu, Johannes Hölzl, Tobias Nipkow:
Proving Concurrent Noninterference. CPP 2012: 109-125 - [c6]Fabian Immler, Johannes Hölzl:
Numerical Analysis of Ordinary Differential Equations in Isabelle/HOL. ITP 2012: 377-392 - [c5]Johannes Hölzl, Tobias Nipkow:
Verifying pCTL Model Checking. TACAS 2012: 347-361 - [c4]Johannes Hölzl, Tobias Nipkow:
Interactive verification of Markov chains: Two distributed protocol case studies. QFM 2012: 17-31 - 2011
- [c3]Johannes Hölzl, Armin Heller:
Three Chapters of Measure Theory in Isabelle/HOL. ITP 2011: 135-151 - 2010
- [c2]Johannes Hölzl:
Quantitative Information Flow Analysis in Isabelle. AlgoSyn 2010: 150 - [c1]Gilad Arnold, Johannes Hölzl, Ali Sinan Köksal, Rastislav Bodík, Mooly Sagiv:
Specifying and verifying sparse matrix codes. ICFP 2010: 249-260
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-30 20:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint