113 search results - page 7 / 23 » Reduction Strategies for Left-Linear Term Rewriting Systems |
ENTCS
2007
14 years 9 months ago
2007
We use the ρ-calculus as an intermediate language to compile functional languages with pattern-matching features, and give an interaction net encoding of the ρ-terms arising fro...
AMAST
2008
Springer
14 years 11 months ago
2008
Springer
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...
107
Voted
WOLLIC
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. The intruder deduction problem for an electronic purse protocol with blind signatures is considered. The algebraic properties of the protocol are modeled by an equational...
92
Voted
MFCS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The description of a single state of a modelled system is often complex in practice, but few procedures for synthesis address this problem in depth. We study systems in w...
ENTCS
2007
14 years 9 months ago
2007
We define a rewrite strategy for a class of non-confluent constructor-based term graph rewriting systems and discuss its correctness. Our strategy and its extension to narrowing...