BDD-Based Boolean Synthesis

Simple item page
dc.contributor.advisorVardi, Moshe Y.en_US
dc.creatorMartinelli Tabajara, Lucasen_US
dc.date.accessioned2019-05-16T20:26:36Zen_US
dc.date.available2019-05-16T20:26:36Zen_US
dc.date.created2018-05en_US
dc.date.issued2018-04-18en_US
dc.date.submittedMay 2018en_US
dc.date.updated2019-05-16T20:26:36Zen_US
dc.description.abstractSynthesizing a Boolean function satisfying a given relation between inputs and outputs is a problem with many applications in the verification and design of hardware and software systems. In digital logic, Boolean synthesis can be used to automatically design circuits that produce the desired behavior. In program synthesis, Boolean functions can represent programs manipulating bit vectors and other data over finite domains. Additionally, Boolean synthesis is an essential component of reactive synthesis from temporal specifications, a problem that can be applied to automate the design of safety-critical systems. Binary Decision Diagrams (BDDs) have historically been popular data structures for representing Boolean functions, and BDDs are especially useful for the application of reactive synthesis, where they are particularly well-suited for fixpoint computations over sets of states. However, recent works in Boolean synthesis have raised concerns about the scalability of BDDs and chosen to use alternative approaches, such as SAT solvers. In this thesis, we show that BDDs remain viable structures for Boolean synthesis, by developing a BDD-based synthesis framework that can in many cases outperform alternative approaches. For cases where efficient BDD representations are hard to construct, we demonstrate that techniques for decomposing a Boolean relation into multiple smaller BDDs can be used to make BDD-based approaches competitive.en_US
dc.format.mimetypeapplication/pdfen_US
dc.identifier.citationMartinelli Tabajara, Lucas. "BDD-Based Boolean Synthesis." (2018) Master’s Thesis, Rice University. <a href="https://hdl.handle.net/1911/105515">https://hdl.handle.net/1911/105515</a>.en_US
dc.identifier.urihttps://hdl.handle.net/1911/105515en_US
dc.language.isoengen_US
dc.rightsCopyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder.en_US
dc.subjectBoolean synthesisen_US
dc.subjectBinary Decision Diagramsen_US
dc.subjectFactored representationen_US
dc.titleBDD-Based Boolean Synthesisen_US
dc.typeThesisen_US
dc.type.materialTexten_US
thesis.degree.departmentComputer Scienceen_US
thesis.degree.disciplineEngineeringen_US
thesis.degree.grantorRice Universityen_US
thesis.degree.levelMastersen_US
thesis.degree.nameMaster of Scienceen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
MARTINELLITABAJARA-DOCUMENT-2018.pdf
Size:
584.02 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
PROQUEST_LICENSE.txt
Size:
5.85 KB
Format:
Plain Text
Description:
Download
No Thumbnail Available
Name:
LICENSE.txt
Size:
2.62 KB
Format:
Plain Text
Description:
Download
Collections
Rice University Theses and Dissertations