#### Filter Results:

#### Publication Year

1983

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- M. Feuerecker, D. Hauer, +6 authors A. Choukèr
- European Journal of Applied Physiology
- 2011

The effects of physical exercise stress on the endocannabinoid system in humans are almost unexplored. In this prospective study, we investigated in a crossover design and under field conditions at different altitudes the effects of physical exercise on the endocannabinoid system (ECS) in 12 trained healthy volunteers. For determination of alterations on… (More)

- Johannes Hölzl, Armin Heller
- ITP
- 2011

(Most of the first three chapters)

We extended Isabelle/HOL with a pair of definitional commands for datatypes and codatatypes. They support mutual and nested (co)recursion through well-behaved type constructors, including mixed recursion–corecursion, and are complemented by syntaxes for introducing primitive (co)recursive functions and by a general proof method for reasoning coinductively.… (More)

- Johannes Hölzl, Fabian Immler, Brian Huffman
- ITP
- 2013

The theory of analysis in Isabelle/HOL derives from earlier formalizations that were limited to specific concrete types: R, C and R n. Isabelle's new analysis theory unifies and generalizes these earlier efforts. The improvements are centered on two primary contributions: a generic theory of limits based on filters, and a new hierarchy of type classes that… (More)

- Fabian Immler, Johannes Hölzl
- ITP
- 2012

- Johannes Hölzl
- 2013

- Andreas Lochbihler, Johannes Hölzl
- ITP
- 2014

The usual definition facilities in theorem provers cannot handle all recursive functions on lazy lists; the filter function is a prime counterexample. We present two new ways of directly defining functions like filter by exploiting their dual nature as producers and consumers. Borrowing from domain theory and topology, we define them as a least fixpoint… (More)

- Jeremy Avigad, Johannes Hölzl, Luke Serafin
- Journal of Automated Reasoning
- 2017

We describe a proof of the Central Limit Theorem that has been formally verified in the Isabelle proof assistant. Our formalization builds upon and extends Isabelle’s libraries for analysis and measure-theoretic probability. The proof of the theorem uses characteristic functions, which are a kind of Fourier transform, to demonstrate that, under suitable… (More)

Sparse matrix formats are typically implemented with low-level imperative programs. The optimized nature of these implementations hides the structural organization of the sparse format and complicates its verification. We define a variable-free functional language (LL) in which even advanced formats can be expressed naturally, as a pipeline-style… (More)

- Andrei Popescu, Johannes Hölzl, Tobias Nipkow
- CPP
- 2012

We perform a formal analysis of compositionality techniques for proving possibilistic noninterference for a while language with parallel composition. We develop a uniform framework where we express a wide range of noninter-ference variants from the literature and compare them w.r.t. their contracts: the strength of the security properties they ensure… (More)