Automated Verification of the Deutsch-Schorr-Waite Tree-Traversal Algorithm

DOI10.1007/11823230_17MaRDI QIDQ3613390zbMATH OpenOpenAlexFDO

Authors Alexey Loginov, Mooly Sagiv, Thomas Reps

Publication date 12 March 2009

Published in Static Analysis (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Theory of software (68N99) Data structures (68P05) Analysis of algorithms (68W40)

Recommendations

• Verification of the Schorr-Waite algorithm -- from trees to graphs
• Dafny: an automatic program verifier for functional correctness
• Tools and Algorithms for the Construction and Analysis of Systems
• Morris' tree traversal algorithm reconsidered
• Automata-based verification of programs with tree updates

Cited in

(6)

• Verification of the Schorr-Waite algorithm -- from trees to graphs
• Matching logic: an alternative to Hoare/Floyd logic
• Automata-Based Termination Proofs
• The rewriting logic semantics project: a progress report
• Programs with lists are counter automata
• Juggrnaut: using graph grammars for abstracting unbounded heap structures

This page was built for publication: Automated Verification of the Deutsch-Schorr-Waite Tree-Traversal Algorithm

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