Related papers: Infinitary Refinement Types for Temporal Propertie…
We provide a characterization of the family of non-negative local martingales that have continuous running supremum and vanish at infinity. This is done by describing the class of random times that identify the times of maximum of such…
In this paper we introduce new notions of local extremality for finite and infinite systems of closed sets and establish the corresponding extremal principles for them called here rated extremal principles. These developments are in the…
The interleaving semantics is not compatible with both action refinement and durational actions. Since many true concurrency semantics are congruent w.r.t. action refinement, notably the causality and the maximality ones, this has…
This paper introduces a spatio-temporal resonator model and an inference method for detection and estimation of nearly periodic temporal phenomena in spatio-temporal data. The model is derived as a spatial extension of a stochastic harmonic…
A coverage type generalizes refinement types found in many functional languages with support for must-style underapproximate reasoning. Property-based testing frameworks are one particularly useful domain where such capabilities are useful…
This work is devoted to the formal verification of specifications over general discrete-time Markov processes, with an emphasis on infinite-horizon properties. These properties, formulated in a modal logic known as PCTL, can be expressed…
Recent work by Prodan and the second author showed that weak invariants of topological insulators can be described using Kasparov's $KK$-theory. In this note, a complementary description using semifinite index theory is given. This provides…
The purpose is to formulate a Fourier transformation for the space of functionals, as an infinitesimal meaning. We extend ${\bf R}$ to $ ^{\star}(^{\ast}{\bf R})$ under the base of nonstandard methods for the construction. The domain of a…
We show that there exists an entire function without finite asymptotic values for which the associated Newton function tends to infinity in some invariant domain. The question whether such a function exists had been raised by Douady.
We provide new infinitesimal characterizations for strong invariance of multifunctions in terms of Hamiltonian inequalities and tangent cones. In lieu of the standard local Lipschitzness assumption on the multifunction, we assume a new…
We study Density Functional Theory models for systems which are translationally invariant in some directions, such as a homogeneous 2-d slab in the 3-d space. We show how the different terms of the energy are modified and we derive reduced…
Formal verification using the model checking paradigm has to deal with two aspects: The system models are structured, often as products of components, and the specification logic has to be expressive enough to allow the formalization of…
Andrew Pitts' framework of relational properties of domains is a powerful method for defining predicates or relations on domains, with applications ranging from reasoning principles for program equivalence to proofs of adequacy connecting…
In this article we study definable functions in tame expansions of algebraically closed valued fields. For a given definable function we have two types of results: of type (I), which hold at a neighborhood of infinity, and of type (II),…
Invariance times are stopping times $\tau$ such that local martingales with respect to some reduced filtration and an equivalently changed probability measure, stopped before $\tau$ , are local martingales with respect to the original model…
Traditional saliency map methods, popularized in computer vision, highlight individual points (pixels) of the input that contribute the most to the model's output. However, in time series, they offer limited insights, as semantically…
Two groups of naturally arising questions in the mathematical theory of domains for denotational semantics are addressed. Domains are equipped with Scott topology and represent data types. Scott continuous functions represent computable…
Denotational models of type theory, such as set-theoretic, domain-theoretic, or category-theoretic models use (actual) infinite sets of objects in one way or another. The potential infinite, seen as an extensible finite, requires a dynamic…
The scope of this work is the constraint-based synthesis of termination arguments for the restricted class of programs called linear lasso programs. A termination argument consists of a ranking function as well as a set of supporting…
Finite-state tree automata are a well studied formalism for representing term languages. This paper studies the problem of determining the regularity of the set of instances of a finite set of terms with variables, where each variable is…