We investigate the decidability of observational equivalence and approximation in Reynolds' "Syntactic Control of Interference" (SCI), a prototypical functionalimpe...
Computing frequent itemsets is one of the most prominent problems in data mining. We study the following related problem, called FREQSAT, in depth: given some itemset-interval pai...
Analysis of Distributed Abstract Machines Damien Pous ENS Lyon, France. We illustrate the use of recently developed proof techniques for weak bisimulation sing a generic framework...
Starting from the logical description of gene regulatory networks developed by R. Thomas, we introduce an enhanced modelling approach based on timed automata. We obtain a refined ...
The purpose of this paper is to decipher constructively a lemma of Suslin which played a central role in his second solution of Serre's problem on projective modules over pol...