Related papers: Dynamic IFC Theorems for Free!
The survey is devoted to the combinatorial and metric theory of filtrations, i.\,e., decreasing sequences of $\sigma$-algebras in measure spaces or decreasing sequences of subalgebras of certain algebras. One of the key notions, that of…
We investigate some aspects of the module $L$ equipped with the property that $Tor_1^R(L, F) =0$ implies that $F$ is free. This has some applications.
We give a formal treatment of simple type theories, such as the simply-typed $\lambda$-calculus, using the framework of abstract clones. Abstract clones traditionally describe first-order structures, but by equipping them with additional…
We prove an implicit function theorem and an inverse function theorem for free noncommutative functions over operator spaces and on the set of nilpotent matrices. We apply these results to study dependence of the solution of the initial…
Asymptotic independence of the components of random vectors is a concept used in many applications. The standard criteria for checking asymptotic independence are given in terms of distribution functions (dfs). Dfs are rarely available in…
Acoustic transparency is the capability of a medium to transmit mechanical waves to adjacent media, without scattering. This characteristic can be achieved by carefully engineering the acoustic impedance of the medium -- a combination of…
Divergence-free Lie algebras (also known as the special Lie algebras of Cartan type) are Lie algebras of volume-preserving transformation groups. They are simple in generic case. Dokovic and Zhao found a certain graded generalization of…
In this paper we analyse and improve integer discrete flows for lossless compression. Integer discrete flows are a recently proposed class of models that learn invertible transformations for integer-valued random variables. Their discrete…
Transactional memory is a mechanism that manages thread synchronisation on behalf of a programmer so that blocks of code execute with an illusion of atomicity. The main safety criterion for transactional memory is opacity, which defines…
Universality is one of the most important ideas in computability theory. There are various criteria of simplicity for universal Turing machines. Probably the most popular one is to count the number of states/symbols. This criterion is more…
In this report proofs are presented for a method for abstracting continuous dynamical systems by timed automata. The method is based on partitioning the state space of dynamical systems with invariant sets, which form cells representing…
We show normalisation and decidability of convertibility for a type theory with a hierarchy of universes and a proof irrelevant type of propositions, close to the type system used in the proof assistant Lean. Contrary to previous arguments,…
Verifying the performance of safety-critical, stochastic systems with complex noise distributions is difficult. We introduce a general procedure for the finite abstraction of nonlinear stochastic systems with non-standard (e.g., non-affine,…
Feature attribution methods (FAs) are popular approaches for providing insights into the model reasoning process of making predictions. The more faithful a FA is, the more accurately it reflects which parts of the input are more important…
Dung's abstract argumentation theory is a widely used formalism to model conflicting information and to draw conclusions in such situations. Hereby, the knowledge is represented by so-called argumentation frameworks (AFs) and the reasoning…
In this paper we use pre existing language support for type modifiers and object capabilities to enable a system for sound runtime verification of invariants. Our system guarantees that class invariants hold for all objects involved in…
We consider a multi-fluid system with several free interfaces. For this system we prove existence of three-dimensional steady gravity-capillary waves with non-zero vorticity. We obtain non-zero vorticity by prescribing the relative velocity…
A fundamental question in computer science is: Is it harder to solve $n$ instances independently than to solve them simultaneously? This question, known as the direct sum question or direct sum theorem, has been paid much attention in…
We demonstrate, by a number of examples, that information-flow security properties can be proved from abstract architectural descriptions, that describe only the causal structure of a system and local properties of trusted components. We…
In the paper, we study behavior of discrete dynamical systems (automata) w.r.t. transitivity; that is, speaking loosely, we consider how diverse may be behavior of the system w.r.t. variety of word transformations performed by the system:…