Security language translations with logic resolution
First Claim
Patent Images
1. A method comprising:
- translating a fragment of a plurality of fragments of a first proof graph reflecting a logic language into a corresponding fragment of a second proof graph reflecting a security language, wherein each fragment of the plurality of fragments forms part of a structure of the first proof graph and includes at least two nodes and at least one directed edge;
repeating the translating for additional fragments of the plurality of fragments of the first proof graph; and
creating the second proof graph based on the translating.
3 Assignments
0 Petitions
Accused Products
Abstract
Security language constructs may be translated into logic language constructs and vice versa. Logic resolution may be effected using, for example, the logic language constructs. In an example implementation, translation of a security language assertion into at least one logic language rule is described. In another example implementation, translation of a proof graph reflecting a logic language into a proof graph reflecting a security language is described. In yet another example implementation, evaluation of a logic language program using a deterministic algorithm is described.
124 Citations
17 Claims
-
1. A method comprising:
-
translating a fragment of a plurality of fragments of a first proof graph reflecting a logic language into a corresponding fragment of a second proof graph reflecting a security language, wherein each fragment of the plurality of fragments forms part of a structure of the first proof graph and includes at least two nodes and at least one directed edge; repeating the translating for additional fragments of the plurality of fragments of the first proof graph; and creating the second proof graph based on the translating. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A system comprising:
-
one or more processors; at least one input/output interface that accepts an assertion context including multiple assertions, each assertion of the multiple assertions including a syntax of a security language, the syntax for each assertion including an asserted fact and permitting one or more conditional facts and one or more constraints; and memory storing executable instructions that, when executed by the one or more processors, cause the one or more processors to perform acts comprising; translating the assertion context into a program in a logic language; evaluating the program in the logic language in conjunction with an authorization query using a deterministic algorithm based on tabling, wherein the deterministic algorithm produces a first proof graph comprising a plurality of fragments, wherein each fragment of the plurality of fragments forms part of a structure of the first proof graph and includes at least two nodes and at least one directed edge; and translating the first proof graph reflecting the logic language into a second proof graph reflecting the security language. - View Dependent Claims (9, 10, 11, 12)
-
-
13. A system comprising:
-
one or more processors; memory storing executable instructions that, when executed by the one or more processors, cause the one or more processors to perform acts comprising; translating a fragment of a plurality of fragments of a first proof graph reflecting a logic language into a corresponding fragment of a second proof graph reflecting a security language, wherein each fragment of the plurality of fragments forms part of a structure of the first proof graph and includes at least two nodes and at least one directed edge; repeating the translating for additional fragments of the plurality of fragments of the first proof graph; and creating the second proof graph based on the translating. - View Dependent Claims (14, 15, 16, 17)
-
Specification