Related papers: Checking Deadlock-Freedom of Parametric Component-…
Logical atomicity has been widely accepted as a specification format for data structures in concurrent separation logic. While both lock-free and lock-based data structures have been verified against logically atomic specifications, most of…
Recently the algebraic structure of gauge-invariant operators in multi-matrix quantum mechanics has been clarified: this space forms a module over a freely generated ring. The ring is generated by a set of primary invariants, while the…
Scalable formal verification constitutes an important challenge for the design of asynchronous circuits. Deadlock freedom is a property that is desired but hard to verify. It is an emergent property that has to be verified monolithically.…
This paper studies runtime monitoring for persistent surveillance by autonomous robots when the autonomy stack is a black box. The environment is partitioned into finitely many parts, each carrying an uncertainty state that decreases when…
Parametricity is a key metatheoretic property of type systems, which implies strong uniformity & modularity properties of the structure of types within systems possessing it. In recent years, various systems of dependent type theory have…
We establish an assume-guarantee (AG) framework for compositional reasoning about multi-objective queries in parametric probabilistic automata (pPA) - an extension to probabilistic automata (PA), where transition probabilities are functions…
Regular model checking is a technique for the verification of infinite-state systems whose configurations can be represented as finite words over a suitable alphabet. The form we are studying applies to systems whose set of initial…
As autonomy becomes prevalent in many applications, ranging from recommendation systems to fully autonomous vehicles, there is an increased need to provide safety guarantees for such systems. The problem is difficult, as these are large,…
We address the problem of Bayesian structure learning for domains with hundreds of variables by employing non-parametric bootstrap, recursively. We propose a method that covers both model averaging and model selection in the same framework.…
In previous work, summarized in this paper, we proposed an operation of parallel composition for rewriting-logic theories, allowing compositional specification of systems and reusability of components. The present paper focuses on…
This work presents new tools for studying reachability and set invariance for continuous-time mixed-monotone dynamical systems subject to a disturbance input. The vector field of a mixed-monotone system is decomposable via a decomposition…
The invariant-comb approach is a method to construct entanglement measures for multipartite systems of qubits. The essential step is the construction of an antilinear operator that we call {\em comb} in reference to the {\em hairy-ball…
We consider the problem of static deadlock detection for programs in the Go programming language which make use of synchronous channel communications. In our analysis, regular expressions extended with a fork operator capture the…
This paper introduces a novel paradigm for the analysis and verification of concurrent programs -- the Singularity Theory. We model the execution space of a concurrent program as a branched topological space, where program states are points…
In a process algebra with hiding and recursion it is possible to create processes which compute internally without ever communicating with their environment. Such processes are said to diverge or livelock. In this paper we show how it is…
We consider the reduction of parametric families of linear dynamical systems having an affine parameter dependence that differ from one another by a low-rank variation in the state matrix. Usual approaches for parametric model reduction…
We investigate indeterminate points in discrete integrable system. They appear in singularity confinement phenomenon naturally. We develop a method to analyse indeterminate points of dynamical maps and using this method we clarify behaviour…
The verification of systems combining hard timing constraints with concurrency is challenging. This challenge becomes even harder when some timing constants are missing or unknown. Parametric timed formalisms, such as parametric timed…
In this paper, we present a geometric approach for computing controlled invariant sets for hybrid control systems. While the problem is well studied in the ellipsoidal case, this family is quite conservative for constrained or switched…
Multivariable parametric models are critical for designing, controlling, and optimizing the performance of engineered systems. The main aim of this paper is to develop a parametric identification strategy that delivers accurate and…