Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...
The heterogeneity of architectural constraint languages makes difficult the transformation of architectural constraints throughout the development process. Indeed they have signi...
We consider the problem of recognizing human actions from still images. We propose a novel approach that treats the pose of the person in the image as latent variables that will h...
Saturating counters are a newly defined class of generalized parallel counters that provide the exact number of inputs which are equal to 1 only if this number is below a given t...
We propose a novel method to measure the dependability of journaling file systems. In our approach, we build models of how journaling file systems must behave under different jo...
Vijayan Prabhakaran, Andrea C. Arpaci-Dusseau, Rem...