Data Structures for Boolean Functions BDDs — Foundations and Applications
Identifieur interne : 000223 ( LNCS/Analysis ); précédent : 000222; suivant : 000224Data 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
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].
Url:
DOI: 10.1007/3-540-45506-X_6
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001044
- to stream Istex, to step Curation: 000F34
- to stream Istex, to step Checkpoint: 000C44
- to stream Main, to step Merge: 002114
- to stream PascalFrancis, to step Corpus: 000D74
- to stream PascalFrancis, to step Curation: 000162
- to stream PascalFrancis, to step Checkpoint: 000C06
- to stream Main, to step Merge: 002162
- to stream Main, to step Curation: 001E40
- to stream Main, to step Exploration: 001E40
- to stream LNCS, to step Extraction: 000223
Links to Exploration step
ISTEX:1C347522FCD0C7EFA38BCE25B6E3C3066B22486ALe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">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><country>Allemagne</country>
<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>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:1C347522FCD0C7EFA38BCE25B6E3C3066B22486A</idno>
<date when="2001" year="2001">2001</date>
<idno type="doi">10.1007/3-540-45506-X_6</idno>
<idno type="url">https://api.istex.fr/document/1C347522FCD0C7EFA38BCE25B6E3C3066B22486A/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001044</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001044</idno>
<idno type="wicri:Area/Istex/Curation">000F34</idno>
<idno type="wicri:Area/Istex/Checkpoint">000C44</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000C44</idno>
<idno type="wicri:doubleKey">0302-9743:2001:Meinel C:data:structures:for</idno>
<idno type="wicri:Area/Main/Merge">002114</idno>
<idno type="wicri:source">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>
<idno type="wicri:doubleKey">0302-9743:2001:Meinel C:data:structures:for</idno>
<idno type="wicri:Area/Main/Merge">002162</idno>
<idno type="wicri:Area/Main/Curation">001E40</idno>
<idno type="wicri:Area/Main/Exploration">001E40</idno>
<idno type="wicri:Area/LNCS/Extraction">000223</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">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"><country xml:lang="fr">Allemagne</country>
<wicri:regionArea>FB IV - Informatik, Universität Trier, 54286, Trier</wicri:regionArea>
<wicri:noRegion>54286, Trier</wicri:noRegion>
<wicri:noRegion>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>
<affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country>
<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"><country xml:lang="fr">Allemagne</country>
<wicri:regionArea>FB IV - Informatik, Universität Trier, 54286, Trier</wicri:regionArea>
<wicri:noRegion>54286, Trier</wicri:noRegion>
<wicri:noRegion>Trier</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s">Lecture Notes in Computer Science</title>
<imprint><date>2001</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="ISSN">0302-9743</idno>
</series>
<idno type="istex">1C347522FCD0C7EFA38BCE25B6E3C3066B22486A</idno>
<idno type="DOI">10.1007/3-540-45506-X_6</idno>
<idno type="ChapterID">6</idno>
<idno type="ChapterID">Chap6</idno>
</biblStruct>
</sourceDesc>
<seriesStmt><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>Circuit VLSI</term>
<term>Conception assistée</term>
<term>Conception circuit</term>
<term>Diagramme binaire décision</term>
<term>Fonction booléenne</term>
<term>Structure donnée</term>
<term>Vérification formelle</term>
</keywords>
</textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">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].</div>
</front>
</TEI>
<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="Meinel, Christoph" sort="Meinel, Christoph" uniqKey="Meinel C" first="Christoph" last="Meinel">Christoph Meinel</name>
<name sortKey="Stangier, Christian" sort="Stangier, Christian" uniqKey="Stangier C" first="Christian" last="Stangier">Christian Stangier</name>
<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/LNCS/Analysis
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000223 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/LNCS/Analysis/biblio.hfd -nk 000223 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Rhénanie |area= UnivTrevesV1 |flux= LNCS |étape= Analysis |type= RBID |clé= ISTEX:1C347522FCD0C7EFA38BCE25B6E3C3066B22486A |texte= Data Structures for Boolean Functions BDDs — Foundations and Applications }}
This area was generated with Dilib version V0.6.31. |