206 search results - page 1 / 42 » Semantics, modularity, and rewriting logic |
RTA
2010
Springer
13 years 8 months ago
2010
Springer
The K framework, based on rewriting logic semantics, provides a powerful logic for deļ¬ning the semantics of programming languages. While most work in this area has focused on deļ...
ENTCS
1998
13 years 4 months ago
1998
ESORICS
2007
Springer
13 years 11 months ago
2007
Springer
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...
AGP
1994
IEEE
13 years 8 months ago
1994
IEEE
This paper considers compositions of conditional term rewriting systems as a basis for a modular approach to the design and analysis of equational logic programs. In this context,...
CADE
2008
Springer
14 years 5 months ago
2008
Springer
We present a novel proof of Toyama's famous modularity of confluence result for term rewriting systems. Apart from being short and intuitive, the proof is modular itself in th...