A graph grammar approach to concurrent programming

We propose the use of graph grammars as a theory to organize programming of highly-concurrent systems. To understand the interactions among components of a concurrent system it is useful to visualize the system as dynamically changing graphs where the nodes represent concurrent components and the edges represent (the possibility of) interactions among them. Graph grammars are effective tools for translating this intuitive understanding of system behavior into formal specifications and executable concurrent programs.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2011

Author dc:creator

• Goering, Steven Kent

Contributors dc:contributor

• Kaplan, Simon M.

• Language, Linguistics
• Computer Science

Statement dc:rights

• Copyright 1990 Goering, Steven Kent

Language dc:language

eng

Identifier

AAI9026191
(UMI)AAI9026191

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/20654