Visualization in algorithm engineering: Tools and techniques
Identifieur interne :
000C75 ( PascalFrancis/Corpus );
précédent :
000C74;
suivant :
000C76
Visualization in algorithm engineering: Tools and techniques
Auteurs : Camil Demetrescu ;
Irene Finocchi ;
Giuseppe F. Italiano ;
Stefan N HerSource :
-
Lecture notes in computer science [ 0302-9743 ] ; 2002.
RBID : Pascal:03-0184297
Descripteurs français
English descriptors
Abstract
The process of implementing, debugging, testing, engineering and experimentally analyzing algorithmic codes is a complex and delicate task, fraught with many difficulties and pitfalls. In this context, traditional low-level textual debuggers or industrial-strength development environments can be of little help for algorithm engineers, who are mainly interested in high-level algorithmic ideas and not particularly in the language and platform-dependent details of actual implementations. Algorithm visualization environments provide tools for abstracting irrelevant program details and for conveying into still or animated images the high-level algorithmic behavior of a piece of software. In this paper we address the role of visualization in algorithm engineering. We survey the main approaches and existing tools and we discuss difficulties and relevant examples where visualization systems have helped developers gain insight about algorithms, test implementation weaknesses, and tune suitable heuristics for improving the practical performances of algorithmic codes.
Notice en format standard (ISO 2709)
Pour connaître la documentation sur le format Inist Standard.
| pA |
| A01 | 01 | 1 | | @0 0302-9743 |
|---|
| A05 | | | | @2 2547 |
|---|
| A08 | 01 | 1 | ENG | @1 Visualization in algorithm engineering: Tools and techniques |
|---|
| A09 | 01 | 1 | ENG | @1 Experimental algorithmics : from algorithm design to robust and efficient software : Dagstuhl, September 2000 |
|---|
| A11 | 01 | 1 | | @1 DEMETRESCU (Camil) |
|---|
| A11 | 02 | 1 | | @1 FINOCCHI (Irene) |
|---|
| A11 | 03 | 1 | | @1 ITALIANO (Giuseppe F.) |
|---|
| A11 | 04 | 1 | | @1 NÄHER (Stefan) |
|---|
| A12 | 01 | 1 | | @1 FLEISCHER (Rudolf) @9 ed. |
|---|
| A12 | 02 | 1 | | @1 MORET (Bernard) @9 ed. |
|---|
| A12 | 03 | 1 | | @1 MEINECHE SCHMIDT (Erik) @9 ed. |
|---|
| A14 | 01 | | | @1 Dipartimento di Informatica e Sistemistica, Università di Roma "La Sapienza" @2 Rome @3 ITA @Z 1 aut. |
|---|
| A14 | 02 | | | @1 Dipartimento di Scienze dell'Informazione, Università di Roma "La Sapienza" @2 Rome @3 ITA @Z 2 aut. |
|---|
| A14 | 03 | | | @1 Dipartimento di Informatica, Sistemi e Produzione, Università di Roma "Tor Vergata" @2 Rome @3 ITA @Z 3 aut. |
|---|
| A14 | 04 | | | @1 FB IV - Informatik, Universitat Trier @3 DEU @Z 4 aut. |
|---|
| A20 | | | | @1 24-50 |
|---|
| A21 | | | | @1 2002 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A26 | 01 | | | @0 3-540-00346-0 |
|---|
| A43 | 01 | | | @1 INIST @2 16343 @5 354000108493890020 |
|---|
| A44 | | | | @0 0000 @1 © 2003 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 50 ref. |
|---|
| A47 | 01 | 1 | | @0 03-0184297 |
|---|
| A60 | | | | @1 P @2 C |
|---|
| A61 | | | | @0 A |
|---|
| A64 | 01 | 1 | | @0 Lecture notes in computer science |
|---|
| A66 | 01 | | | @0 DEU |
|---|
| C01 | 01 | | ENG | @0 The process of implementing, debugging, testing, engineering and experimentally analyzing algorithmic codes is a complex and delicate task, fraught with many difficulties and pitfalls. In this context, traditional low-level textual debuggers or industrial-strength development environments can be of little help for algorithm engineers, who are mainly interested in high-level algorithmic ideas and not particularly in the language and platform-dependent details of actual implementations. Algorithm visualization environments provide tools for abstracting irrelevant program details and for conveying into still or animated images the high-level algorithmic behavior of a piece of software. In this paper we address the role of visualization in algorithm engineering. We survey the main approaches and existing tools and we discuss difficulties and relevant examples where visualization systems have helped developers gain insight about algorithms, test implementation weaknesses, and tune suitable heuristics for improving the practical performances of algorithmic codes. |
|---|
| C02 | 01 | X | | @0 001D02A05 |
|---|
| C02 | 02 | X | | @0 001D02B10 |
|---|
| C02 | 03 | X | | @0 001D02B09 |
|---|
| C03 | 01 | X | FRE | @0 Vérification programme @5 03 |
|---|
| C03 | 01 | X | ENG | @0 Program verification @5 03 |
|---|
| C03 | 01 | X | SPA | @0 Verificación programa @5 03 |
|---|
| C03 | 02 | X | FRE | @0 Visualisation @5 04 |
|---|
| C03 | 02 | X | ENG | @0 Visualization @5 04 |
|---|
| C03 | 02 | X | SPA | @0 Visualización @5 04 |
|---|
| C03 | 03 | X | FRE | @0 Débogage @5 05 |
|---|
| C03 | 03 | X | ENG | @0 Debugging @5 05 |
|---|
| C03 | 03 | X | SPA | @0 Puesta a punto programa @5 05 |
|---|
| C03 | 04 | X | FRE | @0 Donnée textuelle @5 06 |
|---|
| C03 | 04 | X | ENG | @0 Textual data @5 06 |
|---|
| C03 | 04 | X | SPA | @0 Dato textual @5 06 |
|---|
| C03 | 05 | X | FRE | @0 Evaluation performance @5 11 |
|---|
| C03 | 05 | X | ENG | @0 Performance evaluation @5 11 |
|---|
| C03 | 05 | X | SPA | @0 Evaluación prestación @5 11 |
|---|
| N21 | | | | @1 104 |
|---|
| N82 | | | | @1 PSI |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 Schloss Dagstuhl seminar on experimental algorithmics @2 1 @3 Dagstuhl DEU @4 2000-09 |
|---|
|
|---|
Format Inist (serveur)
| NO : | PASCAL 03-0184297 INIST |
|---|
| ET : | Visualization in algorithm engineering: Tools and techniques |
|---|
| AU : | DEMETRESCU (Camil); FINOCCHI (Irene); ITALIANO (Giuseppe F.); NÄHER (Stefan); FLEISCHER (Rudolf); MORET (Bernard); MEINECHE SCHMIDT (Erik) |
|---|
| AF : | Dipartimento di Informatica e Sistemistica, Università di Roma "La Sapienza"/Rome/Italie (1 aut.); Dipartimento di Scienze dell'Informazione, Università di Roma "La Sapienza"/Rome/Italie (2 aut.); Dipartimento di Informatica, Sistemi e Produzione, Università di Roma "Tor Vergata"/Rome/Italie (3 aut.); FB IV - Informatik, Universitat Trier/Allemagne (4 aut.) |
|---|
| DT : | Publication en série; Congrès; Niveau analytique |
|---|
| SO : | Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2002; Vol. 2547; Pp. 24-50; Bibl. 50 ref. |
|---|
| LA : | Anglais |
|---|
| EA : | The process of implementing, debugging, testing, engineering and experimentally analyzing algorithmic codes is a complex and delicate task, fraught with many difficulties and pitfalls. In this context, traditional low-level textual debuggers or industrial-strength development environments can be of little help for algorithm engineers, who are mainly interested in high-level algorithmic ideas and not particularly in the language and platform-dependent details of actual implementations. Algorithm visualization environments provide tools for abstracting irrelevant program details and for conveying into still or animated images the high-level algorithmic behavior of a piece of software. In this paper we address the role of visualization in algorithm engineering. We survey the main approaches and existing tools and we discuss difficulties and relevant examples where visualization systems have helped developers gain insight about algorithms, test implementation weaknesses, and tune suitable heuristics for improving the practical performances of algorithmic codes. |
|---|
| CC : | 001D02A05; 001D02B10; 001D02B09 |
|---|
| FD : | Vérification programme; Visualisation; Débogage; Donnée textuelle; Evaluation performance |
|---|
| ED : | Program verification; Visualization; Debugging; Textual data; Performance evaluation |
|---|
| SD : | Verificación programa; Visualización; Puesta a punto programa; Dato textual; Evaluación prestación |
|---|
| LO : | INIST-16343.354000108493890020 |
|---|
| ID : | 03-0184297 |
|---|
Links to Exploration step
Pascal:03-0184297
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Visualization in algorithm engineering: Tools and techniques</title>
<author><name sortKey="Demetrescu, Camil" sort="Demetrescu, Camil" uniqKey="Demetrescu C" first="Camil" last="Demetrescu">Camil Demetrescu</name>
<affiliation><inist:fA14 i1="01"><s1>Dipartimento di Informatica e Sistemistica, Università di Roma "La Sapienza"</s1>
<s2>Rome</s2>
<s3>ITA</s3>
<sZ>1 aut.</sZ>
</inist:fA14><author><name sortKey="Finocchi, Irene" sort="Finocchi, Irene" uniqKey="Finocchi I" first="Irene" last="Finocchi">Irene Finocchi</name>
<affiliation><inist:fA14 i1="02"><s1>Dipartimento di Scienze dell'Informazione, Università di Roma "La Sapienza"</s1>
<s2>Rome</s2>
<s3>ITA</s3>
<sZ>2 aut.</sZ>
</inist:fA14><author><name sortKey="Italiano, Giuseppe F" sort="Italiano, Giuseppe F" uniqKey="Italiano G" first="Giuseppe F." last="Italiano">Giuseppe F. Italiano</name>
<affiliation><inist:fA14 i1="03"><s1>Dipartimento di Informatica, Sistemi e Produzione, Università di Roma "Tor Vergata"</s1>
<s2>Rome</s2>
<s3>ITA</s3>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="N Her, Stefan" sort="N Her, Stefan" uniqKey="N Her S" first="Stefan" last="N Her">Stefan N Her</name>
<affiliation><inist:fA14 i1="04"><s1>FB IV - Informatik, Universitat Trier</s1>
<s3>DEU</s3>
<sZ>4 aut.</sZ>
</inist:fA14><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">03-0184297</idno>
<date when="2002">2002</date>
<idno type="stanalyst">PASCAL 03-0184297 INIST</idno>
<idno type="RBID">Pascal:03-0184297</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000C75</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Visualization in algorithm engineering: Tools and techniques</title>
<author><name sortKey="Demetrescu, Camil" sort="Demetrescu, Camil" uniqKey="Demetrescu C" first="Camil" last="Demetrescu">Camil Demetrescu</name>
<affiliation><inist:fA14 i1="01"><s1>Dipartimento di Informatica e Sistemistica, Università di Roma "La Sapienza"</s1>
<s2>Rome</s2>
<s3>ITA</s3>
<sZ>1 aut.</sZ>
</inist:fA14><author><name sortKey="Finocchi, Irene" sort="Finocchi, Irene" uniqKey="Finocchi I" first="Irene" last="Finocchi">Irene Finocchi</name>
<affiliation><inist:fA14 i1="02"><s1>Dipartimento di Scienze dell'Informazione, Università di Roma "La Sapienza"</s1>
<s2>Rome</s2>
<s3>ITA</s3>
<sZ>2 aut.</sZ>
</inist:fA14><author><name sortKey="Italiano, Giuseppe F" sort="Italiano, Giuseppe F" uniqKey="Italiano G" first="Giuseppe F." last="Italiano">Giuseppe F. Italiano</name>
<affiliation><inist:fA14 i1="03"><s1>Dipartimento di Informatica, Sistemi e Produzione, Università di Roma "Tor Vergata"</s1>
<s2>Rome</s2>
<s3>ITA</s3>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="N Her, Stefan" sort="N Her, Stefan" uniqKey="N Her S" first="Stefan" last="N Her">Stefan N Her</name>
<affiliation><inist:fA14 i1="04"><s1>FB IV - Informatik, Universitat Trier</s1>
<s3>DEU</s3>
<sZ>4 aut.</sZ>
</inist:fA14><series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2002">2002</date>
</imprint><seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Debugging</term>
<term>Performance evaluation</term>
<term>Program verification</term>
<term>Textual data</term>
<term>Visualization</term>
</keywords><keywords scheme="Pascal" xml:lang="fr"><term>Vérification programme</term>
<term>Visualisation</term>
<term>Débogage</term>
<term>Donnée textuelle</term>
<term>Evaluation performance</term>
</keywords><front><div type="abstract" xml:lang="en">The process of implementing, debugging, testing, engineering and experimentally analyzing algorithmic codes is a complex and delicate task, fraught with many difficulties and pitfalls. In this context, traditional low-level textual debuggers or industrial-strength development environments can be of little help for algorithm engineers, who are mainly interested in high-level algorithmic ideas and not particularly in the language and platform-dependent details of actual implementations. Algorithm visualization environments provide tools for abstracting irrelevant program details and for conveying into still or animated images the high-level algorithmic behavior of a piece of software. In this paper we address the role of visualization in algorithm engineering. We survey the main approaches and existing tools and we discuss difficulties and relevant examples where visualization systems have helped developers gain insight about algorithms, test implementation weaknesses, and tune suitable heuristics for improving the practical performances of algorithmic codes.</div>
</front><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01><fA05><s2>2547</s2>
</fA05><fA08 i1="01" i2="1" l="ENG"><s1>Visualization in algorithm engineering: Tools and techniques</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>Experimental algorithmics : from algorithm design to robust and efficient software : Dagstuhl, September 2000</s1>
</fA09><fA11 i1="01" i2="1"><s1>DEMETRESCU (Camil)</s1>
</fA11><fA11 i1="02" i2="1"><s1>FINOCCHI (Irene)</s1>
</fA11><fA11 i1="03" i2="1"><s1>ITALIANO (Giuseppe F.)</s1>
</fA11><fA11 i1="04" i2="1"><s1>NÄHER (Stefan)</s1>
</fA11><fA12 i1="01" i2="1"><s1>FLEISCHER (Rudolf)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="02" i2="1"><s1>MORET (Bernard)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="03" i2="1"><s1>MEINECHE SCHMIDT (Erik)</s1>
<s9>ed.</s9>
</fA12><fA14 i1="01"><s1>Dipartimento di Informatica e Sistemistica, Università di Roma "La Sapienza"</s1>
<s2>Rome</s2>
<s3>ITA</s3>
<sZ>1 aut.</sZ>
</fA14><fA14 i1="02"><s1>Dipartimento di Scienze dell'Informazione, Università di Roma "La Sapienza"</s1>
<s2>Rome</s2>
<s3>ITA</s3>
<sZ>2 aut.</sZ>
</fA14><fA14 i1="03"><s1>Dipartimento di Informatica, Sistemi e Produzione, Università di Roma "Tor Vergata"</s1>
<s2>Rome</s2>
<s3>ITA</s3>
<sZ>3 aut.</sZ>
</fA14><fA14 i1="04"><s1>FB IV - Informatik, Universitat Trier</s1>
<s3>DEU</s3>
<sZ>4 aut.</sZ>
</fA14><fA20><s1>24-50</s1>
</fA20><fA21><s1>2002</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA26 i1="01"><s0>3-540-00346-0</s0>
</fA26><fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000108493890020</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 2003 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>50 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>03-0184297</s0>
</fA47><fA60><s1>P</s1>
<s2>C</s2>
</fA60><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>The process of implementing, debugging, testing, engineering and experimentally analyzing algorithmic codes is a complex and delicate task, fraught with many difficulties and pitfalls. In this context, traditional low-level textual debuggers or industrial-strength development environments can be of little help for algorithm engineers, who are mainly interested in high-level algorithmic ideas and not particularly in the language and platform-dependent details of actual implementations. Algorithm visualization environments provide tools for abstracting irrelevant program details and for conveying into still or animated images the high-level algorithmic behavior of a piece of software. In this paper we address the role of visualization in algorithm engineering. We survey the main approaches and existing tools and we discuss difficulties and relevant examples where visualization systems have helped developers gain insight about algorithms, test implementation weaknesses, and tune suitable heuristics for improving the practical performances of algorithmic codes.</s0>
</fC01><fC02 i1="01" i2="X"><s0>001D02A05</s0>
</fC02><fC02 i1="02" i2="X"><s0>001D02B10</s0>
</fC02><fC02 i1="03" i2="X"><s0>001D02B09</s0>
</fC02><fC03 i1="01" i2="X" l="FRE"><s0>Vérification programme</s0>
<s5>03</s5>
</fC03><fC03 i1="01" i2="X" l="ENG"><s0>Program verification</s0>
<s5>03</s5>
</fC03><fC03 i1="01" i2="X" l="SPA"><s0>Verificación programa</s0>
<s5>03</s5>
</fC03><fC03 i1="02" i2="X" l="FRE"><s0>Visualisation</s0>
<s5>04</s5>
</fC03><fC03 i1="02" i2="X" l="ENG"><s0>Visualization</s0>
<s5>04</s5>
</fC03><fC03 i1="02" i2="X" l="SPA"><s0>Visualización</s0>
<s5>04</s5>
</fC03><fC03 i1="03" i2="X" l="FRE"><s0>Débogage</s0>
<s5>05</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>Debugging</s0>
<s5>05</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Puesta a punto programa</s0>
<s5>05</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Donnée textuelle</s0>
<s5>06</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Textual data</s0>
<s5>06</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Dato textual</s0>
<s5>06</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>Evaluation performance</s0>
<s5>11</s5>
</fC03><fC03 i1="05" i2="X" l="ENG"><s0>Performance evaluation</s0>
<s5>11</s5>
</fC03><fC03 i1="05" i2="X" l="SPA"><s0>Evaluación prestación</s0>
<s5>11</s5>
</fC03><fN21><s1>104</s1>
</fN21><fN82><s1>PSI</s1>
</fN82><pR><fA30 i1="01" i2="1" l="ENG"><s1>Schloss Dagstuhl seminar on experimental algorithmics</s1>
<s2>1</s2>
<s3>Dagstuhl DEU</s3>
<s4>2000-09</s4>
</fA30><server><NO>PASCAL 03-0184297 INIST</NO>
<ET>Visualization in algorithm engineering: Tools and techniques</ET>
<AU>DEMETRESCU (Camil); FINOCCHI (Irene); ITALIANO (Giuseppe F.); NÄHER (Stefan); FLEISCHER (Rudolf); MORET (Bernard); MEINECHE SCHMIDT (Erik)</AU>
<AF>Dipartimento di Informatica e Sistemistica, Università di Roma "La Sapienza"/Rome/Italie (1 aut.); Dipartimento di Scienze dell'Informazione, Università di Roma "La Sapienza"/Rome/Italie (2 aut.); Dipartimento di Informatica, Sistemi e Produzione, Università di Roma "Tor Vergata"/Rome/Italie (3 aut.); FB IV - Informatik, Universitat Trier/Allemagne (4 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2002; Vol. 2547; Pp. 24-50; Bibl. 50 ref.</SO>
<LA>Anglais</LA>
<EA>The process of implementing, debugging, testing, engineering and experimentally analyzing algorithmic codes is a complex and delicate task, fraught with many difficulties and pitfalls. In this context, traditional low-level textual debuggers or industrial-strength development environments can be of little help for algorithm engineers, who are mainly interested in high-level algorithmic ideas and not particularly in the language and platform-dependent details of actual implementations. Algorithm visualization environments provide tools for abstracting irrelevant program details and for conveying into still or animated images the high-level algorithmic behavior of a piece of software. In this paper we address the role of visualization in algorithm engineering. We survey the main approaches and existing tools and we discuss difficulties and relevant examples where visualization systems have helped developers gain insight about algorithms, test implementation weaknesses, and tune suitable heuristics for improving the practical performances of algorithmic codes.</EA>
<CC>001D02A05; 001D02B10; 001D02B09</CC>
<FD>Vérification programme; Visualisation; Débogage; Donnée textuelle; Evaluation performance</FD>
<ED>Program verification; Visualization; Debugging; Textual data; Performance evaluation</ED>
<SD>Verificación programa; Visualización; Puesta a punto programa; Dato textual; Evaluación prestación</SD>
<LO>INIST-16343.354000108493890020</LO>
<ID>03-0184297</ID>
</server>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/PascalFrancis/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000C75 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000C75 | 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= Corpus
|type= RBID
|clé= Pascal:03-0184297
|texte= Visualization in algorithm engineering: Tools and techniques
}}
| 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 |  |
