Data structures for Boolean functions BDDs: Foundations and applications
Identifieur interne : 000C06 ( PascalFrancis/Checkpoint ); précédent : 000C05; suivant : 000C07Data structures for Boolean functions BDDs: Foundations and applications
Auteurs : Christoph Meinel [Allemagne] ; Christian Stangier [Allemagne]Source :
- Lecture notes in computer science [ 0302-9743 ] ; 2001.
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
Abstract
This article gives an outline of a lecture about ordered binary decision diagrams (OBDDs). Introduced in 1986, OBDDs nowadays are the state-of-the-art data structure for representation of Boolean functions in electronic design automation (EDA). An overview is given about the data structure, its properties, algorithmic behaviour, and the most important applications. Proofs and technical details have been omitted but can be found all in [28].
Affiliations:
Links toward previous steps (curation, corpus...)
Links to Exploration step
Pascal:02-0166342Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Data structures for Boolean functions BDDs: Foundations and applications</title><author><name sortKey="Meinel, Christoph" sort="Meinel, Christoph" uniqKey="Meinel C" first="Christoph" last="Meinel">Christoph Meinel</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>FB IV - Informatik, Universität Trier</s1><s2>54286 Trier</s2><s3>DEU</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>Allemagne</country><wicri:noRegion>54286 Trier</wicri:noRegion><wicri:noRegion>Universität Trier</wicri:noRegion><wicri:noRegion>54286 Trier</wicri:noRegion><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName><orgName type="university">Université de Trèves</orgName></affiliation></author><author><name sortKey="Stangier, Christian" sort="Stangier, Christian" uniqKey="Stangier C" first="Christian" last="Stangier">Christian Stangier</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>FB IV - Informatik, Universität Trier</s1><s2>54286 Trier</s2><s3>DEU</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>Allemagne</country><wicri:noRegion>54286 Trier</wicri:noRegion><wicri:noRegion>Universität Trier</wicri:noRegion><wicri:noRegion>54286 Trier</wicri:noRegion></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">02-0166342</idno><date when="2001">2001</date><idno type="stanalyst">PASCAL 02-0166342 INIST</idno><idno type="RBID">Pascal:02-0166342</idno><idno type="wicri:Area/PascalFrancis/Corpus">000D74</idno><idno type="wicri:Area/PascalFrancis/Curation">000162</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000C06</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000C06</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Data structures for Boolean functions BDDs: Foundations and applications</title><author><name sortKey="Meinel, Christoph" sort="Meinel, Christoph" uniqKey="Meinel C" first="Christoph" last="Meinel">Christoph Meinel</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>FB IV - Informatik, Universität Trier</s1><s2>54286 Trier</s2><s3>DEU</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>Allemagne</country><wicri:noRegion>54286 Trier</wicri:noRegion><wicri:noRegion>Universität Trier</wicri:noRegion><wicri:noRegion>54286 Trier</wicri:noRegion><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName><orgName type="university">Université de Trèves</orgName></affiliation></author><author><name sortKey="Stangier, Christian" sort="Stangier, Christian" uniqKey="Stangier C" first="Christian" last="Stangier">Christian Stangier</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>FB IV - Informatik, Universität Trier</s1><s2>54286 Trier</s2><s3>DEU</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>Allemagne</country><wicri:noRegion>54286 Trier</wicri:noRegion><wicri:noRegion>Universität Trier</wicri:noRegion><wicri:noRegion>54286 Trier</wicri:noRegion></affiliation></author></analytic><series><title level="j" type="main">Lecture notes in computer science</title><idno type="ISSN">0302-9743</idno><imprint><date when="2001">2001</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">Lecture notes in computer science</title><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Binary decision diagram</term><term>Boolean function</term><term>Circuit design</term><term>Computer aided design</term><term>Data structure</term><term>Formal verification</term><term>VLSI circuit</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Conception circuit</term><term>Conception assistée</term><term>Circuit VLSI</term><term>Vérification formelle</term><term>Structure donnée</term><term>Diagramme binaire décision</term><term>Fonction booléenne</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">This article gives an outline of a lecture about ordered binary decision diagrams (OBDDs). Introduced in 1986, OBDDs nowadays are the state-of-the-art data structure for representation of Boolean functions in electronic design automation (EDA). An overview is given about the data structure, its properties, algorithmic behaviour, and the most important applications. Proofs and technical details have been omitted but can be found all in [28].</div></front></TEI><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0></fA01><fA05><s2>2122</s2></fA05><fA08 i1="01" i2="1" l="ENG"><s1>Data structures for Boolean functions BDDs: Foundations and applications</s1></fA08><fA09 i1="01" i2="1" l="ENG"><s1>Computational discrete mathematics : advanced lectures</s1></fA09><fA11 i1="01" i2="1"><s1>MEINEL (Christoph)</s1></fA11><fA11 i1="02" i2="1"><s1>STANGIER (Christian)</s1></fA11><fA12 i1="01" i2="1"><s1>ALT (Helmut)</s1><s9>ed.</s9></fA12><fA14 i1="01"><s1>FB IV - Informatik, Universität Trier</s1><s2>54286 Trier</s2><s3>DEU</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></fA14><fA20><s1>61-78</s1></fA20><fA21><s1>2001</s1></fA21><fA23 i1="01"><s0>ENG</s0></fA23><fA26 i1="01"><s0>3-540-42775-9</s0></fA26><fA43 i1="01"><s1>INIST</s1><s2>16343</s2><s5>354000096809020060</s5></fA43><fA44><s0>0000</s0><s1>© 2002 INIST-CNRS. All rights reserved.</s1></fA44><fA45><s0>42 ref.</s0></fA45><fA47 i1="01" i2="1"><s0>02-0166342</s0></fA47><fA60><s1>P</s1></fA60><fA61><s0>A</s0></fA61><fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0></fA64><fA66 i1="01"><s0>DEU</s0></fA66><fC01 i1="01" l="ENG"><s0>This article gives an outline of a lecture about ordered binary decision diagrams (OBDDs). Introduced in 1986, OBDDs nowadays are the state-of-the-art data structure for representation of Boolean functions in electronic design automation (EDA). An overview is given about the data structure, its properties, algorithmic behaviour, and the most important applications. Proofs and technical details have been omitted but can be found all in [28].</s0></fC01><fC02 i1="01" i2="X"><s0>001D03F06B</s0></fC02><fC02 i1="02" i2="X"><s0>001D02B09</s0></fC02><fC03 i1="01" i2="X" l="FRE"><s0>Conception circuit</s0><s5>01</s5></fC03><fC03 i1="01" i2="X" l="ENG"><s0>Circuit design</s0><s5>01</s5></fC03><fC03 i1="01" i2="X" l="SPA"><s0>Diseño circuito</s0><s5>01</s5></fC03><fC03 i1="02" i2="X" l="FRE"><s0>Conception assistée</s0><s5>02</s5></fC03><fC03 i1="02" i2="X" l="ENG"><s0>Computer aided design</s0><s5>02</s5></fC03><fC03 i1="02" i2="X" l="SPA"><s0>Concepción asistida</s0><s5>02</s5></fC03><fC03 i1="03" i2="X" l="FRE"><s0>Circuit VLSI</s0><s5>03</s5></fC03><fC03 i1="03" i2="X" l="ENG"><s0>VLSI circuit</s0><s5>03</s5></fC03><fC03 i1="03" i2="X" l="SPA"><s0>Circuito VLSI</s0><s5>03</s5></fC03><fC03 i1="04" i2="3" l="FRE"><s0>Vérification formelle</s0><s5>05</s5></fC03><fC03 i1="04" i2="3" l="ENG"><s0>Formal verification</s0><s5>05</s5></fC03><fC03 i1="05" i2="X" l="FRE"><s0>Structure donnée</s0><s5>06</s5></fC03><fC03 i1="05" i2="X" l="ENG"><s0>Data structure</s0><s5>06</s5></fC03><fC03 i1="05" i2="X" l="SPA"><s0>Estructura datos</s0><s5>06</s5></fC03><fC03 i1="06" i2="X" l="FRE"><s0>Diagramme binaire décision</s0><s5>07</s5></fC03><fC03 i1="06" i2="X" l="ENG"><s0>Binary decision diagram</s0><s5>07</s5></fC03><fC03 i1="06" i2="X" l="SPA"><s0>Diagrama binaria decisión</s0><s5>07</s5></fC03><fC03 i1="07" i2="X" l="FRE"><s0>Fonction booléenne</s0><s5>08</s5></fC03><fC03 i1="07" i2="X" l="ENG"><s0>Boolean function</s0><s5>08</s5></fC03><fC03 i1="07" i2="X" l="SPA"><s0>Función booliana</s0><s5>08</s5></fC03><fN21><s1>091</s1></fN21><fN82><s1>PSI</s1></fN82></pA></standard></inist><affiliations><list><country><li>Allemagne</li></country><region><li>Rhénanie-Palatinat</li></region><settlement><li>Trèves (Allemagne)</li></settlement><orgName><li>Université de Trèves</li></orgName></list><tree><country name="Allemagne"><region name="Rhénanie-Palatinat"><name sortKey="Meinel, Christoph" sort="Meinel, Christoph" uniqKey="Meinel C" first="Christoph" last="Meinel">Christoph Meinel</name></region><name sortKey="Stangier, Christian" sort="Stangier, Christian" uniqKey="Stangier C" first="Christian" last="Stangier">Christian Stangier</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/PascalFrancis/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000C06 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd -nk 000C06 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= PascalFrancis
|étape= Checkpoint
|type= RBID
|clé= Pascal:02-0166342
|texte= Data structures for Boolean functions BDDs: Foundations and applications
}}
| This area was generated with Dilib version V0.6.31. |  |