Abstract—Recent results have shown that the feasibility problem of scheduling periodic tasks with self-suspensions is NPhard in the strong sense. We observe that a variation of t...
We describe a combination of runtime information and static analysis for checking properties of complex and configurable systems. The basic idea of our approach is to 1) let the p...
We study self-organized cooperation in a heterogeneous robotic swarm consisting of two sub-swarms. The robots of each sub-swarm play distinct roles based on their different charac...
Frederick Ducatelle, Gianni A. Di Caro, Luca Maria...
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...
This paper presents a detailed empirical study of local search for Boolean satisfiability (SAT), highlighting several interesting properties, some of which were previously unknown...