Name
Abstract | ||
|---|---|---|
The notion of program checking is extended to include programs that alter their environment, in particular, programs that store and retrieve data from memory. The model considered allows the checker a small amount of reliable memory. The checker is presented with a sequence of requests (online) to a data structure which must reside in a large but unreliable memory. The data structure is viewed as being controlled by an adversary. The checker is to perform each operation in the input sequence using its reliable memory and the unreliable data structure so that any error in the operation of the structure will be detected by the checker with high probability. Checkers for various data structures are presented. Lower bounds of log n on the amount of reliable memory needed by these checkers, where n is the size of the structure, are proved. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1007/BF01185212 | Algorithmica |
Keywords | Field | DocType |
Program checking,Hashing,Stack,Queue,RAM,Data structure | Data structure,Programming language,Computer science,Correctness,Queue,Theoretical computer science,Hash function,Adversary,Random access | Journal |
Volume | Issue | ISSN |
12 | 2/3 | 0178-4617 |
ISBN | Citations | PageRank |
0-8186-2445-0 | 171 | 28.56 |
References | Authors | |
12 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| manuel blum | 1 | 4795 | 1351.57 |
| William S. Evans | 2 | 543 | 60.69 |
| Peter Gemmell | 3 | 675 | 108.87 |
| Sampath Kannan | 4 | 2506 | 275.83 |
| Moni Naor | 5 | 12948 | 1311.21 |