Back to results
US 8,429,206 B2Granted
Method and apparatus for rule-based transformation of policies
AssigneeInternational Business Machines Corporation
InventorsMandis S. Beigi, Seraphin B. Calo, David A. George
Life of this patent
Estimating the term…
Abstract
A logical expression of a policy is generated from another logical expression of a policy, for example, via a set of transformations, each of which comprises an input sub-expression and an output sub-expression. Any sub-expression of the input expression which matches an input sub-expression of a transformation rule is replaced with the output sub-expression of that transformation rule to form a sub-expression of the output expression.
Claims20
A method for generating at least one output expression from at least one input expression, the method comprising the step of applying at least one transformation to at least one sub-expression of the at least one input expression to produce the at least one output expression,
- wherein the at least one input expression is a logical expression of a first policy and the at least one output expression is at least one logical expression of a second policy,
- wherein said transformation compares a sub-expression in a representation of said first policy with a sub-expression in a representation of a rule, wherein said at least one output expression is another sub-expression of said rule if said compared sub-expressions are substantially equivalent,
- wherein the step of applying at least one transformation to at least one sub-expression of the at least one input expression to produce the at least one output expression comprises the step of replacing at least one input sub-expression with at least one output sub-expression,
- wherein the at least one input sub-expression is at least one element of at least one set of input sub-expressions, and the at least one output sub-expression is at least one element of at least one set of output sub-expressions,
- wherein the step of replacing the at least one input sub-expression with the at least one output sub-expression comprises comparing the at least one sub-expression of the input expression to each element of the at least one set of input sub-expressions, finding a match between the at least one sub-expression of the input expression and at least one element of the at least one set of input sub-expressions, and substituting the at least one sub-expression of the input expression that matches the at least one element of the at least one set of input sub-expressions with at least one output sub-expression of the at least one set of output sub-expressions that corresponds to the at least one element of the at least one set of input sub-expressions, and
- wherein one or more steps of said method are performed by one or more hardware devices.
3 more elements
An apparatus for generating at least one output expression from at least one input expression, the apparatus comprising:
- a memory;
- and
- at least one processor coupled to the memory and operative to apply at least one transformation to at least one sub-expression of the at least one input expression to produce the at least one output expression,
- wherein the at least one input expression is a logical expression of a first policy and the at least one output expression is at least one logical expression of a second policy,
- wherein said transformation compares a sub-expression in a representation of said first policy with a sub-expression in a representation of a rule,
- wherein said at least one output expression is another sub-expression of said rule if said compared sub-expressions are substantially equivalent,
- wherein the step of applying at least one transformation to at least one sub-expression of the at least one input expression to produce the at least one output expression comprises the step of replacing at least one input sub-expression with at least one output sub-expression,
- wherein the at least one input sub-expression is at least one element of at least one set of input sub-expressions, and the at least one output sub-expression is at least one element of at least one set of output sub-expressions, and
- wherein the step of replacing the at least one input sub-expression with the at least one output sub-expression comprises comparing the at least one sub-expression of the input expression to each element of the at least one set of input sub-expressions, finding a match between the at least one sub-expression of the input expression and at least one element of the at least one set of input sub-expressions, and substituting the at least one sub-expression of the input expression that matches the at least one element of the at least one set of input sub-expressions with at least one output sub-expression of the at least one set of output sub-expressions that corresponds to the at least one element of the at least one set of input sub-expressions.
6 more elements
An article of manufacture for generating at least one output expression from at least one input expression, comprising a tangible machine readable recordable storage device containing one or more programs which when executed implement the step of applying at least one transformation to at least one sub-expression of the at least one input expression to produce the at least one output expression,
- wherein the at least one input expression is a logical expression of a first policy and the at least one output expression is at least one logical expression of a second policy,
- wherein said transformation compares a sub-expression in a representation of said first policy with a sub-expression in a representation of a rule,
- wherein said at least one output expression is another sub-expression of said rule if said compared sub-expressions are substantially equivalent,
- wherein the step of applying at least one transformation to at least one sub-expression of the at least one input expression to produce the at least one output expression comprises the step of replacing at least one input sub-expression with at least one output sub-expression,
- wherein the at least one input sub-expression is at least one element of at least one set of input sub-expressions, and the at least one output sub-expression is at least one element of at least one set of output sub-expressions, and
- wherein the step of replacing the at least one input sub-expression with the at least one output sub-expression comprises comparing the at least one sub-expression of the input expression to each element of the at least one set of input sub-expressions, finding a match between the at least one sub-expression of the input expression and at least one element of the at least one set of input sub-expressions, and substituting the at least one sub-expression of the input expression that matches the at least one element of the at least one set of input sub-expressions with at least one output sub-expression of the at least one set of output sub-expressions that corresponds to the at least one element of the at least one set of input sub-expressions.
3 more elements
Dependencies are inferred from the claim text.