Sciweavers

3446 search results - page 347 / 690
» A Reasoning Algorithm for pD*
Sort
View
STOC
1999
ACM
176views Algorithms» more  STOC 1999»
15 years 11 months ago
On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice
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...
Johannes Blömer, Jean-Pierre Seifert
ICCL
1998
IEEE
15 years 11 months ago
Location-Independent Communication for Mobile Agents: A Two-Level Architecture
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. ...
POPL
1998
ACM
15 years 11 months ago
Higher-Order unCurrying
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...
John Hannan, Patrick Hicks
SIGMETRICS
1992
ACM
145views Hardware» more  SIGMETRICS 1992»
15 years 10 months ago
Analysis of the Generalized Clock Buffer Replacement Scheme for Database Transaction Processing
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 ...
Victor F. Nicola, Asit Dan, Daniel M. Dias
CCS
2007
ACM
15 years 10 months ago
Formal correctness of conflict detection for firewalls
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, ...