Abstract: Computerized methods and systems obtain a first resource identifier that identifies a first electronic resource. An association of the first electronic resource with one or more other electronic resources that are identified by resource identifiers in an identifier set is determined. The identifier set includes zero or more resource identifiers that identify electronic resources that are classified as sensitive. A type of environment to which the first electronic resource belongs is determined. A number of users in a user set that are associated with the first electronic resource is computed. The user set includes zero or more users that are classified as users of interest. A determination of whether the first electronic resource is sensitive is made based on a combination of the determined association, determined type of environment, and computed number of users.

Abstract: Based on received first criteria, computerized methods and systems select from one or more first set of computerized directories, that store information about subjects, resources, actions, and privileges associated with an organization, subsets of each of: subjects, groups of subjects, privileges, resources, groups of resources, and actions. Based on received second criteria, the computerized methods and systems select from one or more second set of directories a subset of activity logs that store information related to activities performed by subjects on resources. The computerized methods and systems generate a relationship graph using the selected subsets of subjects, groups of subjects, privileges, resources, groups of resources, actions, and activity logs, and apply a set of circulation problem constraints to the relationship graph to produce a constrained relationship graph.

Abstract: Computerized methods and systems obtain filtered candidate rules associated with components. Each component includes subsets of subjects associated with an organization and subsets of resources associated with the organization. The filtered candidate rules are optimized by a quantum optimization engine to produce optimized rules. Additional rules are produced from the optimized rules by a rule augmenter, and an updated set of rules is formed from the optimized rules and the additional rules. The updated rules are consolidated to produce new rules by taking the union of sets of the updated rules associated with two or more components. The optimizing, augmenting, and consolidating are repeated until only a single set of rules associated with a single component remains.

Abstract: Computerized methods and systems retrieve a set of resources from at least one backend collection of resources in response to a resource query. Each resource has an associated backend resource type comprising one or more backend resource attribute. At least one view is identified, from a set of predefined views, that is satisfied by the retrieved set of resources. For each backend resource attribute of the retrieved set of resources, existence of a transformation between the backend resource attribute and a corresponding frontend attribute associated with the at least one view is verified in order to identify the at least one view. A selected view is selected from the identified at least one view based on a query intent derived at least in part from the resource query. A representation of the retrieved set of resources is generated according to the selected view.

Abstract: A computer is protected from heap spray attacks by identifying blocks in a heap memory, associating the blocks in buckets according to the block sizes, selecting one of the buckets, and choosing a first block and a second block from the selected bucket. The method is further carried out by making a content comparison of the first block with the second block, accumulating a positive result when the comparison meets a predetermined criterion of similarity, and reporting a heap spray detection when accumulated positive results exceed a predetermined threshold.

Abstract: A computer is protected from heap spray attacks by identifying blocks in a heap memory, associating the blocks in buckets according to the block sizes, selecting one of the buckets, and choosing a first block and a second block from the selected bucket. The method is further carried out by making a content comparison of the first block with the second block, accumulating a positive result when the comparison meets a predetermined criterion of similarity, and reporting a heap spray detection when accumulated positive results exceed a predetermined threshold.

Abstract: An example processing system may comprise: a stack pointer configured to reference a first return address stored on a stack; a return address buffer pointer configured to reference a second return address stored in a return address buffer; and a return address verification logic configured, responsive to receiving a return instruction, to compare the first return address to the second return address.

Abstract: An example processing system may comprise: a stack pointer configured to reference a first return address stored on a stack; a return address buffer pointer configured to reference a second return address stored in a return address buffer; and a return address verification logic configured, responsive to receiving a return instruction, to compare the first return address to the second return address.