Invariants and closures in the theory of rewrite systems
-
Published:1996-07
Issue:4
Volume:8
Page:463-478
-
ISSN:0934-5043
-
Container-title:Formal Aspects of Computing
-
language:en
-
Short-container-title:Form. Asp. Comput.
Affiliation:
1. Department of Statistics and Computer Science, Swedish School of Economics, Helsinki, Finland
Abstract
Abstract
The article investigates some useful concepts of rewrite systems, especially invariants and closures. The concepts are formalised with so-called string expressions, for which an axiomatisation is given. The central operator in the theory of rewrite systems, the rewrite operator, is introduced with formulas that permit a calculational approach. The connections with distributed programming are also explained.
Publisher
Association for Computing Machinery (ACM)
Subject
Theoretical Computer Science,Software
Reference14 articles.
1. Dijkstra E.W.: Reducing control traffic in a distributed implementation of mutual exclusion . Technical reports EWD851 and EWD851b University of Texas at Austin 1983.