Sciweavers

126 search results - page 1 / 26
» Decreasing Diagrams II
Sort
View
LOGCOM
2000
103views more  LOGCOM 2000»
13 years 10 months ago
A geometric proof of confluence by decreasing diagrams
The criterion for confluence using decreasing diagrams is a generalization of several well-known confluence criteria act rewriting, such as the strong confluence lemma. We give a ...
Jan Willem Klop, Vincent van Oostrom, Roel C. de V...
FOIKS
2006
Springer
14 years 2 months ago
Consistency Checking Algorithms for Restricted UML Class Diagrams
Abstract. Automatic debugging of UML class diagrams helps in the visual specification of software systems because users cannot detect errors in logical inconsistency easily. This p...
Ken Kaneiwa, Ken Satoh
TCS
2010
13 years 9 months ago
On the complexities of consistency checking for restricted UML class diagrams
Automatic debugging of UML class diagrams helps in the visual specification of software systems because users cannot detect errors in logical consistency easily. This paper focus...
Ken Kaneiwa, Ken Satoh
CADE
2010
Springer
13 years 12 months ago
Decreasing Diagrams and Relative Termination
In this paper we use the decreasing diagrams technique to show that a left-linear term rewrite system R is confluent if all its critical pairs are joinable and the critical pair st...
Nao Hirokawa, Aart Middeldorp
RTA
2010
Springer
14 years 2 months ago
Automated Confluence Proof by Decreasing Diagrams based on Rule-Labelling
Decreasing diagrams technique (van Oostrom, 1994) is a technique that can be widely applied to prove confluence of rewrite systems. To directly apply the decreasing diagrams techn...
Takahito Aoto