会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明申请
    • USING A HEURISTICALLY-GENERATED POLICY TO DYNAMICALLY SELECT STRING ANALYSIS ALGORITHMS FOR CLIENT QUERIES
    • 使用全景生成策略动态选择客户端查询的分析算法
    • US20130091079A1
    • 2013-04-11
    • US13412121
    • 2012-03-05
    • Marco PistoiaTakaaki TateishiOmer Tripp
    • Marco PistoiaTakaaki TateishiOmer Tripp
    • G06F15/18
    • G06N5/00
    • A method for dynamically selecting string analysis algorithms can begin with the training of the dynamic string analysis handler of a string analysis module to effectively handle a subset of string queries having contextual metadata received from a client application in an instructional environment. The effectiveness of the training module can be based upon feedback from the client application. Upon completion of the training, a string analysis algorithm selection policy can be synthesized. The string analysis algorithm selection policy can correlate a context of a string query in the subset to the usage of a string analysis algorithm. When in the operational environment, the dynamic string analysis handler can dynamically handle string queries having contextual metadata received from the client application in accordance with the string analysis algorithm selection policy. The string analysis algorithm to be used for a string query can be dynamically and independently determined.
    • 用于动态选择字符串分析算法的方法可以开始于字符串分析模块的动态字符串分析处理程序的训练,以有效地处理在教学环境中从客户端应用程序接收的具有上下文元数据的字符串查询的子集。 培训模块的有效性可以基于客户端应用程序的反馈。 完成培训后,可以合成字符串分析算法选择策略。 字符串分析算法选择策略可以将子集中的字符串查询的上下文与字符串分析算法的使用相关联。 在操作环境中,动态字符串分析处理程序可以根据字符串分析算法选择策略来动态地处理具有从客户端应用程序接收的上下文元数据的字符串查询。 用于字符串查询的字符串分析算法可以动态和独立地确定。
    • 5. 发明授权
    • Determining whether method of computer program is a validator
    • 确定计算机程序的方法是否为验证程序
    • US08365281B2
    • 2013-01-29
    • US12950432
    • 2010-11-19
    • Takaaki TateishiMarco PistoiaOmer TrippRyan BergRobert Wiener
    • Takaaki TateishiMarco PistoiaOmer TrippRyan BergRobert Wiener
    • G06F11/00G06F11/30H04L29/06H04L9/32
    • G06F21/50G06F21/563
    • An illegal pattern and a computer program having a method are received. The method has one or more return statements, and a number of basic blocks. The method is normalized so that each return statement of the target method relating to the illegal pattern returns a constant Boolean value. A first path condition and a second path condition for one or more corresponding paths is determined such that one or more corresponding basic blocks return a constant Boolean value of true for the first path condition and a constant Boolean value of false for the second path condition. An unsatisfiability of each path condition is determined using a monadic second-order logic (M2L) technique. Where the unsatisfiability of either path condition is false, the method is reported as not being a validator. Where the unsatisfiability of either path condition is true, the method is reported as being a validator.
    • 接收到具有方法的非法模式和计算机程序。 该方法具有一个或多个返回语句和一些基本块。 该方法被归一化,使得与非法模式相关的目标方法的每个返回语句返回一个常量布尔值。 确定用于一个或多个对应路径的第一路径条件和第二路径条件,使得一个或多个对应的基本块返回针对第一路径条件的常数布尔值为true,对于第二路径条件返回常量布尔值为假。 使用一元二阶逻辑(M2L)技术确定每个路径条件的不满足性。 如果任一路径条件的不满足性为假,则将该方法报告为不是验证器。 如果任一路径条件的不满足性为真,则将该方法报告为验证器。
    • 6. 发明授权
    • Crawling of object model using transformation graph
    • 使用变换图来爬行对象模型
    • US08296722B2
    • 2012-10-23
    • US12246065
    • 2008-10-06
    • Sachiko YoshihamaShinya KawanakaTakaaki TateishiOry SegalAdi SharabaniMarco PistoiaGuy Podjarny
    • Sachiko YoshihamaShinya KawanakaTakaaki TateishiOry SegalAdi SharabaniMarco PistoiaGuy Podjarny
    • G06F9/44
    • G06F8/10
    • A transformation tree for an object model (OM) is defined. The transformation tree has nodes interconnected by edges, where each node is connected to at most one other tree node. Each node corresponds to a state of the OM; each edge corresponds to an event causing the OM to transition from the state of one node to the state of another node. A transformation graph for the OM is constructed by simulating the transformation tree. The transformation graph has nodes interconnected by edges, and is a directed graph in which each node is connected to one or more other nodes. Each node corresponds to a state of the OM; each edge corresponds to an event causing the OM to transition from the state of one node to the state of another node. Crawling-oriented actions are performed in relation to the OM by being performed in relation to the transformation graph.
    • 定义了对象模型(OM)的转换树。 转换树具有通过边缘互连的节点,其中每个节点连接到最多一个其他树节点。 每个节点都对应于OM的状态; 每个边缘对应于导致OM从一个节点的状态转变到另一个节点的状态的事件。 通过模拟转换树构建OM的变换图。 转换图具有通过边缘互连的节点,并且是有向图,其中每个节点连接到一个或多个其他节点。 每个节点对应于OM的状态; 每个边缘对应于导致OM从一个节点的状态转变到另一个节点的状态的事件。 通过相对于变换图执行针对OM执行针对爬行的动作。
    • 8. 发明申请
    • Verification of Information-Flow Downgraders
    • 信息流降级的验证
    • US20120023486A1
    • 2012-01-26
    • US12843308
    • 2010-07-26
    • Yinnon A. HavivRoee HayMarco PistoiaAdi SharabaniTakaaki TateishiOmer TrippOmri Weisman
    • Yinnon A. HavivRoee HayMarco PistoiaAdi SharabaniTakaaki TateishiOmer TrippOmri Weisman
    • G06F9/44
    • G06F21/577H04L63/105
    • A method includes determining grammar for output of an information-flow downgrader in a software program. The software program directs the output of the information-flow downgrader to a sink. The method includes determining whether the grammar of the output conforms to one or more predetermined specifications of the sink. The method includes, in response to a determination the grammar of the output conforms to the one or more predetermined specifications of the sink, determining the information-flow downgrader is verified for the sink, wherein determining grammar, determining whether the grammar, and determining the information-flow downgrader are performed via static analysis of the software program. Apparatus and computer program products are also disclosed. An apparatus includes a user interface providing a result of whether or not output of an information-flow downgrader in the software program conforms to one or more predetermined specifications of a sink in the software program.
    • 一种方法包括在软件程序中确定信息流降级器的输出的语法。 软件程序将信息流降级器的输出引导到宿。 该方法包括确定输出的语法是否符合汇的一个或多个预定规范。 该方法包括响应于确定,输出的语法符合信宿的一个或多个预定规范,确定信宿流降级器对于汇点进行验证,其中确定语法,确定语法,并确定 信息流降级器通过软件程序的静态分析来执行。 还公开了装置和计算机程序产品。 一种装置,包括提供软件程序中的信息流下载器的输出是否符合软件程序中的接收器的一个或多个预定规格的结果的用户界面。
    • 9. 发明授权
    • Using a heuristically-generated policy to dynamically select string analysis algorithms for client queries
    • 使用启发式生成的策略来动态选择客户端查询的字符串分析算法
    • US09092723B2
    • 2015-07-28
    • US13412121
    • 2012-03-05
    • Marco PistoiaTakaaki TateishiOmer Tripp
    • Marco PistoiaTakaaki TateishiOmer Tripp
    • G06N5/00
    • G06N5/00
    • A method for dynamically selecting string analysis algorithms can begin with the training of the dynamic string analysis handler of a string analysis module to effectively handle a subset of string queries having contextual metadata received from a client application in an instructional environment. The effectiveness of the training module can be based upon feedback from the client application. Upon completion of the training, a string analysis algorithm selection policy can be synthesized. The string analysis algorithm selection policy can correlate a context of a string query in the subset to the usage of a string analysis algorithm. When in the operational environment, the dynamic string analysis handler can dynamically handle string queries having contextual metadata received from the client application in accordance with the string analysis algorithm selection policy. The string analysis algorithm to be used for a string query can be dynamically and independently determined.
    • 用于动态选择字符串分析算法的方法可以开始于字符串分析模块的动态字符串分析处理程序的训练,以有效地处理在教学环境中从客户端应用程序接收的具有上下文元数据的字符串查询的子集。 培训模块的有效性可以基于客户端应用程序的反馈。 完成培训后,可以合成字符串分析算法选择策略。 字符串分析算法选择策略可以将子集中的字符串查询的上下文与字符串分析算法的使用相关联。 在操作环境中,动态字符串分析处理程序可以根据字符串分析算法选择策略来动态地处理具有从客户端应用程序接收的上下文元数据的字符串查询。 用于字符串查询的字符串分析算法可以动态和独立地确定。
    • 10. 发明授权
    • Static analysis based on observed string values during execution of a computer-based software application
    • 在基于计算机的软件应用程序执行期间,基于观察到的字符串值的静态分析
    • US08650546B2
    • 2014-02-11
    • US13173012
    • 2011-06-30
    • Marco PistoiaTakaaki TateishiOmer Tripp
    • Marco PistoiaTakaaki TateishiOmer Tripp
    • G06F9/44
    • G06F11/3608
    • Improving static analysis precision by recording a value pointed to by a string variable within the computer-based software application during the execution of a computer-based software application, modeling an invariant based on the recorded value, where the invariant represents at least one possible value pointed to by the string variable, performing a first static analysis of the computer-based software application to determine whether the invariant is valid with respect to the computer-based software application, and seeding a second static analysis of the computer-based software application with the invariant if the invariant is valid with respect to the computer-based software application.
    • 通过在执行基于计算机的软件应用程序期间记录基于计算机的软件应用程序中由字符串变量指向的值来提高静态分析精度,基于记录的值对不变量建模,其中不变量表示至少一个可能的值 由字符串变量指向,对基于计算机的软件应用进行第一静态分析,以确定相对于基于计算机的软件应用是否不变量是否有效;以及将基于计算机的软件应用的第二静态分析与 如果不变式对于基于计算机的软件应用程序是有效的则不变量。