Checking the correctness of memories

DOI10.1007/BF01185212MaRDI QIDQ890427zbMATH OpenOpenAlexFDO

Authors N. E. Zubov

Publication date 10 November 2015

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01185212

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data structures (68P05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Testing Shared Memories
• Sorting and searching in faulty memories
• A test against spurious long memory
• Correction of errors associated with memory faults
• Correct Hardware Design and Verification Methods
• scientific article; zbMATH DE number 1344505
• TESTING FOR LONG MEMORY

Cites work

• scientific article; zbMATH DE number 4191094 (Why is no real title available?)
• scientific article; zbMATH DE number 4195192 (Why is no real title available?)
• scientific article; zbMATH DE number 4205986 (Why is no real title available?)
• scientific article; zbMATH DE number 3960854 (Why is no real title available?)
• Checking the correctness of memories
• Designing programs that check their work
• Finite state verifiers I
• On the power of multi-prover interactive protocols
• Relations Among Complexity Measures
• Self-testing/correcting with applications to numerical problems
• Small-Bias Probability Spaces: Efficient Constructions and Applications
• Space-bounded probabilistic game automata

Cited in

(32)

• Checking Value-Sensitive Data Structures in Sublinear Space
• Authenticated hash tables based on cryptographic accumulators
• Pipelined algorithms to detect cheating in long-term grid computations
• Quantum online memory checking
• Fiat-Shamir security of FRI and related SNARKs
• Super-Efficient Verification of Dynamic Outsourced Databases
• Continuous inspection with memory
• Delegating RAM Computations
• \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
• Checking the correctness of memories
• Fast interactive coding against adversarial noise
• Onion ORAM: a constant bandwidth blowup oblivious RAM
• Memory checking for parallel RAMs
• Streaming complexity of checking priority queues
• The complexity of online memory checking
• Checker for data structures which sort elements
• Integrity and consistency for untrusted services (extended abstract)
• Performance improvement for the GGM-construction of pseudorandom functions
• Proofs for inner pairing products and applications
• Designing reliable algorithms in unreliable memories
• \textsf{MacORAMa}: optimal oblivious RAM with integrity
• Gemini: elastic SNARKs for diverse environments
• Spartan: efficient and general-purpose zkSNARKs without trusted setup
• Synthesizers and their application to the parallel construction of pseudo-random functions
• On the complexity of collision resistant hash functions: new and old black-box separations
• Certifying algorithms
• Hardness-preserving reductions via cuckoo hashing
• Scalable zero knowledge via cycles of elliptic curves
• Batch checking with applications to linear functions
• Resilient dynamic programming
• Checking and Spot-Checking the Correctness of Priority Queues
• Dynamic proofs of retrievability via oblivious RAM

This page was built for publication: Checking the correctness of memories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q890427)