23201 search results - page 160 / 4641 » Rewriting Systems with Data |
159
click to vote
IDEAS
2009
IEEE
16 years 1 months ago
2009
IEEE
This paper is concerned with a transformation-based approach to update propagation in an extended version of Codd’s relational algebra which allows for defining derived relatio...
162
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
Linear Logic is based on the analogy between algebraic linearity (i.e. commutation with sums and scalar products) and the computer science linearity (i.e. calling inputs only once...
150
click to vote
CALCO
2009
Springer
16 years 1 months ago
2009
Springer
We generalize the unfolding semantics, previously developed for concrete formalisms such as Petri nets and graph grammars, to the setting of (single pushout) rewriting over adhesiv...
188
click to vote
LOPSTR
2009
Springer
16 years 1 months ago
2009
Springer
We show how to combine the two most powerful approaches for automated termination analysis of logic programs (LPs): the direct approach which operates directly on LPs and the trans...
156
click to vote
RTA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We consider the problem of deciding the security of cryptographic protocols for a bounded number of sessions, taking into account some algebraic properties of the securit...