The resolution property of algebraic surfaces

We prove that on separated algebraic surfaces every coherent sheaf is a quotient of a locally free sheaf. This class contains many schemes that are neither normal, reduced, quasiprojective or embeddable into toric varieties. Our methods extend to arbitrary $2$-dimensional schemes that are proper over a noetherian ring.Comment: 19 page

A Deductive Verification Infrastructure for Probabilistic Programs

This paper presents a quantitative program verification infrastructure for discrete probabilistic programs. Our infrastructure can be viewed as the probabilistic analogue of Boogie: its central components are an intermediate verification language (IVL) together with a real-valued logic. Our IVL provides a programming-language-style for expressing verification conditions whose validity implies the correctness of a program under investigation. As our focus is on verifying quantitative properties such as bounds on expected outcomes, expected run-times, or termination probabilities, off-the-shelf IVLs based on Boolean first-order logic do not suffice. Instead, a paradigm shift from the standard Boolean to a real-valued domain is required. Our IVL features quantitative generalizations of standard verification constructs such as assume- and assert-statements. Verification conditions are generated by a weakest-precondition-style semantics, based on our real-valued logic. We show that our verification infrastructure supports natural encodings of numerous verification techniques from the literature. With our SMT-based implementation, we automatically verify a variety of benchmarks. To the best of our knowledge, this establishes the first deductive verification infrastructure for expectation-based reasoning about probabilistic programs

A Deductive Verification Infrastructure for Probabilistic Programs

This paper presents a quantitative program verification infrastructure for discrete probabilistic programs. Our infrastructure can be viewed as the probabilistic analogue of Boogie: its central components are an intermediate verification language (IVL) together with a real-valued logic. Our IVL provides a programming-language-style for expressing verification conditions whose validity implies the correctness of a program under investigation. As our focus is on verifying quantitative properties such as bounds on expected outcomes, expected run-times, or termination probabilities, off-the-shelf IVLs based on Boolean first-order logic do not suffice. Instead, a paradigm shift from the standard Boolean to a real-valued domain is required. Our IVL features quantitative generalizations of standard verification constructs such as assume- and assert-statements. Verification conditions are generated by a weakest-precondition-style semantics, based on our real-valued logic. We show that our verification infrastructure supports natural encodings of numerous verification techniques from the literature. With our SMT-based implementation, we automatically verify a variety of benchmarks. To the best of our knowledge, this establishes the first deductive verification infrastructure for expectation-based reasoning about probabilistic programs

Dilute suspensions in annular shear flow under gravity: simulation and experiment

A dilute suspension in annular shear flow under gravity was simulated using multi-particle collision dynamics (MPC) and compared to experimental data. The focus of the analysis is the local particle velocity and density distribution under the influence of the rotational and gravitational forces. The results are further supported by a deterministic approximation of a single-particle trajectory and OpenFOAM CFD estimations of the overcritical frequency range. Good qualitative agreement is observed for single-particle trajectories between the statistical mean of MPC simulations and the deterministic approximation. Wall contact and detachment however occur earlier in the MPC simulation, which can be explained by the inherent thermal noise of the method. The multi-particle system is investigated at the point of highest particle accumulation that is found at 2/3 of the particle revolution, starting from the top of the annular gap. The combination of shear flow and a slowly rotating volumetric force leads to strong local accumulation in this section that increases the particle volume fraction from overall 0.7% to 4.7% at the outer boundary. MPC simulations and experimental observations agree well in terms of particle distribution and a close to linear velocity profile in radial direction

Game laboratory studies

Prof. Dr. Jens Schröter ist Herausgeber der Reihe und die Herausgeber der einzelnen Hefte sind renommierte Wissenschaftler und -innen aus dem In- und Ausland.Um die Analyse von Computerspielen aus produktionsästhetischer Perspektive zu erproben, lehnt sich der vorliegende Band an die Akteur-Netzwerk-Theorie (ANT) an. Mit ihr geht es ihm um die Frage nach den Aktanten des Game Design – etwa: Welche Hard- und Softwarekomponenten kommen wann und wofür zum Einsatz; wie und mittels welcher Medien notieren Level-Designer ihre Ideen, und wie werden die Aufzeichnungen später von Programmierern implementiert; und welche Rolle spielt eigentlich eine Action-Figur auf dem Schreibtisch eines Textur-Artists

Latticed k-Induction with an Application to Probabilistic Programs

We revisit two well-established verification techniques, k-induction and bounded model checking (BMC), in the more general setting of fixed point theory over complete lattices. Our main theoretical contribution is latticed k-induction, which (i) generalizes classical k-induction for verifying transition systems, (ii) generalizes Park induction for bounding fixed points of monotonic maps on complete lattices, and (iii) extends from naturals k to transfinite ordinals κ , thus yielding κ -induction. The lattice-theoretic understanding of k-induction and BMC enables us to apply both techniques to the fully automatic verification of infinite-state probabilistic programs. Our prototypical implementation manages to automatically verify non-trivial specifications for probabilistic programs taken from the literature that—using existing techniques—cannot be verified without synthesizing a stronger inductive invariant first.ISSN:0302-9743ISSN:1611-334