183 search results - page 33 / 37 » Automated theorem proving by resolution in non-classical log... |
ICECCS
2005
IEEE
14 years 1 months ago
2005
IEEE
To guarantee the security of computer systems, it is necessary to define security permissions to restrict the access to the systems’ resources. These permissions rely on certai...
LOPSTR
2004
Springer
14 years 25 days ago
2004
Springer
We address the problem of an efficient rewriting strategy for general term rewriting systems. Several strategies have been proposed over the last two decades for rewriting, the mos...
CSFW
2009
IEEE
13 years 11 months ago
2009
IEEE
This paper presents a language, based on transaction logic, for specifying dynamic authorisation policies, i.e., rules governing actions that may depend on and update the authoris...
ENTCS
2008
13 years 7 months ago
2008
Computational origami is the computer assisted study of mathematical and computational aspects of origami. An origami is constructed by a finite sequence of fold steps, each consi...
SP
2010
IEEE
13 years 5 months ago
2010
IEEE
The security of systems such as operating systems, hypervisors, and web browsers depend critically on reference monitors to correctly enforce their desired security policy in the ...