✦ LIBER ✦

Formal Design of Cache Memory Protocols in IBM

✍ Scribed by Steven M. German

Book ID: 110428777
Publisher: Springer
Year: 2003
Tongue: English
Weight: 63 KB
Volume: 22
Category: Article
ISSN: 0925-9856
DOI: 10.1023/a:1022921522163

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Formal Methods in Communication Protocol

Formal Methods in Communication Protocol Design

✍ Bochmann, G.; Sunshine, C. 📂 Article 📅 1980 🏛 IEEE 🌐 English ⚖ 989 KB

Formal automatic verification of cache c

Formal automatic verification of cache coherence in multiprocessors with relaxed memory models

✍ Fong Pong; Dubois, M. 📂 Article 📅 2000 🏛 IEEE 🌐 English ⚖ 409 KB

Design of a 1-chip IBM-3270 protocol han

Design of a 1-chip IBM-3270 protocol handler

✍ L. Spaanenburg 📂 Article 📅 1989 🏛 Elsevier Science ⚖ 449 KB

Formal analysis and design of multi-part

Formal analysis and design of multi-party fair exchange protocols

✍ Sihan Qing; Gaicheng Li 📂 Article 📅 2006 🏛 Science in China Press (SCP) 🌐 English ⚖ 620 KB

Design of new XOR-based hash functions f

Design of new XOR-based hash functions for cache memories

✍ Sung-Jin Cho; Un-Sook Choi; Yoon-Hee Hwang; Han-Doo Kim 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 536 KB

A hash function H is a computationally efficient function that maps bitstrings of arbitrary length to bitstrings of fixed length, called hash values. Hash functions have a variety of general computational uses. They are used in processors to augment the bandwidth of an interleaved multibank memory o

Design and Formal Analysis of Highly Eff

Design and Formal Analysis of Highly Effective Authentication Protocol

✍ Mingxia Shi; Huaiqiang Li; Li Chen 📂 Article 📅 2012 🏛 Elsevier 🌐 English ⚖ 240 KB