In this paper we study the link between formal and cryptographic models for security protocols in the presence of a passive adversary. In contrast to other works, we do not conside...
The Alpha language, based on systems of affine recurrence equations over polyhedral domains, allows the expression of complex algorithms as hierarchical, parameterized structures ...
Abstract. We present a Coq formalization of constructive ω-cpos (extending earlier work by Paulin-Mohring) up to and including the inverselimit construction of solutions to mixed-...
Abstract— We prove that a controllable set of smooth trajectories is the solution set of a constant coefficient linear differential equation if and only if it is linear, time in...
Numerical schemes to compute approximate solutions of the evolutionary Stokes and Navier-Stokes equations are studied. The schemes are discontinuous in time and conforming in space...