Related papers: Verified Purely Functional Catenable Real-Time Deq…
This paper introduces the theory and practice of formal verification of self-assembling systems. We interpret a well-studied abstraction of nanomolecular self assembly, the Abstract Tile Assembly Model (aTAM), into Computation Tree Logic…
We perform a numerical approximation of coherent sets in finite-dimensional smooth dynamical systems by computing singular vectors of the transfer operator for a stochastically perturbed flow. This operator is obtained by solution of a…
In this paper, we introduce a semantics of realisability for the classical propositional natural deduction and we prove a correctness theorem. This allows to characterize the operational behaviour of some typed terms.
Imprecise and incomplete specification of system \textit{configurations} threatens safety, security, functionality, and other critical system properties and uselessly enlarges the configuration spaces to be searched by configuration…
We prove that if a finitely presented group acts properly discontinuously, cocompactly and by isometries on a simply connected Riemannian manifold, then the Dehn function of the group and the corresponding filling function of the manifold…
The central purpose of this article is to establish new inverse and implicit function theorems for differentiable maps with isolated critical points. One of the key ingredients is a discovery of the fact that differentiable maps with…
In the present paper we obtain a new homological version of the implicit function theorem and some versions of the Darboux theorem. Such results are proved for continuous maps on topological manifolds. As a consequence, some versions of…
What provides the highest level of assurance for correctness of execution within a programming language? One answer, and our solution in particular, to this problem is to provide a formalization for, if it exists, the denotational semantics…
Functionals that explicitly depend on occupied, unoccupied, or fractionally-occupied orbitals are rigorously formalized using Clifford algebras, and a variational principle is established that facilitates orbital (and occupation)…
Functional programming languages are particularly well-suited for building automated reasoning systems, since (among other reasons) a logical term is well modeled by an inductive type, traversing a term can be implemented generically as a…
In this paper we review the actor-based language, Timed Rebeca, with a focus on its formal semantics and formal verification techniques. Timed Rebeca can be used to model systems consisting of encapsulated components which communicate by…
Nowadays, more and more applications require OSGi to have some form of real-time support, which is currently very limited. The resulting closed-system solutions lack of a standard management scheme which forbids standard, system-wide…
Runtime verification is an effective automated method for specification-based offline testing and analysis as well as online monitoring of complex systems. The specification language is often a variant of regular expressions or a popular…
Adaptivity in multi-function radar systems is rapidly increasing, especially when moving towards fully adaptive, cognitive radar systems. However, the large number of available system configurations makes the rigorous verification and…
Reconfigurable multi-agent systems consist of a set of autonomous agents, with integrated interaction capabilities that feature opportunistic interaction. Agents seemingly reconfigure their interactions interfaces by forming collectives,…
We address the challenges of scaling verification efforts to match the increasing complexity and size of systems. We propose a research agenda aimed at building a performant proof engine by studying the asymptotic performance of proof…
We present the linear first-order intermediate language IL for verified compilers. IL is a functional language with calls to a nondeterministic environment. We give IL terms a second, imperative semantic interpretation and obtain a register…
We describe techniques for synthesis and verification of recursive functional programs over unbounded domains. Our techniques build on top of an algorithm for satisfiability modulo recursive functions, a framework for deductive synthesis,…
Matching logic is a formalism for specifying, and reasoning about, mathematical structures, using patterns and pattern matching. Growing in popularity, it has been used to define many logical systems such as separation logic with recursive…
For a Tychonoff space $X$, we denote by $C_k(X)$ the space of all real-valued continuous functions on X with the compact-open topology. In this paper, we have gave characterization for $C_k(X)$ to satisfy $S_{fin}(S, S)$.