Skip to main content
SpringerLink
Log in

Visualisierungstechniken für den Compilerbau

  • Chapter
Ausgezeichnete Informatikdissertationen 1996

Part of the book series: GI-Dissertationspreis ((GIDISS))

Zusammenfassung

Wir beschreiben Methoden zum automatischen Layout und zur interaktiven Untersuchung von Graphen aus der Sichtweise des Compilerbaus. Schwerpunkt ist die Visualisierung generierter, großer, relativ dichter Graphen (annotierte Kontrollflußgraphen, Syntaxbäume, Aufrufgraphen, Abhängigkeitsgraphen) zur Fehlersuche und zur Animation. Dazu werden schnelle Layoutheuristiken und mächtige Interaktionsmethoden benötigt. Wir beschrieben kombinierte Ansätze bekannter Verfahren, die im Visualisierungswerkzeug VCG realisiert wurden.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.95
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

Literatur

  1. Brandenburg, F.J., ed.: Proc. Symposium on Graph Drawing, GD’95, Lecture Notes in Computer Science 1027, Springer, 1996

    Google Scholar 

  2. Davis, E.: Constraint Propagation with Interval Labels, Artificial Intelligence 32, pp. 281–331, 1987

    Article  MathSciNet  MATH  Google Scholar 

  3. Davidson, R.; Harel, D.: Drawing Graphs Nicely Using Simulated Annealing, Technical Report CS89–13, Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, Israel, 1989

    Google Scholar 

  4. Eades, P.: A Heuristic for Graph Drawing, Congressus Numerantium 41, pp. 149–160, 1984.

    MathSciNet  Google Scholar 

  5. Eades, P.; Sugiyama, K.: How to Draw a Directed Graph, Journal of Information Processing, 13 (4), pp. 424–437, 1990

    MATH  Google Scholar 

  6. Eades, P.; Wormald N.: The Median Heuristic for Drawing 2-Layers Networks, Technical Report 69, Department of Computer Science, University of Queensland, 1986

    Google Scholar 

  7. Frick, A.; Ludwig, A.; Mehldau, H.: A Fast Adaptive Layout Algorithm for Undirected Graphs, in [18], pp. 388–403, 1995

    Google Scholar 

  8. Fruchterman, T.M.J.; Reingold, E.M.: Graph Drawing by Force-Directed Placement, Software — Practice and Experience 21, pp. 1129–1164, 1991

    Article  Google Scholar 

  9. Gansner, E.R.; Koutsofios, E.; North, S.C.; Vo, K.-P.: A Technique for Drawing Directed Graphs, IEEE Trans. on Software Engineering, 19(3), pp. 214–230, 1993

    Google Scholar 

  10. Green, T.R.; Petre, M.; Bellamy, R.K.E.: Comprehensibility of Visual and Textual Programs: A Test of Superlativism Against the Match-Mismatch Conjecture, Fourth Workshop on Empirical Studies of Programmers, pp. 121–146, 1991

    Google Scholar 

  11. Hyrskykari, A.: Development of Program Visualization Systems, Report, Department of Computer Science, University of Tampere, Finland, präsentiert auf dem 2nd Czech British Symposium of Visual Aspects of Man-Machine Systems, Prag, 1993

    Google Scholar 

  12. Sander, G.: Graph Layout through the VCG Tool, Technical Report A0394, FB 14 Informatik, University of Saarbrücken, Germany, 1994, eine erweiterte Zusammenfassung ist in [18], pp. 194–205, 1995.

    Google Scholar 

  13. Sander, G.; Alt, M; Ferdinand. C; Wilhelm, R.: CLaX–A Visualized Compiler in [1], pp. 459–462, 1996.

    Google Scholar 

  14. Sander, G.: A Fast Heuristic for Hierarchical Manhattan Layout, in [1], pp. 447–458, 1996

    Google Scholar 

  15. Sarkar, M.; Brown, M. H.: Graphical Fisheye Views, Communications of the ACM, vol. 37, no. 12, pp. 73–84, 1994

    Article  Google Scholar 

  16. Sugiyama, K.; Tagawa, S.; Toda, M.: Methods for Visual Understanding of Hierarchical Systems, IEEE Trans. Sys., Man, and Cybernetics, SMC 11 (2), pp. 109–125, 1981.

    Article  MathSciNet  Google Scholar 

  17. Sugiyama, K.; Misue, K.: A Simple and Unified Method for Drawing Graphs: Magnetic-Spring Algorithm, in [18], pp. 364–375, 1995

    Google Scholar 

  18. Tamassia, R.; Tollis, I.G., eds.: Graph Drawing, Proc. DIMACS Intern. Workshop GD’94, Lecture Notes in Computer Science 894, Springer, 1995.

    Google Scholar 

  19. Warfield, J. N.: Crossing Theory and Hierarchy Mapping, IEEE Trans. Sys., Man, and Cybernetics, SMC 7 (7), pp. 505–523, 1977.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FB 14 Informatik 66041 Saarbrücken Tom Sawyer Software, Universität des Saarlandes, 804 Hearst Street, Berkeley, CA, 94710, USA

    Georg Sander

Authors
  1. Georg Sander
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1998 B. G. Teubner Stuttgart

About this chapter

Cite this chapter

Sander, G. (1998). Visualisierungstechniken für den Compilerbau. In: Ausgezeichnete Informatikdissertationen 1996. GI-Dissertationspreis. Vieweg+Teubner Verlag, Wiesbaden. https://doi.org/10.1007/978-3-322-91230-5_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-322-91230-5_7

  • Publisher Name: Vieweg+Teubner Verlag, Wiesbaden

  • Print ISBN: 978-3-519-02646-4

  • Online ISBN: 978-3-322-91230-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation