中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

6 records (took 0.016 seconds)

    DISTRIBUTED DECOMPOSITION OF STRING-AUTOMATED REASONING USING PREDICATES
    1.
    发明申请
    DISTRIBUTED DECOMPOSITION OF STRING-AUTOMATED REASONING USING PREDICATES 有权

    公开(公告)号：US20220318059A1

    公开(公告)日：2022-10-06

    申请号：US17218541

    申请日：2021-03-31

    Applicant: Amazon Technologies, Inc.

    Inventor： John Byron COOK ,  Andres Philipp NOETZLI ,  Neha RUNGTA ,  Jingmei HU

    IPC: G06F9/50 ,  G06F9/54

    Abstract: Techniques are described for efficiently distributing across multiple computing resources satisfiability modulo theories (SMT) queries expressed in propositional logic with string variables. As part of the computing-related services provided by a cloud provider network, many cloud providers also offer identity and access management services, which generally help users to control access and permissions to the services and resources (e.g., compute instances, storage resources, etc.) obtained by users via a cloud provider network. By using resource policies, for example, users can granularly control which identities are able to access specific resources associated with the users' accounts and how those identities can use the resources. The ability to efficiently distribute the analysis of SMT queries expressed in propositional logic with string variables among any number of separate computing resources (e.g., among separate processes, compute instances, containers, etc.) enables the efficient analysis of such policies.

    AN EAGER SAT-BASED SOLVER FOR A QUANTIFIER-FREE THEORY OF STRINGS AND BIT VECTORS
    3.
    发明公开
    AN EAGER SAT-BASED SOLVER FOR A QUANTIFIER-FREE THEORY OF STRINGS AND BIT VECTORS 审中-公开

    公开(公告)号：US20240202545A1

    公开(公告)日：2024-06-20

    申请号：US18066881

    申请日：2022-12-15

    Applicant: Amazon Technologies, Inc.

    Inventor： Kevin LOTZ ,  Bruno DUTERTRE ,  John Byron COOK ,  Amit GOEL ,  Robert JONES ,  Benjamin KIESL-REITER ,  Soon Ho KONG ,  Rupak MAJUMDAR

    IPC: G06N5/01 ,  G06N5/04

    CPC classification number: G06N5/013 ,  G06N5/04

    Abstract: Techniques are described for providing a SAT-based solver for a quantifier-free theory of strings and bit vectors. The solver can be used by an automated reasoning service of a cloud provider network to analyze policies and the consequences of policies. The solver reduces an input formula to a Boolean satisfiability problem by encoding the input formula into an equisatisfiable propositional formula, where the satisfiability of the equisatisfiable propositional formula is determined by a SAT solver. Rather than using a traditional DPLL(T) style algorithm, the solver described herein bounds the length of variables in an input formula and reduces the problem to a single formula, which can then be solved using incremental SAT solving. The solver can be used independently or as part of a portfolio of solvers used to determine the satisfiability or unsatisfiability of certain formula corresponding, e.g., to questions about users' policies within a cloud provider network.

    COMPOSITIONAL REASONING TECHNIQUES FOR ROLE REACHABILITY ANALYSES IN IDENTITY SYSTEMS
    4.
    发明申请
    COMPOSITIONAL REASONING TECHNIQUES FOR ROLE REACHABILITY ANALYSES IN IDENTITY SYSTEMS 有权

    公开(公告)号：US20220094643A1

    公开(公告)日：2022-03-24

    申请号：US17029581

    申请日：2020-09-23

    Applicant: Amazon Technologies, Inc.

    Inventor： John Byron COOK ,  Neha RUNGTA ,  Andrew Jude GACEK ,  Daniel George PEEBLES ,  Carsten VARMING

    IPC: H04L12/911 ,  H04L12/923

    Abstract: Techniques are described for using compositional reasoning techniques to perform role reachability analyses relative to collections of user accounts and roles of a cloud provider network. Delegated role-based resource management generally is a method for controlling access to resources in cloud provider networks and other distributed systems. Many cloud provider networks, for example, implement identity and access management subsystems using this approach, where the concept of “roles” is used to specify which resources can be accessed by people, software, or (recursively) by other roles. An abstraction of the role reachability analysis is provided that can be used as input to a model-checking application to reason about such role reachability questions (e.g., which roles of an organization are reachable from other roles).

Patent Agency Ranking