Abstract
The suspending semantic model for the execution of the MONSTR generalised term graph rewriting language is defined. This is the canonical operational semantic model for the MONSTR language. Its correctness with respect to DACTL semantics is discussed, and a number of general theorems on the soundness of suspending executions with respect to DACTL semantics are proved. General theorems are proved about the independence of suspending primitive actions, which are useful in the verification of MONSTR systems. © Springer Pub. Co.
| Original language | English |
|---|---|
| Pages (from-to) | 756-802 |
| Number of pages | 46 |
| Journal | Journal of Universal Computer Science |
| Volume | 3 |
| Issue number | 7 |
| Publication status | Published - 1997 |
Keywords
- Intermediate Languages
- MONSTR
- Semantic Models
- Term Graph Rewriting