Optimal boundary control with critical penalization for a PDE model of fluid-solid interactions

We study the finite-horizon optimal control problem with quadratic functionals for an established fluid-structure interaction model. The coupled PDE system under investigation comprises a parabolic (the fluid) and a hyperbolic (the solid) dynamics; the coupling occurs at the interface between the regions occupied by the fluid and the solid. We establish several trace regularity results for the fluid component of the system, which are then applied to show well-posedness of the Differential Riccati Equations arising in the optimization problem. This yields the feedback synthesis of the unique optimal control, under a very weak constraint on the observation operator; in particular, the present analysis allows general functionals, such as the integral of the natural energy of the physical system. Furthermore, this work confirms that the theory developed in Acquistapace et al. [Adv. Differential Equations, 2005] -- crucially utilized here -- encompasses widely differing PDE problems, from thermoelastic systems to models of acoustic-structure and, now, fluid-structure interactions.Comment: 22 pages, submitted; v2: misprints corrected, a remark added in section

The complex geomety of a domain related to μ\mu-synthesis

We describe the basic complex geometry and function theory of the {\em pentablock} $\mathcal{P}$, which is the bounded domain in $\mathbb{C}^3$ given by $$\mathcal{P}= \{(a_{21}, \mathrm{tr} A, \det A): A= \begin{bmatrix} a_{ij}\end{bmatrix}_{i,j=1}^2 \in \mathbb{B}\}$$ where $\mathbb{B}$ denotes the open unit ball in the space of $2\times 2$ complex matrices. We prove several characterizations of the domain. We describe its distinguished boundary and exhibit a $4$-parameter group of automorphisms of $\mathcal{P}$. We show that $\mathcal{P}$ is intimately connected with the problem of $\mu$-synthesis for a certain cost function $\mu$ on the space of $2\times 2$ matrices defined in connection with robust stabilization by control engineers. We demonstrate connections between the function theories of $\mathcal{P}$ and $\mathbb{B}$. We show that $\mathcal{P}$ is polynomially convex and starlike.Comment: 36 pages, 2 figures. This version contains corrections of some inaccuracies and an expanded argument for Proposition 12.

A Survey of Symbolic Execution Techniques

Many security and software testing applications require checking whether certain properties of a program hold for any possible usage scenario. For instance, a tool for identifying software vulnerabilities may need to rule out the existence of any backdoor to bypass a program's authentication. One approach would be to test the program using different, possibly random inputs. As the backdoor may only be hit for very specific program workloads, automated exploration of the space of possible inputs is of the essence. Symbolic execution provides an elegant solution to the problem, by systematically exploring many possible execution paths at the same time without necessarily requiring concrete inputs. Rather than taking on fully specified input values, the technique abstractly represents them as symbols, resorting to constraint solvers to construct actual instances that would cause property violations. Symbolic execution has been incubated in dozens of tools developed over the last four decades, leading to major practical breakthroughs in a number of prominent software reliability applications. The goal of this survey is to provide an overview of the main ideas, challenges, and solutions developed in the area, distilling them for a broad audience. The present survey has been accepted for publication at ACM Computing Surveys. If you are considering citing this survey, we would appreciate if you could use the following BibTeX entry: http://goo.gl/Hf5FvcComment: This is the authors pre-print copy. If you are considering citing this survey, we would appreciate if you could use the following BibTeX entry: http://goo.gl/Hf5Fv

Diffusive representations for fractional Laplacian: systems theory framework and numerical issues

Bridging the gap between an abstract definition of pseudo-differential operators, such as (-\Delta)^{\gamma} for - 1/2 < \gamma < 1/2, and a concrete way to represent them has proved difficult; deriving stable numerical schemes for such operators is not an easy task either. Thus, the framework of diffusive representations, as already developed for causal fractional integrals and derivatives, is being applied to fractional Laplacian: it can be seen as an extension of the Wiener-­Hopf factorization and splitting techniques to irrational transfer functions

Unbounded safety verification for hardware using software analyzers

Demand for scalable hardware verification is ever-increasing. We propose an unbounded safety verification framework for hardware, at the heart of which is a software verifier. To this end, we synthesize Verilog at register transfer level into a software-netlist, represented as a word-level ANSI-C program. The proposed tool flow allows us to leverage the precision and scalability of state-of-the-art software verification techniques. In particular, we evaluate unbounded proof techniques, such as predicate abstraction, k-induction, interpolation, and IC3/PDR; and we compare the performance of verification tools from the hardware and software domains that use these techniques. To the best of our knowledge, this is the first attempt to perform unbounded verification of hardware using software analyzers

Using Program Synthesis for Program Analysis

In this paper, we identify a fragment of second-order logic with restricted quantification that is expressive enough to capture numerous static analysis problems (e.g. safety proving, bug finding, termination and non-termination proving, superoptimisation). We call this fragment the {\it synthesis fragment}. Satisfiability of a formula in the synthesis fragment is decidable over finite domains; specifically the decision problem is NEXPTIME-complete. If a formula in this fragment is satisfiable, a solution consists of a satisfying assignment from the second order variables to \emph{functions over finite domains}. To concretely find these solutions, we synthesise \emph{programs} that compute the functions. Our program synthesis algorithm is complete for finite state programs, i.e. every \emph{function} over finite domains is computed by some \emph{program} that we can synthesise. We can therefore use our synthesiser as a decision procedure for the synthesis fragment of second-order logic, which in turn allows us to use it as a powerful backend for many program analysis tasks. To show the tractability of our approach, we evaluate the program synthesiser on several static analysis problems.Comment: 19 pages, to appear in LPAR 2015. arXiv admin note: text overlap with arXiv:1409.492

Spatial Interpolants

We propose Splinter, a new technique for proving properties of heap-manipulating programs that marries (1) a new separation logic-based analysis for heap reasoning with (2) an interpolation-based technique for refining heap-shape invariants with data invariants. Splinter is property directed, precise, and produces counterexample traces when a property does not hold. Using the novel notion of spatial interpolants modulo theories, Splinter can infer complex invariants over general recursive predicates, e.g., of the form all elements in a linked list are even or a binary tree is sorted. Furthermore, we treat interpolation as a black box, which gives us the freedom to encode data manipulation in any suitable theory for a given program (e.g., bit vectors, arrays, or linear arithmetic), so that our technique immediately benefits from any future advances in SMT solving and interpolation.Comment: Short version published in ESOP 201