| Home |
| About |
| Submission |
| Updating Entries |
| Using Entries |
| Search |
| Statistics |
| Index |
| Download |
Verification of the Deutsch-Schorr-Waite Graph Marking Algorithm using Data Refinement
| Title: | Verification of the Deutsch-Schorr-Waite Graph Marking Algorithm using Data Refinement |
| Authors: | Viorel Preoteasa (viorel /dot/ preoteasa /at/ aalto /dot/ fi) and Ralph-Johan Back |
| Submission date: | 2010-05-28 |
| Abstract: | The verification of the Deutsch-Schorr-Waite graph marking algorithm is used as a benchmark in many formalizations of pointer programs. The main purpose of this mechanization is to show how data refinement of invariant based programs can be used in verifying practical algorithms. The verification starts with an abstract algorithm working on a graph given by a relation next on nodes. Gradually the abstract program is refined into Deutsch-Schorr-Waite graph marking algorithm where only one bit per graph node of additional memory is used for marking. |
| Change history: | [2012-01-05]: Updated for the new definition of data refinement and the new syntax for demonic and angelic update statements |
| BibTeX: |
@article{GraphMarkingIBP-AFP,
author = {Viorel Preoteasa and Ralph-Johan Back},
title = {Verification of the Deutsch-Schorr-Waite Graph Marking Algorithm using Data Refinement},
journal = {Archive of Formal Proofs},
month = may,
year = 2010,
note = {\url{http://isa-afp.org/entries/GraphMarkingIBP.shtml},
Formal proof development},
ISSN = {2150-914x},
}
|
| License: | BSD License |
| Depends on: | DataRefinementIBP |
| Status: [skipped] | This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations. |
|
Proof outline Proof document |
| Browse theories |
| Download this entry |
Older releases:
|