English
Related papers

Related papers: Testing cycle-freeness: Finding a certificate

200 papers

A barrier certificate can separate the state space of a con- sidered hybrid system (HS) into safe and unsafe parts ac- cording to the safety property to be verified. Therefore this notion has been widely used in the verification of HSs. A…

Systems and Control · Computer Science 2013-10-25 Liyun Dai , Ting Gan , Bican Xia , Naijun Zhan

This paper studies the problem of enforcing safety of a stochastic dynamical system over a finite time horizon. We use stochastic barrier functions as a means to quantify the probability that a system exits a given safe region of the state…

Systems and Control · Computer Science 2019-05-30 Cesar Santoyo , Maxence Dutreix , Samuel Coogan

Control Invariant (CI) sets are instrumental in certifying the safety of dynamical systems. Control Barrier Functions (CBFs) are effective tools to compute such sets, since the zero sublevel sets of CBFs are CI sets. However, computing CBFs…

Systems and Control · Electrical Eng. & Systems 2025-09-05 Sampath Kumar Mulagaleti , Andrea Del Prete

The field of property testing of probability distributions, or distribution testing, aims to provide fast and (most likely) correct answers to questions pertaining to specific aspects of very large datasets. In this work, we consider a…

Data Structures and Algorithms · Computer Science 2015-04-27 Clément L. Canonne

We consider decision-making problems that are formulated as non-convex optimization programs where uncertainty enters the constraints through an additive term, independent of the decision variables, and robustness is imposed using a finite…

Optimization and Control · Mathematics 2026-02-25 Alexander J Gallo , Massimiliano Zoggia , Alessandro Falsone , Maria Prandini , Simone Garatti

Bounded self-certification in Turing machines fails because self-simulation necessarily incurs a strictly positive temporal overhead. We translate this operational constraint into a domain-theoretic framework, defining an operator that…

Logic in Computer Science · Computer Science 2026-03-09 Miara Sung

Cycle-accurate software simulation of multicores with complex microarchitectures is often excruciatingly slow. People use simplified core models to gain simulation speed. However, a persistent question is to what extent the results derived…

Hardware Architecture · Computer Science 2016-10-10 Sizhuo Zhang , Andrew Wright , Daniel Sanchez , Arvind

In this paper, our goal is to characterize two graph classes based on the properties of minimal vertex (edge) separators. We first present a structural characterization of graphs in which every minimal vertex separator is a stable set. We…

Discrete Mathematics · Computer Science 2011-03-16 Mrinal Kumar , Gaurav Maheswari , N. Sadagopan

The group testing problem consists of determining a sparse subset of defective items from within a larger set of items via a series of tests, where each test outcome indicates whether at least one defective item is included in the test. We…

Information Theory · Computer Science 2026-04-24 Daniel McMorrow , Jonathan Scarlett

With the increasing popularity of continuous integration, algorithms for selecting the minimal test-suite to cover a given set of changes are in order. This paper reports on how polymorphism can handle false negatives in a previous…

Software Engineering · Computer Science 2014-12-15 Ali Parsai , Quinten David Soetens , Alessandro Murgia , Serge Demeyer

Time-reversibility is a crucial feature of many time series models, while time-irreversibility is the rule rather than the exception in real-life data. Testing the null hypothesis of time-reversibilty, therefore, should be an important step…

Methodology · Statistics 2024-11-19 Yuichi Goto , Marc Hallin

An important tool for proving safety of dynamical systems is the notion of a barrier certificate. In this paper we prove that every robustly safe ordinary differential equation has a barrier certificate. Moreover, we show a construction of…

Systems and Control · Computer Science 2018-08-02 Stefan Ratschan

We consider the problem of testing whether a Boolean function has Fourier degree $\leq k$ or it is $\epsilon$-far from any Boolean function with Fourier degree $\leq k$. We improve the known lower bound of $\Omega(k)$ \cite{BBM11,CGM10}, to…

Computational Complexity · Computer Science 2013-08-27 Pooya Hatami

Given two testable properties $\mathcal{P}_{1}$ and $\mathcal{P}_{2}$, under what conditions are the union, intersection or set-difference of these two properties also testable? We initiate a systematic study of these basic set-theoretic…

Data Structures and Algorithms · Computer Science 2010-10-26 Victor Chen , Madhu Sudan , Ning Xie

All experiments attempting to verify the invariance of speed of light directly are based on two-way speed measurement. The challenge in one-way speed measurement, the requirement of spatially separated synchronised clocks, can be possibly…

Classical Physics · Physics 2013-03-20 Evan John Philip

Static data-flow analysis has proven its effectiveness in assessing security of applications. One major challenge it faces is scalability to large software. This issue is even exacerbated when additional limitations on computing and storage…

Software Engineering · Computer Science 2018-08-08 Mohamed Nassim Seghir

Test pattern generation is an electronic design automation tool that attempts to find an input (or test) sequence that, when applied to a digital circuit, enables one to distinguish between the correct circuit behavior and the faulty…

Quantum Physics · Physics 2010-09-21 Jacob Biamonte , Marek Perkowski

In this paper, we consider several property testing problems and ask how the query complexity depends on the distance parameter $\eps$. We achieve new lower bounds in this setting for the problems of testing whether a function is monotone…

Computational Complexity · Computer Science 2013-08-28 Joshua Brody , Pooya Hatami

Many existing tools in nonlinear control theory for establishing stability or safety of a dynamical system can be distilled to the construction of a certificate function that guarantees a desired property. However, algorithms for…

Machine Learning · Computer Science 2020-09-15 Nicholas M. Boffi , Stephen Tu , Nikolai Matni , Jean-Jacques E. Slotine , Vikas Sindhwani

We study testing $\pi$-freeness of functions $f:[n]^d\to\mathbb{R}$, where $f$ is $\pi$-free if there there are no $k$ indices $x_1\prec\cdots\prec x_k\in [n]^d$ such that $f(x_i)<f(x_j)$ and $\pi(i) < \pi(j)$ for all $i,j \in [k]$, where…

Data Structures and Algorithms · Computer Science 2025-10-28 Harish Chandramouleeswaran , Ilan Newman , Tomer Pelleg , Nithin Varma