| Home |
| About |
| Submission |
| Updating Entries |
| Using Entries |
| Search |
| Statistics |
| Index |
| Download |
BDD Normalisation
| Title: | BDD Normalisation |
| Authors: | Veronika Ortner and Norbert Schirmer (norbert /dot/ schirmer /at/ web /dot/ de) |
| Submission date: | 2008-02-29 |
| Abstract: | We present the verification of the normalisation of a binary decision diagram (BDD). The normalisation follows the original algorithm presented by Bryant in 1986 and transforms an ordered BDD in a reduced, ordered and shared BDD. The verification is based on Hoare logics. |
| BibTeX: |
@article{BDD-AFP,
author = {Veronika Ortner and Norbert Schirmer},
title = {BDD Normalisation},
journal = {Archive of Formal Proofs},
month = feb,
year = 2008,
note = {\url{http://isa-afp.org/entries/BDD.html},
Formal proof development},
ISSN = {2150-914x},
}
|
| License: | BSD License |
| Depends on: | Simpl |
| Status: [ok] | 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 |