会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • 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求解器通过将谓词映射到模板中的未知变量来生成不变量。 模板可以包括通过用分离定义的逻辑结构相关的未知变量,通用量词和存在量词。 谓词可能包含程序变量之间的均等和不等式。
    • 2. 发明授权
    • Program analysis as constraint solving
    • 程序分析作为约束求解
    • US08402439B2
    • 2013-03-19
    • US12147908
    • 2008-06-27
    • Sumit GulwaniSaurabh SrivastavaRamarathnam Venkatesan
    • Sumit GulwaniSaurabh SrivastavaRamarathnam Venkatesan
    • G06F9/44
    • G06F8/49
    • Described is a technology by which program analysis uses rich invariant templates that may specify an arbitrary Boolean combination of linear inequalities for program verification. Also described is choosing a cut-set that identifies program locations, each of which is associated with an invariant template. The verification generates second-order constraints, converts second-order logic formula based on those constraints into first-order logic formula, then converts the first-order logic formula into a quantifier-free formula, which is then converted into a Boolean satisfiability formula. Off-the-shelf constraint solvers may then be applied to the Boolean satisfiability formula to generate program analysis results. Various templates may be used to convert the second-order logic formula into the first-order logic formula. Further described are interprocedural analysis and the determination of weakest precondition and strongest postcondition with applications to termination analysis, timing bounds analysis, and generation of most-general counterexamples for both termination and safety properties.
    • 描述了一种技术,程序分析使用丰富的不变模板,可以为程序验证指定线性不等式的任意布尔组合。 还描述了选择一个标识程序位置的剪辑,每个程序位置与不变模板相关联。 验证产生二阶约束,将基于这些约束的二阶逻辑公式转换为一阶逻辑公式,然后将一阶逻辑公式转换为无量词的公式,然后将其转换为布尔可满足公式。 现在可以将现成的约束求解器应用于布尔可满足公式以生成程序分析结果。 可以使用各种模板来将二阶逻辑公式转换成一阶逻辑公式。 进一步描述的是过程间分析以及最弱前提条件和最强后置条件的确定,适用于终止分析,时序界限分析,以及针对终端和安全属性生成大多数一般的反例。
    • 3. 发明申请
    • PROGRAM ANALYSIS AS CONSTRAINT SOLVING
    • 程序分析作为约束解
    • US20090326907A1
    • 2009-12-31
    • US12147908
    • 2008-06-27
    • Sumit GulwaniSaurabh SrivastavaRamarathnam Venkatesan
    • Sumit GulwaniSaurabh SrivastavaRamarathnam Venkatesan
    • G06F9/45G06F7/60
    • G06F8/49
    • Described is a technology by which program analysis uses rich invariant templates that may specify an arbitrary Boolean combination of linear inequalities for program verification. Also described is choosing a cut-set that identifies program locations, each of which is associated with an invariant template. The verification generates second-order constraints, converts second-order logic formula based on those constraints into first-order logic formula, then converts the first-order logic formula into a quantifier-free formula, which is then converted into a Boolean satisfiability formula. Off-the-shelf constraint solvers may then be applied to the Boolean satisfiability formula to generate program analysis results. Various templates may be used to convert the second-order logic formula into the first-order logic formula. Further described are interprocedural analysis and the determination of weakest precondition and strongest postcondition with applications to termination analysis, timing bounds analysis, and generation of most-general counterexamples for both termination and safety properties.
    • 描述了一种技术,程序分析使用丰富的不变模板,可以为程序验证指定线性不等式的任意布尔组合。 还描述了选择一个标识程序位置的剪辑,每个程序位置与不变模板相关联。 验证产生二阶约束,将基于这些约束的二阶逻辑公式转换为一阶逻辑公式,然后将一阶逻辑公式转换为无量词的公式,然后将其转换为布尔可满足公式。 现在可以将现成的约束求解器应用于布尔可满足公式以生成程序分析结果。 可以使用各种模板来将二阶逻辑公式转换成一阶逻辑公式。 进一步描述的是过程间分析以及最弱前提条件和最强后置条件的确定,适用于终止分析,时序界限分析,以及针对终端和安全属性生成大多数一般的反例。
    • 4. 发明申请
    • Using Constraint Solving to Discovering Disjunctive and Quantified Invariants Over Predicate Abstraction
    • 使用约束求解在谓词抽象上发现分离和量化不变量
    • US20100088548A1
    • 2010-04-08
    • US12244674
    • 2008-10-02
    • Sumit GulwaniRamarathnam VenkatesanSaurabh Srivastava
    • Sumit GulwaniRamarathnam VenkatesanSaurabh Srivastava
    • G06F11/00
    • 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求解器通过将谓词映射到模板中的未知变量来生成不变量。 模板可以包括通过用分离定义的逻辑结构相关的未知变量,通用量词和存在量词。 谓词可能包含程序变量之间的均等和不等式。
    • 6. 发明申请
    • SYSTEM AND METHOD FOR PROVIDING NETWORK APPLICATION PERFORMANCE MANAGEMENT IN A NETWORK
    • 网络中网络应用性能管理的系统和方法
    • US20090013070A1
    • 2009-01-08
    • US11867288
    • 2007-10-04
    • Saurabh SrivastavaRavishankar RavindranFrancois Blouin
    • Saurabh SrivastavaRavishankar RavindranFrancois Blouin
    • G06F15/173
    • H04L41/5038H04L43/12
    • The present invention relates to a system and method for network performance management for monitoring performance of network applications. The system comprises a transmitter for sending one or more types of probe packets to the network, a receiver for receiving the one or more network probe packets from the network and for receiving one or more network application performance queries from one or more network applications, a processor connected to the transmitter and the receiver and operable to process network probe packets received by the receiver to generate network performance statistics for each type of probe packet and to look up the network application performance requirements of the one or more network applications and compare the network application performance requirements with the corresponding network performance statistics to determine whether the network application should access the network. Network performance statistics may be obtained using lean packet probes, using real traffic test streams or obtaining network performance statistics from a service provider. Thus by providing a probe, lookup, feedback methodology, network parameters, or network application requirements, may be adjusted to meet performance requirements of one or more network applications.
    • 本发明涉及网络性能管理系统和方法,用于监控网络应用的性能。 该系统包括用于向网络发送一种或多种类型的探测分组的发射机,用于从网络接收一个或多个网络探测分组并用于从一个或多个网络应用接收一个或多个网络应用性能查询的接收机, 处理器连接到发射机和接收机,可操作以处理由接收机接收的网络探测分组,以生成每种类型的探测分组的网络性能统计信息,并查找一个或多个网络应用的网络应用性能要求,并比较网络 应用性能要求与相应的网络性能统计确定网络应用是否应该访问网络。 可以使用精简分组探测,使用实际流量测试流或从服务提供商获得网络性能统计信息来获得网络性能统计信息。 因此,通过提供探测器,可以调整查找,反馈方法,网络参数或网络应用需求,以满足一个或多个网络应用的性能要求。
    • 7. 发明申请
    • TEMPERATURE COMPENSATED CURRENT REFERENCE CIRCUIT
    • 温度补偿电流基准电路
    • US20110169553A1
    • 2011-07-14
    • US12687849
    • 2010-01-14
    • Sanjay K. WadhwaSaurabh Srivastava
    • Sanjay K. WadhwaSaurabh Srivastava
    • H01L37/00
    • G05F1/463
    • A temperature compensated current reference circuit has a differential amplifier and a first feedback transistor with a gate coupled to the differential amplifier output. The first feedback transistor couples a supply voltage line to an inverting input of the differential amplifier. There is also a second feedback transistor with a gate coupled to the differential amplifier output, which couples the supply voltage line to a non-inverting input of the differential amplifier. A first temperature dependent conductor couples the inverting input to ground. A primary reference resistor and a second temperature dependent conductor are connected in series and couple the non-inverting input to ground. An output current control transistor has a gate and one other electrode coupled together and a third electrode coupled to the supply voltage line. A secondary reference resistor and a conductivity change sensing transistor are connected in series and couple the gate of the output current control transistor to ground. The conductivity change sensing transistor has a gate coupled to the second one of the two differential inputs. There is a temperature compensation current reference output circuit that has a current reference transistor, an input coupled to the differential amplifier output and another input is coupled to the gate of the output current control transistor.
    • 温度补偿电流参考电路具有差分放大器和具有耦合到差分放大器输出的栅极的第一反馈晶体管。 第一反馈晶体管将电源电压线耦合到差分放大器的反相输入端。 还有一个第二反馈晶体管,其栅极耦合到差分放大器输出,其将电源电压线耦合到差分放大器的非反相输入端。 第一温度依赖导体将反相输入端接地。 主参考电阻和第二温度相关导体串联连接,并将非反相输入耦合到地。 输出电流控制晶体管具有耦合在一起的栅极和另一个电极以及耦合到电源电压线的第三电极。 二次参考电阻和电导率变化感测晶体管串联连接,并将输出电流控制晶体管的栅极耦合到地。 电导率变化感测晶体管具有耦合到两个差分输入中的第二个的栅极。 具有温度补偿电流基准输出电路,其具有电流参考晶体管,耦合到差分放大器输出的输入端和另一输入端耦合到输出电流控制晶体管的栅极。