Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
We study communication primitives for interaction between mobile agents. They can be classified into two groups. At a low level there are location dependent primitives that require...
Peter Sewell, Pawel T. Wojciechowski, Benjamin C. ...
We present a formal specification of unCurrying for a higher-order, functional language with ML-style let-polymorphism. This specification supports the general unCurrying of func...
The CLOCK algorithm is a popular buffer replacement algorithm becauseof its simplicity and its ability to approximate the performance of the Least Recently Used (LRU) replacement ...
We describe the formalization of a correctness proof for a conflict detection algorithm for firewalls in the Coq Proof Assistant. First, we give formal definitions in Coq of a fir...
Venanzio Capretta, Bernard Stepien, Amy P. Felty, ...