Kenneth C. Cox and Gruia-Cataling Roman, A Characterization of the Computational Power of Rule-Based Visualization, Journal of Visual Languages and Computing, Volume 5, Number 1, March 1994, pp. 5-27. 60 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
The Evolution of Tarraingím: A Model and System for.. - Noble, al. (Correct)
....the implementations of those abstractions in the target program. Abstractions in the target program have been described using several techniques: the target program can be annotated to identify its abstractions and the interesting events in its execution [2, 16] or procedures [8] or mapping rules [6, 4] can be written to extract this information from the program. Although they differ in detail, the process to construct an abstract visualisation is roughly the same for each technique. A programmer must inspect the target program and understand how the abstractions to be visualised are ....
K. C. Cox and G.-C. Roman. A characterization of the computational power of rule-based visualization. Journal of Visual Languages and Computing, 5(1), Mar. 1994.
An Evaluation of the Pavane Visualization System - Cox, Roman (1994) (1 citation) Self-citation (Cox Roman) (Correct)
.... fixpoint before their name) When a fixpoint mapping is evaluated, the fixpoint rules are applied repeatedly until the output space of the mapping remains unchanged (reaches a fixpoint) This capability allows each sub mapping to perform unbounded serial computation. As we have shown elsewhere [3], both the history capability (memory) and the fixpoint application (unbounded computation) are essential to the construction of program visualizations. This result applies, of course, to all systems, not just to the rule based approach used in Pavane. We have also shown that Pavane mappings with ....
....tuple and transmits it to the mapping computation. To continue the above example, if nelems is 3 and the following code is executed: sortdata[0] 6; sortdata[1] 3; sortdata[2] 8; VisualUpdate( the VisualUpdate( call will cause the transformation of sortdata into the Pavane tuple sortarray([6,3,8]) This tuple is then transmitted to the mapping. This simple method of specifying the state and state changes in C programs could be extended in many ways; for example, mechanisms for automatically monitoring the program could be investigated. However, it was sufficient for the Pavane evaluation. ....
Cox, K. C. and Roman, G.-C., "A Characterization of the Computational Power of Rule-based Visualization, " Journal of Visual Languages and Computing 5(1), March 1994, pp. 5-27.
Algorithm Animation in a Declarative Visual Programming Language - Carlson, Burnett (1995) (Correct)
No context found.
Kenneth C. Cox and Gruia-Cataling Roman, A Characterization of the Computational Power of Rule-Based Visualization, Journal of Visual Languages and Computing, Volume 5, Number 1, March 1994, pp. 5-27. 60
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC