M. D. Derk

  • Citations Per Year
Learn More
Reconfiguration for fault tolerance is a widely studied field, but this work applies graph grammars to this discipline for the first time. Reconfiguration Graph Grammars (RGG) are defined and applied to the definition of processor array reconfiguration algorithms. The nodes of a graph are associated with the processors of a processor array, and the edges(More)
One of the needs of the computer science community is a simple, clear and generally accepted method of defining programming language semantics. Towards this end, the author presents a new approach to operational semantics based on binding, which is dubbed relational semantics. By grouping bound elements in tuples, the primary language functions are defined(More)
  • 1