Many courses on the history of computing are designed for a general student audience, and as such, include fewer technical details than one might find in a typical CS course. Whi...
Geoffrey M. Draper, Robert R. Kessler, Richard F. ...
Bisimulation between processes has been proven a successful method for formalizing security properties. We argue that in certain cases, a scheduler that has full information on the...
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
—We introduce a novel set of social network analysis based algorithms for mining the Web, blogs, and online forums to identify trends and find the people launching these new tren...
Peter A. Gloor, Jonas Krauss, Stefan Nann, Kai Fis...
We present a hardware-based approach to improve the resilience of a computer system against the errors occurred in the main memory with the help of error detecting and correcting ...
Valentin Gherman, Samuel Evain, Mickael Cartron, N...