会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 63. 发明申请
    • SECURE CLOUD COMPUTING PLATFORM
    • 安全云计算平台
    • US20130254841A1
    • 2013-09-26
    • US13430598
    • 2012-03-26
    • Ramarathnam VenkatesanKenneth H. EguroRoy Peter D'Souza
    • Ramarathnam VenkatesanKenneth H. EguroRoy Peter D'Souza
    • G06F21/00
    • G06F21/85
    • A secure cloud computing platform. The platform has a pool of secure computing devices such that each can be allocated to a customer as with other computing resources. Each secure computing device may be configured by a customer with a key and software for performing operations on sensitive data. The customer may submit data, defining a job for execution on the platform, as cyphertext. The secure computing device may perform operations on that data, which may include decrypting the data with the key and then executing the software to perform an operation on cleartext data. This operation, and the data on which it is performed, though in cleartext, may be inaccessible to the operator of the cloud computing platform. The device may operate according to a secure protocol under which the software is validated before loading and the device is provisioned with a key shared with the customer.
    • 一个安全的云计算平台。 该平台具有一组安全计算设备,使得每个可以与其他计算资源一样分配给客户。 每个安全计算设备可以由具有用于对敏感数据执行操作的密钥和软件的客户配置。 客户可以提交数据,在平台上定义作业以执行作为cyphertext。 安全计算设备可以对该数据执行操作,其可以包括用密钥解密数据,然后执行软件以对明文数据执行操作。 该操作及其执行的数据虽然明文可能无法由云计算平台的操作员访问。 设备可以根据安全协议进行操作,在该安全协议下,软件在加载之前被验证并且设备被提供有与客户共享的密钥。
    • 64. 发明授权
    • Template based approach to discovering disjunctive and quantified invariants over predicate abstraction
    • 基于模板的方法来发现关于谓词抽象的分离和量化不变量
    • US08271404B2
    • 2012-09-18
    • US12244674
    • 2008-10-02
    • Sumit GulwaniRamarathnam VenkatesanSaurabh Srivastava
    • Sumit GulwaniRamarathnam VenkatesanSaurabh Srivastava
    • G06F15/18
    • G06F11/3608
    • Techniques are disclosed for generating complex invariants in a program using a Satisfiability Modulo Theories (SMT) solver. In one embodiment, the generated invariants may be used to validate assert statements in a program. Additionally or alternatively, a weakest pre-condition invariant may be generated such that parameters passed to the program that satisfy the weakest pre-condition are guaranteed to satisfy the program's assert statements. Additionally or alternatively, a strongest post-condition may be generated, determining what is guaranteed to be true about the state of the program upon completion of the program. In one embodiment, the SMT solver generates invariants by mapping predicates onto unknown variables in a template. The template may comprise unknown variables related by logical structures defined with disjunctions, universal quantifiers, and existential quantifiers. The predicates may comprise equalities and inequalities between program variables.
    • 公开了在使用可满足性模理论(SMT)求解器的程序中生成复杂不变量的技术。 在一个实施例中,生成的不变量可用于验证程序中的断言声明。 另外或替代地,可以生成最弱的前置条件不变量,使得传递到满足最弱前置条件的程序的参数被保证满足程序的断言语句。 另外或替代地,可以产生最强的后置条件,确定在程序完成时对程序的状态有保证是真实的。 在一个实施例中,SMT求解器通过将谓词映射到模板中的未知变量来生成不变量。 模板可以包括通过用分离定义的逻辑结构相关的未知变量,通用量词和存在量词。 谓词可能包含程序变量之间的均等和不等式。
    • 68. 发明授权
    • Minimum delta generator for program binaries
    • 程序二进制文件的最小增量生成器
    • US07681190B2
    • 2010-03-16
    • US11276814
    • 2006-03-15
    • Ramarathnam VenkatesanSaurabh Sinha
    • Ramarathnam VenkatesanSaurabh Sinha
    • G06F9/44
    • G06F8/658Y10S707/99936Y10S707/99943
    • Implementations provide a technology for generating a minimum delta between at least two program binaries. An implementation is given a source program (S) in a binary format and a target program (T) in a binary form. It constructs control flow graphs (CFGs) of each. It matches common blocks of the S's CFGs and T's CFGs. The blocks are matched based upon their content and their local neighborhoods. In addition, the register renaming problems is solved so that blocks can be fairly compared. This implementation produces an intermediate output, which is the content of unmatched blocks. It generates a set of edge edit operations for merging the unmatched blocks into S. The combination of the unmatched blocks and the edit operations is the delta. To patch S to produce a reconstructed copy of T, the delta is merged with S.
    • 实现提供了一种用于在至少两个程序二进制文件之间生成最小增量的技术。 给出了二进制格式的源程序(S)和二进制形式的目标程序(T)的实现。 它构建了每个的控制流图(CFG)。 它匹配S的CFG和T的CFG的通用块。 基于他们的内容和他们当地的社区匹配。 此外,解决了寄存器重命名问题,以便可以比较块。 该实现产生中间输出,它是不匹配块的内容。 它生成一组用于将不匹配的块合并到S中的边缘编辑操作。不匹配块和编辑操作的组合是增量。 为了修补S以产生T的重构副本,delta与S合并。