Practical memory checkers for stacks, queues and deques

DOI10.1007/BFB0027919MaRDI QIDQ4501491zbMATH OpenFDO

Authors Marc Fischlin

Publication date 4 September 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://nbn-resolving.org/urn:nbn:de:hebis:30-12643

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Checking and Spot-Checking the Correctness of Priority Queues
• Checking the correctness of memories
• scientific article; zbMATH DE number 1305509
• Checker for data structures which sort elements
• How Efficient Can Memory Checking Be?

Cited in

(6)

• Checker for data structures which sort elements
• Streaming complexity of checking priority queues
• How Efficient Can Memory Checking Be?
• scientific article; zbMATH DE number 1305509 (Why is no real title available?)
• Checking Value-Sensitive Data Structures in Sublinear Space
• Checking and Spot-Checking the Correctness of Priority Queues

This page was built for publication: Practical memory checkers for stacks, queues and deques

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