Complete visualizations of concurrent programs and their executions
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The theory and methods for a completely visual formalism for programs and their executions are presented. The appearance, and not the construction, completely describes programs, data, and states of execution. Programs, their model of execution, and their execution traces are visualized in the same pictorial terms. A list of advantages of this visual formalism is given. A case study using the Janus language is presented.Keywords
This publication has 5 references indexed in Scilit:
- From proof nets to interaction netsPublished by Cambridge University Press (CUP) ,1995
- Concurrent constraint programmingPublished by Association for Computing Machinery (ACM) ,1990
- Predicates and pixelsNew Generation Computing, 1989
- Applying a theory of graphical presentation to the graphic design of user interfacesPublished by Association for Computing Machinery (ACM) ,1988
- Connection graphsPublished by Association for Computing Machinery (ACM) ,1986