Software Visualization: International Seminar Dagstuhl Castle, Germany, May 20-25, 2001 Revised LecturesStephan Diehl Springer, 2003. gada 31. jūl. - 408 lappuses This book presents the state of the art in software visualization and thus attempts to establish it as a field on its own. Based on a seminar held at Dagstuhl Castle in May 2001, the book offers topical sections on: - algorithm animation - software visualization and software engineering - software visualization and education - graphs in software visualization - and perspectives of software visualization. Each section starts with an introduction surveying previous and current work and providing extensive bibliographies. |
No grāmatas satura
1.–5. rezultāts no 77.
2. lappuse
... step and break points and a number of other features. In Zeus [11], Cat [14], and the later Java based system Jcat [18] the views were distributed on several workstations. The system Tango [72] implemented the path-transition paradigm ...
... step and break points and a number of other features. In Zeus [11], Cat [14], and the later Java based system Jcat [18] the views were distributed on several workstations. The system Tango [72] implemented the path-transition paradigm ...
17. lappuse
... step consists of identifying the relevant actions performed by the algorithm that are interesting for visualization purposes. Such relevant actions are usually referred to as interesting events. For instance, in a sorting algorithm the ...
... step consists of identifying the relevant actions performed by the algorithm that are interesting for visualization purposes. Such relevant actions are usually referred to as interesting events. For instance, in a sorting algorithm the ...
20. lappuse
... steps in specifying an algorithm visualization consist of deciding which pieces of information related to the algorithm's execution should be visualized and choosing a suitable graphical representation for them. In the case of sorting ...
... steps in specifying an algorithm visualization consist of deciding which pieces of information related to the algorithm's execution should be visualized and choosing a suitable graphical representation for them. In the case of sorting ...
23. lappuse
... steps are logically grouped and details elided). There is a main difference in the way granularity is controlled with interesting events and state mapping. To generate an animation event with interesting events, a function has to be ...
... steps are logically grouped and details elided). There is a main difference in the way granularity is controlled with interesting events and state mapping. To generate an animation event with interesting events, a function has to be ...
32. lappuse
... step towards Eliot was the implementation of self-animating data types. A data type is self-animating if the animation system provides a selection of visual representations for the type, and predefined animations are associated with its ...
... step towards Eliot was the implementation of self-animating data types. A data type is self-animating if the animation system provides a selection of visual representations for the type, and predefined animations are associated with its ...
Saturs
1 | |
16 | |
31 | |
Animating Algorithms Live and Post Mortem | 46 |
Algorithm Animation Using Data Flow Tracing | 73 |
A Generic Tool for Interactive Visualization of Geometric | 88 |
Algorithm Animation Systems for Constrained Domains | 101 |
Software Engineering | 129 |
Towards a Taxonomy of Network Protocol Visualization Tools | 241 |
Understanding Algorithms by Means of Visualized Path Testing | 256 |
Animated Active Learning Comprehensive Teaching | 269 |
Graphs in Software Visualization | 284 |
Graph Drawing Algorithm Engineering with AGD | 307 |
An Overview of the GXL Graph Exchange Language | 324 |
Call Graph and Control Flow Graph Visualization for Developers | 337 |
Visualization for the Minds Eye | 354 |
Visualizing the Execution of Java Programs | 151 |
Automatic Program Visualization with Object and Sequence | 175 |
Visualizing Memory Graphs | 191 |
Software Visualization and Education | 205 |
A Language and System for Constructing and Presenting Low Fidelity | 227 |
The rube Framework for Personalized 3D Software Visualization | 368 |
Visualizing Abstract States and Invariants | 381 |
Visualisation and Debugging of Decentralised Information Ecosystems | 395 |
Citi izdevumi - Skatīt visu
Software Visualization: International Seminar Dagstuhl Castle, Germany, May ... Stephan Diehl Ierobežota priekšskatīšana - 2002 |
Software Visualization: International Seminar Dagstuhl Castle, Germany, May ... Stephan Diehl Priekšskatījums nav pieejams - 2002 |
Bieži izmantoti vārdi un frāzes
abstraction algorithm animation system algorithm visualization aliasing analysis applet application approach attributes automatically automaton Bauhaus components Computer Science Computer Science Education construction control flow graph create data flow data structures debugging Diehl display drawing algorithms dynamic edges editors elements environment example execution Figure finite state automaton function geometric GeoWin graph drawing graphical hypertextbook IEEE implementation infohabitants input interactive interesting events Java programs JAVAVIS Jeliot Journal of Visual layer layout learning LNCS low fidelity mapping memory graph method Mutzel network protocol visualization nodes object diagram object-oriented object-oriented programs objects planar graph problem Proceedings program visualization representation represented reverse engineering rube SALSA sequence sequence diagram simulation Software Visualization source code specific Springer-Verlag Stasko step storyboard Symposium taxonomy techniques thread tion tracing tree variables Visual Languages visualisation visualization tools