Search Results - "Nonnumerical Algorithms and Problems—Complexity of Proof Proce- dures General Terms"
-
1
Authors:
Contributors:
Subject Terms: Categories and Subject Descriptors, F.4.1 [Mathematical Logic and Formal Languages, Mathematical Logic—Modal Logic, Computational Logic, F.2.2. [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Complexity of Proof Proce- dures General Terms, Algorithms, Languages, Theory Additional Key Words and Phrases, Shallow models, resolution, coalgebra
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.685.8626; http://users.cecs.anu.edu.au/%7Edpattinson/Publications/tocl2009.pdf
-
2
Authors: et al.
Contributors: et al.
Subject Terms: Categories and Subject Descriptors, D.4.6 [Operating Systems, Security and Protection—Access controls, K.6.5 [Management of Computing and Information Systems, Security and Protection, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Complexity of proof proce- dures General Terms, Security, Theory Additional Key Words and Phrases, role-based access control, separation of duty, constraints, verification, com- putational
File Description: application/pdf
-
3
Contributors: The Pennsylvania State University CiteSeerX Archives
Subject Terms: Categories and Subject Descriptors, D.4.6 [Operating Systems, Security and Protection—Access controls, K.6.5 [Management of Computing and Information Systems, Security and Protection, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Complexity of proof proce- dures General Terms, Security, Theory Additional Key Words and Phrases, Access Control, Fault-tolerant, Policy Design
File Description: application/pdf
Nájsť tento článok vo Web of Science