Sciweavers

273 search results - page 4 / 55
» A Compositional Semantics for Conditional Term Rewriting Sys...
Sort
View
PPDP
2007
Springer
15 years 5 months ago
A simple rewrite notion for call-time choice semantics
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...
Francisco Javier López-Fraguas, Juan Rodr&i...
ESORICS
2007
Springer
15 years 5 months ago
Modular Access Control Via Strategic Rewriting
Abstract. Security policies, in particular access control, are fundamental elements of computer security. We address the problem of authoring and analyzing policies in a modular wa...
Daniel J. Dougherty, Claude Kirchner, Hél&e...
FUIN
2008
124views more  FUIN 2008»
14 years 11 months ago
Causal Semantics of Algebraic Petri Nets distinguishing Concurrency and Synchronicity
In this paper, we show how to obtain causal semantics distinguishing "earlier than" and "not later than" causality between events from algebraic semantics of Pe...
Gabriel Juhás, Robert Lorenz, Sebastian Mau...
ACSD
2006
IEEE
106views Hardware» more  ACSD 2006»
15 years 5 months ago
Synchronous + Concurrent + Sequential = Earlier than + Not later than
In this paper, we show how to obtain causal semantics distinguishing ”earlier than” and ”not later than” causality between events from algebraic semantics of Petri nets. J...
Gabriel Juhás, Robert Lorenz, Sebastian Mau...
POPL
2007
ACM
15 years 12 months ago
Semantics of static pointcuts in aspectJ
In aspect-oriented programming, one can intercept events by writing patterns called pointcuts. The pointcut language of the most popular aspect-oriented programming language, Aspe...
Pavel Avgustinov, Elnar Hajiyev, Neil Ongkingco, O...