Related papers: A General Verification for Functional Completeness…
When can $n$ given numbers be combined using arithmetic operators from a given subset of $\{+, -, \times, \div\}$ to obtain a given target number? We study three variations of this problem of Arithmetic Expression Construction: when the…
In this article, we characterize absolutely norm attaining normal operators in terms of the essential spectrum. Later we prove a structure theorem for hyponormal absolutely norm attaining (or $\mathcal{AN}$-operators in short) and deduce…
Sharing, downloading, and reusing software is common-place, some of which is carried out legally with open source software. When it is not legal, it is unclear just how many copyright infringements and trade secret violations have taken…
An alternative proof of the completeness of relational algebra with respect to allowed formulas of first-order logic is presented. The proof relies on the well-known embedding of relational algebra into cylindric algebra, which makes it…
A class of languages C is perfect if it is closed under Boolean operations and the emptiness problem is decidable. Perfect language classes are the basis for the automata-theoretic approach to model checking: a system is correct if the…
Every function on a finite set defines an equivalence relation and, therefore, a partition called the kernel of the function. Automata such that every possible partition is the kernel of a word are called totally compatible. A…
Formal verification techniques have been playing an important role in pre-silicon validation processes. One of the most important points considered in performing formal verification is to define good verification scopes; we should define…
Every finite non-nilpotent group can be extended by a term operation such that solving equations in the resulting algebra is NP-complete and checking identities is co-NP-complete. This result was firstly proven by Horv\'ath and Szab\'o; the…
For $\delta$ an $m$-tuple of analytic functions, we define an algebra $\hidg$, contained in the bounded analytic functions on the analytic polyhedron $ {|\delta^l(z)| < 1, \ 1 \leq l \leq m}$, and prove a representation formula for it. We…
The concept of complementability is extended from bounded operators to densely defined operators on Hilbert spaces. By introducing appropriate projections and decomposition techniques, a framework is developed for analyzing…
In this paper, we prove that the null space of a weighted composition operator on $\ell_p~ (1 \leq p < \infty)$ is a complemented subspace. We also give a necessary and sufficient condition for a weighted composition operator on $\ell_p$…
We establish necessary and sufficient conditions for boundedness of composition operators on the most general class of Hilbert spaces of entire Dirichlet series with real frequencies. Depending on whether or not the space contains any…
A coverage function f over a ground set [m] is associated with a universe U of weighted elements and m subsets A_1,..., A_m of U, and for any subset T of [m], f(T) is defined as the total weight of the elements in the union $\cup_{j\in T}…
A deductive system is structurally complete if its admissible inference rules are derivable. For several important systems, like modal logic S5, failure of structural completeness is caused only by the underivability of passive rules, i.e.…
We study the problem of completely automatically verifying uninterpreted programs---programs that work over arbitrary data models that provide an interpretation for the constants, functions and relations the program uses. The verification…
The usual Laurent expansion of the analytic tensors on the complex plane is generalized to any closed and orientable Riemann surface represented as an affine algebraic curve. As an application, the operator formalism for the $b-c$ systems…
This paper is concerned with path-complete barrier functions which offer a graph-based methodology for verifying safety properties in switched systems. The path-complete framework leverages algebraic (barrier functions) as well as…
Completion is a well-known transformation that captures the stable model semantics of logic programs by turning a program into a set of first-order definitions. Stable models are models of the completion, but not all models of the…
The goal of the present paper is to provide a mathematically rigorous foundation to certain aspects of rational orbifold conformal field theory, in other words the theory of rational vertex operator algebras and their automorphisms. Under a…
In this paper we investigate formal verification problems for Neural Network computations. Various reachability problems will be in the focus, such as: Given symbolic specifications of allowed inputs and outputs in form of Linear…