Sciweavers

500 search results - page 59 / 100
» ACD Term Rewriting
Sort
View
BIRTHDAY
2007
Springer
15 years 4 months ago
Reduction Strategies and Acyclicity
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...
Jan Willem Klop, Vincent van Oostrom, Femke van Ra...
FLOPS
2008
Springer
14 years 11 months ago
Termination of Narrowing in Left-Linear Constructor Systems
Narrowing extends rewriting with logic capabilities by allowing free variables in terms and replacing matching with unification. Narrowing has been widely used in different context...
Germán Vidal
ENTCS
2006
103views more  ENTCS 2006»
14 years 9 months ago
Static Equivalence is Harder than Knowledge
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
Johannes Borgström
ENTCS
2006
135views more  ENTCS 2006»
14 years 9 months ago
Formal Semantics and Analysis of Component Connectors in Reo
We present an operational semantics for a component composition language called Reo. Reo connectors exogenously compose and coordinate the interactions among individual components...
Mohammad Reza Mousavi, Marjan Sirjani, Farhad Arba...
CADE
2011
Springer
13 years 9 months ago
Experimenting with Deduction Modulo
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
Guillaume Burel