A Pre-expectation Calculus for Probabilistic Sensitivity

Sensitivity properties describe how changes to the input of a program affect the output, typically by upper bounding the distance between the outputs of two runs by a monotone function of the distance between the corresponding inputs. When programs are probabilistic, the distance between outputs is a distance between distributions. The Kantorovich lifting provides a general way of defining a distance between distributions by lifting the distance of the underlying sample space; by choosing an appropriate distance on the base space, one can recover other usual probabilistic distances, such as the Total Variation distance. We develop a relational pre-expectation calculus to upper bound the Kantorovich distance between two executions of a probabilistic program. We illustrate our methods by proving algorithmic stability of a machine learning algorithm, convergence of a reinforcement learning algorithm, and fast mixing for card shuffling algorithms. We also consider some extensions: using our calculus to show convergence of Markov chains to the uniform distribution over states and an asynchronous extension to reason about pairs of program executions with different control flow

SL-COMP: Competition of Solvers for Separation Logic

International audienceSL-COMP aims at bringing together researchers interested on improving the state of the art of the automated deduction methods for Separation Logic (SL). The event took place twice until now and collected more than 1K problems for different fragments of SL. The input format of problems is based on the SMT-LIB format and therefore fully typed; only one new command is added to SMT-LIB's list, the command for the declaration of the heap's type. The SMT-LIB theory of SL comes with ten logics, some of them being combinations of SL with linear arithmetics. The competition's divisions are defined by the logic fragment, the kind of decision problem (satisfiability or entailment) and the presence of quantifiers. Until now, SL-COMP has been run on the StarExec platform, where the benchmark set and the binaries of participant solvers are freely available. The benchmark set is also available with the competition's documentation on a public repository in GitHub

Workshop: Schifffahrt und Logistik auf Binnenwasserstrassen - NAVILOG 2002 Tagungsband

SIGLEAvailable from TIB Hannover: ZA 2371(88) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman

Forschungsvorhaben und Projektstudien im Wasserbau und Kuesteningenieurwesen in der Zeit von Mai 1998 bis Maerz 2000

Available from TIB Hannover: F01B665 / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman

Schnelle Binnenschiffe fuer Kombiverkehre und Containertransport. Konzepte und Techniken im Kuestenschutz im Land Niedersachsen. Grundlagen fuer den Aufbau verteilt agierender Umweltinformationssysteme

Available from TIB Hannover: ZA 2371(84); L bau820j / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman

Konstruktive Massnahmen zur Stabilisierung von Deichen. Simulation von Sedimenttransportprozessen in tidebeeinflussten Hafengebieten. Folgen von klimabedingten Wasserstands- und Windaenderungen fuer den Kuestenschutz an der Unterweser. Anwendbarkeit kommerzieller Radar-Wasserstandspegel zur Seegangsmessung

SIGLEAvailable from TIB Hannover: ZA 2371(86); L bau820j / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman