Curation
PascalFrancis
Racine
Curation
Checkpoint
PascalFrancis
Racine
PascalFrancis
Exploration
Accueil
Racine
Racine

Serveur d'exploration sur l'Université de Trèves

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Data structures for Boolean functions BDDs: Foundations and applications

Identifieur interne : 000162 ( PascalFrancis/Curation ); précédent : 000161; suivant : 000163

Data structures for Boolean functions BDDs: Foundations and applications

Auteurs : Christoph Meinel [Allemagne] ; Christian Stangier [Allemagne]

Source :

RBID : Pascal:02-0166342

Descripteurs français

English descriptors

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].
pA  
A01 01  1    @0 0302-9743
A05       @2 2122
A08 01  1  ENG  @1 Data structures for Boolean functions BDDs: Foundations and applications
A09 01  1  ENG  @1 Computational discrete mathematics : advanced lectures
A11 01  1    @1 MEINEL (Christoph)
A11 02  1    @1 STANGIER (Christian)
A12 01  1    @1 ALT (Helmut) @9 ed.
A14 01      @1 FB IV - Informatik, Universität Trier @2 54286 Trier @3 DEU @Z 1 aut. @Z 2 aut.
A20       @1 61-78
A21       @1 2001
A23 01      @0 ENG
A26 01      @0 3-540-42775-9
A43 01      @1 INIST @2 16343 @5 354000096809020060
A44       @0 0000 @1 © 2002 INIST-CNRS. All rights reserved.
A45       @0 42 ref.
A47 01  1    @0 02-0166342
A60       @1 P
A61       @0 A
A64 01  1    @0 Lecture notes in computer science
A66 01      @0 DEU
C01 01    ENG  @0 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].
C02 01  X    @0 001D03F06B
C02 02  X    @0 001D02B09
C03 01  X  FRE  @0 Conception circuit @5 01
C03 01  X  ENG  @0 Circuit design @5 01
C03 01  X  SPA  @0 Diseño circuito @5 01
C03 02  X  FRE  @0 Conception assistée @5 02
C03 02  X  ENG  @0 Computer aided design @5 02
C03 02  X  SPA  @0 Concepción asistida @5 02
C03 03  X  FRE  @0 Circuit VLSI @5 03
C03 03  X  ENG  @0 VLSI circuit @5 03
C03 03  X  SPA  @0 Circuito VLSI @5 03
C03 04  3  FRE  @0 Vérification formelle @5 05
C03 04  3  ENG  @0 Formal verification @5 05
C03 05  X  FRE  @0 Structure donnée @5 06
C03 05  X  ENG  @0 Data structure @5 06
C03 05  X  SPA  @0 Estructura datos @5 06
C03 06  X  FRE  @0 Diagramme binaire décision @5 07
C03 06  X  ENG  @0 Binary decision diagram @5 07
C03 06  X  SPA  @0 Diagrama binaria decisión @5 07
C03 07  X  FRE  @0 Fonction booléenne @5 08
C03 07  X  ENG  @0 Boolean function @5 08
C03 07  X  SPA  @0 Función booliana @5 08
N21       @1 091
N82       @1 PSI

Links toward previous steps (curation, corpus...)

Links to Exploration step

Pascal:02-0166342

Le 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>
</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>
</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>
</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>
</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>
</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>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/PascalFrancis/Curation

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000162 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/biblio.hfd -nk 000162 | 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=   Curation
   |type=    RBID
   |clé=     Pascal:02-0166342
   |texte=   Data structures for Boolean functions BDDs: Foundations and applications
}}
Wicri

This area was generated with Dilib version V0.6.31.
Data generation: Sat Jul 22 16:29:01 2017. Site generation: Wed Feb 28 14:55:37 2024