2007
DOI: 10.1016/j.entcs.2007.02.049
|View full text |Cite
|
Sign up to set email alerts
|

An Account of Implementing Applicative Term Rewriting

Abstract: Generation of labelled transition systems from system specifications is highly dependent on efficient rewriting (or related techniques). We give an account of the implementation of two rewriters of the mCRL2 toolset. These rewriters work on open terms and use nonlinear match trees. A comparison is made with other commonly used efficient rewriters.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2009
2009
2019
2019

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 19 publications
0
1
0
Order By: Relevance
“…It is indeed true that a poor programmer may disqualify a valuable algorithm for some time, but if the algorithm sounds interesting, other scientists will try to implement it and come up with different experimental results. Also, publications containing invalid observations or conclusions have always been part of science, but sooner or later, if the topic is still of interest, they are detected and corrected (see, e.g., [21] vs [51] on the comparative assessment of term rewrite engines).…”
Section: Definition Of Formal Toolsmentioning
confidence: 99%
“…It is indeed true that a poor programmer may disqualify a valuable algorithm for some time, but if the algorithm sounds interesting, other scientists will try to implement it and come up with different experimental results. Also, publications containing invalid observations or conclusions have always been part of science, but sooner or later, if the topic is still of interest, they are detected and corrected (see, e.g., [21] vs [51] on the comparative assessment of term rewrite engines).…”
Section: Definition Of Formal Toolsmentioning
confidence: 99%