Sciweavers

Share
CADE
2008
Springer
8 years 6 months ago
Automated Implicit Computational Complexity Analysis (System Description)
Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully autom...
Martin Avanzini, Georg Moser, Andreas Schnabl
ESORICS
2007
Springer
8 years 10 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...
books