User profiles for Christoph Sprenger
Christoph SprengerSenior researcher at ETH Zurich Verified email at inf.ethz.ch Cited by 853 |
[HTML][HTML] Sixty years of global progress in managed aquifer recharge
…, C Stefan, M Pettenati, J van der Gun, C Sprenger… - Hydrogeology …, 2019 - Springer
The last 60 years has seen unprecedented groundwater extraction and overdraft as well as
development of new technologies for water treatment that together drive the advance in …
development of new technologies for water treatment that together drive the advance in …
On the Structure of Inductive Reasoning: Circular and Tree-Shaped Proofs in the μCalculus
C Sprenger, M Dam - … Conference on Foundations of Software Science …, 2003 - Springer
In this paper we study induction in the context of the firstorder μ-calculus with explicit
approximations. We present and compare two Gentzen-style proof systems each using a different …
approximations. We present and compare two Gentzen-style proof systems each using a different …
Origin and dynamics of groundwater salinity in the alluvial plains of western Delhi and adjacent territories of Haryana State, India
G Lorenzen, C Sprenger, P Baudron… - Hydrological …, 2012 - Wiley Online Library
Groundwater salinity is a widespread problem and a challenge to water resources management.
It is an increasing concern in the alluvial plains of Delhi and neighbouring Haryana …
It is an increasing concern in the alluvial plains of Delhi and neighbouring Haryana …
Recharge sources and hydrogeochemical evolution of groundwater in semiarid and karstic environments: A field study in the Granada Basin (Southern Spain)
The objective of this study is to refine the understanding of recharge processes in
watersheds representative for karstic semiarid areas by means of stable isotope analysis and …
watersheds representative for karstic semiarid areas by means of stable isotope analysis and …
{EPIC}: every packet is checked in the data plane of a {Path-Aware} Internet
An exciting insight of recent networking research has been that path-aware networking
architectures are able to fundamentally solve many of the security issues of today’s Internet, while …
architectures are able to fundamentally solve many of the security issues of today’s Internet, while …
Cutoff bounds for consensus algorithms
O Marić, C Sprenger, D Basin - … , CAV 2017, Heidelberg, Germany, July 24 …, 2017 - Springer
Consensus algorithms are fundamental building blocks for fault-tolerant distributed systems
and their correctness is critical. However, there are currently no fully-automated methods for …
and their correctness is critical. However, there are currently no fully-automated methods for …
Igloo: soundly linking compositional refinement and separation logic for distributed system verification
Lighthouse projects like CompCert, seL4, IronFleet, and DeepSpec have demonstrated that
full system verification is feasible by establishing a refinement between an abstract system …
full system verification is feasible by establishing a refinement between an abstract system …
A verified model checker for the modal μ-calculus in Coq
C Sprenger - International Conference on Tools and Algorithms for …, 1998 - Springer
We report on the formalisation and correctness proof of a model checker for the modal Μ-calculus
in Coq's constructive type theory. Using Coq's extraction mechanism we obtain an …
in Coq's constructive type theory. Using Coq's extraction mechanism we obtain an …
SoK: Delegation and Revocation, the Missing Links in the Web's Chain of Trust
The ability to quickly revoke a compromised key is critical to the security of any public-key
infrastructure. Regrettably, most traditional certificate revocation schemes suffer from latency, …
infrastructure. Regrettably, most traditional certificate revocation schemes suffer from latency, …
On global induction mechanisms in a μ-calculus with explicit approximations
C Sprenger, M Dam - RAIRO-Theoretical Informatics and …, 2003 - cambridge.org
We investigate a Gentzen-style proof system for the first-order μ-calculus based on cyclic
proofs, produced by unfolding fixed point formulas and detecting repeated proof goals. Our …
proofs, produced by unfolding fixed point formulas and detecting repeated proof goals. Our …