Sciweavers

143 search results - page 19 / 29
» A Reconfigurable Content Addressable Memory
Sort
View
PPOPP
2005
ACM
15 years 3 months ago
Revocable locks for non-blocking programming
In this paper we present a new form of revocable lock that streamlines the construction of higher level concurrency abstractions such as atomic multi-word heap updates. The key id...
Tim Harris, Keir Fraser
FMCO
2005
Springer
153views Formal Methods» more  FMCO 2005»
15 years 3 months ago
Smallfoot: Modular Automatic Assertion Checking with Separation Logic
Abstract. Separation logic is a program logic for reasoning about programs that manipulate pointer data structures. We describe Smallfoot, a tool for checking certain lightweight s...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn
68
Voted
ISMVL
2010
IEEE
164views Hardware» more  ISMVL 2010»
15 years 2 months ago
On the Number of Products to Represent Interval Functions by SOPs with Four-Valued Variables
Abstract—Let A and B be integers such that A ≤ B. An nvariable interval function is a mapping IN[n : A, B] : {0, 1}n → {0, 1}, where IN[n : A, B](X) = 1 iff A ≤ X ≤ B. Su...
Tsutomu Sasao
IPPS
1999
IEEE
15 years 1 months ago
The Biological Basis of the Immune System as a Model for Intelligent Agents
This paper describes the human immune system and its functionalities from a computational viewpoint. The objective of this paper is to provide the biological basis for an artificia...
Roger L. King, Aric B. Lambert, Samuel H. Russ, Do...
MJ
2006
138views more  MJ 2006»
14 years 9 months ago
A CAM-based keyword match processor architecture
This paper demonstrates a keyword match processor capable of performing fast dictionary search with approximate match capability. Using a content addressable memory with processor...
Long Bu, John A. Chandy