Sciweavers

1000 search results - page 101 / 200
» Nominal rewriting systems
Sort
View
ENTCS
2006
103views more  ENTCS 2006»
13 years 10 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
122views more  ENTCS 2006»
13 years 10 months ago
Combining Aspect-Oriented and Strategic Programming
Properties such as logging, persistence, debugging, tracing, distribution, performance monitoring and exception handling occur in most programming paradigms and are normally very ...
Karl Trygve Kalleberg, Eelco Visser
ENTCS
2006
114views more  ENTCS 2006»
13 years 10 months ago
Prototyping SOS Meta-theory in Maude
We present a prototype implementation of SOS meta-theory in the Maude term rewriting language. The prototype defines the basic concepts of SOS meta-theory (e.g., transition formul...
Mohammad Reza Mousavi, Michel A. Reniers
ENTCS
2006
135views more  ENTCS 2006»
13 years 10 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...
ENTCS
2007
111views more  ENTCS 2007»
13 years 10 months ago
Extra Variables Can Be Eliminated from Functional Logic Programs
Programs in modern functional logic languages are rewrite systems following the constructor discipline but where confluence and termination are not required, thus defining possi...
Javier de Dios Castro, Francisco Javier Lóp...