Tree-Traversal Algorithm Alexey Loginov, Thomas Reps, and Mooly Sagiv Comp. ...  Home/Search
Context
Related
| wisc.edu/wpis/papers/sas06dsw.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: wisc.edu/wpis/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper reports on the automated verification of the total correctness (partial correctness and termination) of the Deutsch-Schorr-Waite (DSW) algorithm. DSW is an algorithm for traversing a binary tree without the use of a stack by means of destructive pointer manipulation. Prior approaches to the verification of the algorithm involved applications of theorem provers or handwritten proofs. TVLA's abstract-interpretation approach made possible the automatic symbolic exploration of all ... (Update)
Active bibliography (related documents): More All
0.4: An Overview of the Jahob Analysis System - Project Goals and.. - Kuncak, Rinard (Correct)
0.4: Proving pointer programs in Hoare Logic - Bornat (2000) (Correct)
0.4: On Spatial Conjunction as Second-Order Logic - Kuncak, Rinard (2004) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ alexey-automated,
author = "Tree-Traversal Algorithm Alexey",
title = "Automated Verification of the Deutsch-Schorr-Waite",
url = "citeseer.ist.psu.edu/763483.html" }
Citations (may not include all citations):150 Parametric shape analysis via 3-valued logic - Sagiv, Reps et al. - 2002
146 Parallelizing Programs with Recursive Data Structures (context) - Hendren - 1990
124 The Art of Computer Programming -- Vol (context) - Knuth - 1973
111 Separation Logic: A logic for shared mutable data structures - Reynolds - 2002
110 Bi as an assertion language for mutable data structures - Ishtiaq, O'Hearn - 2001
32 Proving pointer programs in Hoare logic - Bornat - 2000
31 An efficient machine independent procedure for garbage colle.. (context) - Schorr, Waite - 1967
18 Proving pointer programs in higher-order logic - Mehta, Nipkow - 2003
17 Putting static analysis to work for verification: A case stu.. (context) - Lev-Ami, Reps et al. - 2000
17 Local Reasoning for Stateful Programs (context) - Yang - 2001
9 Scanning list structures without stacks or tag bits (context) - Lindstrom - 1973
8 The correctness of the Schorr-Waite list marking algorithm (context) - Topor - 1974
7 Animating formal proofs at the surface: The Jape proof calcu.. (context) - Bornat, Sufrin - 1999
6 Automatic Verification of Programs with Complex Data Structu.. (context) - Suzuki - 1976
4 Automatic verification of pointer programs using grammar-bas.. (context) - Lee, Yang et al. - 2005
4 Abstraction refinement via inductive learning - Loginov, Reps et al. - 2005
3 Partially disjunctive heap abstraction - Manevich, Sagiv et al. - 2004
3 Finite differencing of logical formulas with applications to.. (context) - Reps, Sagiv et al. - 2003
1 To appear in ACM Transactions on Computational Logic (context) - Yorsh, Reps et al.
1 and proofs of marking algorithms (context) - Yelowitz, Duncan et al. - 1977
1 Fast and precise abstraction for shape analysis (context) - Lev-Ami, Immerman et al. - 2006
1 Verification-oriented language design (context) - Morris - 1972
http://www.dcs.qmul.ac.uk/
Documents on the same site (http://www.cs.wisc.edu/wpis/papers/): More
Program Generalization for Software Reuse: From C to C++ - Siff, Reps (1996) (Correct)
Modular Pointer Analysis - Susan Horwitz And (Correct)
Weighted Pushdown Systems and Weighted Transducers - Lal, Touili, Kidd, Reps (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC