𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Refinement verification of the lazy caching algorithm

✍ Scribed by Wim H. Hesselink

Publisher
Springer-Verlag
Year
2006
Tongue
English
Weight
323 KB
Volume
43
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Memory-efficient algorithms for the veri
Memory-efficient algorithms for the verification of temporal properties
✍ C. Courcoubetis; M. Vardi; P. Wolper; M. Yannakakis πŸ“‚ Article πŸ“… 1992 πŸ› Springer 🌐 English βš– 804 KB

This article addresses the problem of designing memory-efficient algorithms for the verification of temporal properties of finite-state programs. Both the programs and their desired temporal properties are modeled as automata on infinite words (Biichi automata). Verification is then reduced to check

GreedyDualβˆ— Web caching algorithm: explo
GreedyDualβˆ— Web caching algorithm: exploiting the two sources of temporal locality in Web request streams
✍ S Jin; A Bestavros πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 279 KB

The relative importance of long-term popularity and short-term temporal correlation of references for Web cache replacement policies has not been studied thoroughly. This is partially due to the lack of accurate characterization of temporal locality that enables the identification of the relative st