Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

35

ENTCS
2007

favoriteEmaildiscussreport

121views more ENTCS 2007»

An Account of Implementing Applicative Term Rewriting

13 years 11 months ago

An Account of Implementing Applicative Term Rewriting

Download www.win.tue.nl

Generation of labelled transition systems from system speciﬁcations is highly dependent on eﬃcient 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 eﬃcient rewriters.

Muck van Weerdenburg

Real-time Traffic

ENTCS 2007 | Nonlinear Match Trees | Open Terms | Transition Systems |

claim paper

Related Content

» Dynamic Dependence in Term rewriting Systems and its Application to Program Slicing

» Term Rewriting Meets AspectOriented Programming

» Dynamic EventBased Access Control as Term Rewriting

» Towards an Efficient Implementation of Tree Automata Completion

» RNA Pseudoknot Prediction Using Term Rewriting

» Inducing Constructor Systems from ExampleTerms by Detecting Syntactical Regularities

» Time and Location Based Services with Access Control

» The CATI Project Charging and Accounting Technology for the Internet

» Distributed Packet Rewriting and its Application to Scalable Server Architectures

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	ENTCS
Authors	Muck van Weerdenburg

Comments (0)