In this paper, the null controllability in any positive time T of the first-order equation (1) ẋ(t) = eAx(t)+Bu(t) (|θ| < π/2 fixed) is deduced from the null controllability in some positive time L of the second-order equation (2) z̈(t) = Az(t) +Bv(t). The differential equations (1) and (2) are set in a Banach space, B is an admissible unbounded control operator, and A is a generator of cosine o...

Control-Flow Integrity (CFI) is a defense which prevents control-flow hijacking attacks. While recent research has shown that coarse-grained CFI does not stop attacks, fine-grained CFI is believed to be secure. We argue that assessing the effectiveness of practical CFI implementations is non-trivial and that common evaluation metrics fail to do so. We then evaluate fullyprecise static CFI — the...

In his dissertation [3], Olin Shivers introduces a concept of control flow graphs for functional languages, provides an algorithm to statically derive a safe approximation of the control flow graph and proves this algorithm correct. In this research project [1], Shivers’ algorithms and proofs are formalized using the HOLCF extension of the logic HOL in the theorem prover Isabelle.

This paper proposes a new approach to control a flow. Controlling a flow consists either to change its state to another state or to maintain its current state whatever external disturbances. Here the control of the laminar plane Poiseuille flow is considered. To estimate the state of this flow, existing control methods rely on a set of limited wall shear stress measurements. These existing meth...

We establish a series of equivalences between type systems and control-flow analyses. Specifically, we take four type systems from the literature (involving simple types, subtypes and recursion) and conservatively enrich them to reason about control-flow information. Similarly, we take four standard control-flow systems and conservatively enrich them to reason about type consistency. Our main r...