Related papers: Formal Derivation of Concurrent Garbage Collectors
In this paper we consider first-order logic theorem proving and model building via approximation and instantiation. Given a clause set we propose its approximation into a simplified clause set where satisfiability is decidable. The…
This paper proposes a method for deriving formal specifications of systems. To accomplish this task we pass through a non trivial number of steps, concepts and tools where the first one, the most important, is the concept of method itself,…
Theory-guided machine learning has demonstrated that including authentic domain knowledge directly into model design improves performance, sample efficiency and out-of-distribution generalisation. Yet the process by which a formal domain…
Causal discovery with latent confounders is an important but challenging task in many scientific areas. Despite the success of some overcomplete independent component analysis (OICA) based methods in certain domains, they are…
A combinatorial theory of associative $n$-categories has recently been proposed, with strictly associative and unital composition in all dimensions, and the weak structure arising as a combinatorial notion of homotopy with a natural…
In this paper, we prove the FPP conjecture, giving a strong upper bound on the unitary dual of a real reductive group. Our proof is an application of the global generation properties of $\mathcal{D}$-modules on the flag variety and their…
The discriminative approach to classification using deep neural networks has become the de-facto standard in various fields. Complementing recent reservations about safety against adversarial examples, we show that conventional…
In this work, we present a method for unsupervised domain adaptation. Many adversarial learning methods train domain classifier networks to distinguish the features as either a source or target and train a feature generator network to mimic…
Interpretation methods and their restrictions to polynomials have been deeply used to control the termination and complexity of first-order term rewrite systems. This paper extends interpretation methods to a pure higher order functional…
Making classifiers robust to adversarial examples is hard. Thus, many defenses tackle the seemingly easier task of detecting perturbed inputs. We show a barrier towards this goal. We prove a general hardness reduction between detection and…
We present a sound and complete unification procedure for deterministic higher-order patterns, a class of simply-typed lambda terms introduced by Yokoyama et al. which comes with a deterministic matching problem. Our unification procedure…
Transformer, which originates from machine translation, is particularly powerful at modeling long-range dependencies. Currently, the transformer is making revolutionary progress in various vision tasks, leading to significant performance…
Working in a semi-constructive logical system that supports the extraction of concurrent programs, we extract a program inverting non-singular real valued matrices from a constructive proof based on Gaussian elimination. Concurrency is used…
"Cluster" extensions of the dynamical mean field method to include longer range correlations are discussed. It is argued that the clusters arising in these methods are naturally interpreted not as actual subunits of a physical lattice but…
Modern highly-concurrent search data structures, such as search trees, obtain multi-core scalability and performance by having operations traverse the data structure without any synchronization. As a result, however, these algorithms are…
This paper explores the interplay between category theory, topology, and the algebraic theory of finite groups. Our analysis unfolds in three stages. First, we establish the foundational universe of our objects: the complete and cocomplete…
Copy-move forgery detection is a crucial research area within digital image forensics, as it focuses on identifying instances where objects in an image are duplicated and placed in different locations. The detection of such forgeries is…
Bondal and Kapranov describe how to assign to a full exceptional collection on a variety X a DG category C such that the bounded derived category of coherent sheaves on X is equivalent to the bounded derived category of C. In this paper we…
It is widely believed that the fermion determinant cannot be treated in global acceptance-rejection steps of gauge link configurations that differ in a large fraction of the links. However, for exact factorizations of the determinant that…
We use automated theorem provers to significantly shorten a formal development in higher order set theory. The development includes many standard theorems such as the fundamental theorem of arithmetic and irrationality of square root of…