Checking the correctness of memories

DOI10.1007/BF01185212zbMATH Open1323.68200OpenAlexW1994135885MaRDI QIDQ890427FDOQ890427

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

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

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)

Cites Work

• Small-Bias Probability Spaces: Efficient Constructions and Applications
• Relations Among Complexity Measures
• Checking the correctness of memories
• Self-testing/correcting with applications to numerical problems
• Designing programs that check their work
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the power of multi-prover interactive protocols
• Finite state verifiers I
• Title not available (Why is that?)
• Space-bounded probabilistic game automata
• Title not available (Why is that?)

Cited In (32)

• Checking Value-Sensitive Data Structures in Sublinear Space
• Quantum online memory checking
• Authenticated hash tables based on cryptographic accumulators
• Pipelined algorithms to detect cheating in long-term grid computations
• Fiat-Shamir security of FRI and related SNARKs
• Super-Efficient Verification of Dynamic Outsourced Databases
• Delegating RAM Computations
• \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
• Continuous inspection with memory
• Fast interactive coding against adversarial noise
• Memory checking for parallel RAMs
• Checking the correctness of memories
• Onion ORAM: a constant bandwidth blowup oblivious RAM
• Streaming complexity of checking priority queues
• The complexity of online memory checking
• Integrity and consistency for untrusted services (extended abstract)
• Checker for data structures which sort elements
• 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
• Hardness-preserving reductions via cuckoo hashing
• Certifying algorithms
• Scalable zero knowledge via cycles of elliptic curves
• Batch checking with applications to linear functions
• Checking and Spot-Checking the Correctness of Priority Queues
• Resilient dynamic programming
• 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)