Affiliation:
1. The Ohio State University
Abstract
The Binary Decision Diagram (BDD), a data structure used to efficiently represent Boolean formulas, enjoys use in the field of software verification. However, widely used implementations of the BDD are not themselves verifiable. This paper summarizes the design and implementation of a provably correct realization of the BDD as detailed in the author's master's thesis.
Publisher
Association for Computing Machinery (ACM)
Reference4 articles.
1. M. Huth and M. Ryan. Logic in Computer Science: Modelling and Reasoning about Systems chapter 6 pages 358-398. Cambridge University Press 2 edition 2004.
2. The Ohio State University Department of CSE. Sequence. http://web.cse.ohio-state.edu/software/2221/web-sw1/ extras/slides/31.Sequence.pdf 2015. [Acccessed: 2018-05-24].
3. The Ohio State University Department of CSE. OSU CSE Components. http://web.cse.ohio-state.edu/software/common/doc/ 2017. [Acccessed: 2018-05-24].
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献