Are There Good Mistakes? A Theoretical Analysis of CEGIS

Counterexample-guided inductive synthesis CEGIS is used to synthesize programs from a candidate space of programs. The technique is guaranteed to terminate and synthesize the correct program if the space of candidate programs is finite. But the technique may or may not terminate with the correct program if the candidate space of programs is infinite. In this paper, we perform a theoretical analysis of counterexample-guided inductive synthesis technique. We investigate whether the set of candidate spaces for which the correct program can be synthesized using CEGIS depends on the counterexamples used in inductive synthesis, that is, whether there are good mistakes which would increase the synthesis power. We investigate whether the use of minimal counterexamples instead of arbitrary counterexamples expands the set of candidate spaces of programs for which inductive synthesis can successfully synthesize a correct program. We consider two kinds of counterexamples: minimal counterexamples and history bounded counterexamples. The history bounded counterexample used in any iteration of CEGIS is bounded by the examples used in previous iterations of inductive synthesis. We examine the relative change in power of inductive synthesis in both cases. We show that the synthesis technique using minimal counterexamples MinCEGIS has the same synthesis power as CEGIS but the synthesis technique using history bounded counterexamples HCEGIS has different power than that of CEGIS, but none dominates the other.Comment: In Proceedings SYNT 2014, arXiv:1407.493

Completely bounded bimodule maps and spectral synthesis

We initiate the study of the completely bounded multipliers of the Haagerup tensor product $A(G)\otimes_{\rm h} A(G)$ of two copies of the Fourier algebra $A(G)$ of a locally compact group $G$. If $E$ is a closed subset of $G$ we let $E^{\sharp} = \{(s,t) : st\in E\}$ and show that if $E^{\sharp}$ is a set of spectral synthesis for $A(G)\otimes_{\rm h} A(G)$ then $E$ is a set of local spectral synthesis for $A(G)$. Conversely, we prove that if $E$ is a set of spectral synthesis for $A(G)$ and $G$ is a Moore group then $E^{\sharp}$ is a set of spectral synthesis for $A(G)\otimes_{\rm h} A(G)$. Using the natural identification of the space of all completely bounded weak* continuous $VN(G)'$-bimodule maps with the dual of $A(G)\otimes_{\rm h} A(G)$, we show that, in the case $G$ is weakly amenable, such a map leaves the multiplication algebra of $L^{\infty}(G)$ invariant if and only if its support is contained in the antidiagonal of $G$.Comment: 44 page

Dissipative Stabilization of Linear Systems with Time-Varying General Distributed Delays (Complete Version)

New methods are developed for the stabilization of a linear system with general time-varying distributed delays existing at the system's states, inputs and outputs. In contrast to most existing literature where the function of time-varying delay is continuous and bounded, we assume it to be bounded and measurable. Furthermore, the distributed delay kernels can be any square-integrable function over a bounded interval, where the kernels are handled directly by using a decomposition scenario without using approximations. By constructing a Krasovski\u{i} functional via the application of a novel integral inequality, sufficient conditions for the existence of a dissipative state feedback controller are derived in terms of matrix inequalities without utilizing the existing reciprocally convex combination lemmas. The proposed synthesis (stability) conditions, which take dissipativity into account, can be either solved directly by a standard numerical solver of semidefinite programming if they are convex, or reshaped into linear matrix inequalities, or solved via a proposed iterative algorithm. To the best of our knowledge, no existing methods can handle the synthesis problem investigated in this paper. Finally, numerical examples are presented to demonstrate the effectiveness of the proposed methodologies.Comment: Accepted by Automatic

Parameterized Synthesis

We study the synthesis problem for distributed architectures with a parametric number of finite-state components. Parameterized specifications arise naturally in a synthesis setting, but thus far it was unclear how to detect realizability and how to perform synthesis in a parameterized setting. Using a classical result from verification, we show that for a class of specifications in indexed LTL\X, parameterized synthesis in token ring networks is equivalent to distributed synthesis in a network consisting of a few copies of a single process. Adapting a well-known result from distributed synthesis, we show that the latter problem is undecidable. We describe a semi-decision procedure for the parameterized synthesis problem in token rings, based on bounded synthesis. We extend the approach to parameterized synthesis in token-passing networks with arbitrary topologies, and show applicability on a simple case study. Finally, we sketch a general framework for parameterized synthesis based on cutoffs and other parameterized verification techniques.Comment: Extended version of TACAS 2012 paper, 29 page