23201 search results - page 108 / 4641 » Rewriting Systems with Data |
151
click to vote
ENTCS
2008
15 years 5 months ago
2008
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
138
click to vote
BIRTHDAY
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. In this paper we review some well-known theory about reduction strategies of various kinds: normalizing, outermost-fair, cofinal, Church-Rosser. A stumbling block in the...
118
click to vote
PPDP
2005
Springer
15 years 11 months ago
2005
Springer
We address the problem of controlling information leakage in a concurrent declarative programming setting. Our aim is to define verification tools in order to distinguish betwee...
186
click to vote
WOLLIC
2010
Springer
15 years 10 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...
258
click to vote
PLILP
1993
Springer
15 years 9 months ago
1993
Springer
Many recent proposals for the integration of functional and logic programming use conditional term rewriting systems (CTRS) as programs and narrowing as goal solving mechanism. Thi...