Abstract. This proof of concept study examines the possibility of specifying the construction of programs using a Particle Swarm algorithm, and represents a new form of automatic p...
Among the possible approaches for expressing real-time problems with the B method, two are dominant : the use of the usual B mechanisms to define temporal constraints on the one h...
Abstract. We explore expression automata with respect to determinism, minimization and primeness. We define determinism of expression automata using prefix-freeness. This approac...
Abstract. This paper addresses the security of symmetric cryptosystems in the blockwise adversarial model. At Crypto 2002, Joux, Martinet and Valette have proposed a new kind of at...
Abstract. We prove a new congruence result for the π-calculus: bisimilarity is a congruence in the sub-calculus that does not include restriction nor sum, and features top-level r...