-
1.发明申请ENHANCING FUNCTIONAL TESTS COVERAGE USING TRACEABILITY AND STATIC ANALYSIS 审中-公开使用可追溯性和静态分析增强功能测试覆盖公开(公告)号：US20110271253A1
公开(公告)日：2011-11-03
申请号：US12768764
申请日：2010-04-28
申请人： Jonathan Bnayahu , Maayan Goldstein , Dany Moshkovich , Moti Nisenson , Yahalomit Simionovici , Shmuel Ur
发明人： Jonathan Bnayahu , Maayan Goldstein , Dany Moshkovich , Moti Nisenson , Yahalomit Simionovici , Shmuel Ur
IPC分类号： G06F9/44
CPC分类号： G06F11/3676 , G06F8/10 , G06F8/20 , G06F8/73 , G06F8/75
摘要： A method that may include: building a dependencies graph representing dependencies between code elements of a computer code; associating portions of the computer code with corresponding design specifications or requirements derived from a design specifications document or a requirements document respectively which is associated with the computer code, to yield a design specifications or requirements-code tracing map; and analyzing the design specifications or requirements-code tracing map based on the dependencies graph to yield an ordered list of design specifications or requirements respectively, wherein the order is selected such that functional tests written for the computer code and addressing design specifications or requirements of a higher order, will yield a higher level of functional test coverage of the computer code in terms of design specifications or requirements.
摘要翻译： 可以包括：构建表示计算机代码的代码元素之间的依赖关系的依赖图; 将计算机代码的一部分与分别与计算机代码相关联的设计规范文档或要求文档导出的相应设计规范或要求相关联，以产生设计规范或要求代码跟踪图; 并根据依赖图分析设计规范或要求 - 代码追踪图，以分别产生设计规范或要求的有序列表，其中选择这样的顺序，使得为计算机代码编写的功能测试和寻址设计规范或要求 更高的排序，将在设计规范或要求方面产生更高级别的计算机代码的功能测试覆盖。
-
2.发明申请公开(公告)号：US20110271252A1
公开(公告)日：2011-11-03
申请号：US12768761
申请日：2010-04-28
申请人： Jonathan Bnayahu , Maayan Goldstein , Dany Moshkovich , Moti Nisenson , Yahalomit Simionovici , Shmuel Ur
发明人： Jonathan Bnayahu , Maayan Goldstein , Dany Moshkovich , Moti Nisenson , Yahalomit Simionovici , Shmuel Ur
IPC分类号： G06F9/44
CPC分类号： G06F8/10 , G06F11/3676
摘要： A method that includes: running a set of functional tests over a computer code; determining, for each code element of the computer code, which functional test covered it, to yield a tests-elements coverage map; associating portions of the computer code with corresponding design portions or requirements derived from a design document or a requirements document respectively, associated with the computer code, to yield a design/requirements-code tracing map; deriving, from the tests-code coverage map and the design/requirements-code tracing map, a design/requirements-tests coverage map, exhibiting coverage of the computer code by the functional tests, in terms of the design or the requirements, wherein at least one of the running, the determining, the associating, and the deriving is executed by at least one processor.
摘要翻译： 一种方法，包括：通过计算机代码运行一组功能测试; 确定对于计算机代码的每个代码元素，哪个功能测试涵盖了它，以产生测试元素覆盖图; 将计算机代码的部分与分别与计算机代码相关联的设计文档或需求文档的相应设计部分或要求相关联，以产生设计/要求代码跟踪图; 从测试代码覆盖图和设计/需求代码跟踪图导出设计/需求测试覆盖图，通过功能测试在设计或要求方面展示计算机代码的覆盖范围，其中在 至少一个处理器执行运行，确定，关联和导出中的至少一个。
-
3.发明申请USING TRACEABILITY LINKS STRENGTH FOR SOFTWARE DEVELOPMENT INTEGRITY MONITORING 有权使用可追溯性链接强度软件开发完整性监控公开(公告)号：US20130117725A1
公开(公告)日：2013-05-09
申请号：US13290088
申请日：2011-11-06
IPC分类号： G06F9/44
摘要： A method for monitoring requirements integrity. The method comprises receiving a plurality of requirements for an application development project having a plurality of code elements, computing a first strength for each of a plurality of traceability links each between a certain code element in a current software code version of the application development project and one of the plurality of requirements, computing a second strength for each of said plurality of traceability links in a new software code which includes a revision to the certain code element from said current software version, and generating an inconsistency notification based on a deviation between said second strength and said first strength.
摘要翻译： 一种监控需求完整性的方法。 该方法包括接收对具有多个代码元素的应用开发项目的多个要求，为应用开发项目的当前软件代码版本中的特定代码元素和/或应用开发项目的当前软件代码版本中的每个代码元素计算第一强度， 所述多个要求中的一个要求，为包括对所述当前软件版本的特定代码元素的修订的新的软件代码计算所述多个可跟踪链接中的每一个的第二强度，并且基于所述多个可追溯性链接中的所述 第二力量说第一力量。
-
4.发明授权Using traceability links strength for software development integrity monitoring 有权使用可追溯性链接强大的软件开发完整性监控公开(公告)号：US09292410B2
公开(公告)日：2016-03-22
申请号：US13290088
申请日：2011-11-06
摘要： A computerized method that combines identifying conflicting requirements and monitoring requirements integrity. Traceability link strengths are computed between a code element and a plurality of requirements. Revised traceability link strengths are computed between a revised version of the same code element and the plurality of requirements. The revised traceability link strengths are compared to the pre-existing traceability link strengths and a deviation decreased is identified when the revised traceability link strength is less than the pre-existing traceability link strength. An additional traceability link strength is computed between the revised version of the same code element and a new requirement, the new requirement first appearing with the revised version of the same code element. A conflict between the new requirement and the pre-existing requirements is identified when both a deviation decrease is identified and when additional traceability link strength exceeds a correlation threshold.
摘要翻译： 一种组合识别冲突的要求和监控要求完整性的计算机化方法。 在代码元素和多个需求之间计算可追溯性链接强度。 在相同代码元素的修订版本和多个要求之间计算修改的可追溯性链接强度。 将修改的可追溯性链路优势与先前存在的可追溯性链路优势进行比较，并且当修改的可跟踪链路强度小于先前存在的可追溯性链路强度时，确定偏差减小。 在相同代码元素的修订版本和新要求之间计算附加的可跟踪链接强度，新的要求首先出现在相同代码元素的修订版本中。 当确定了偏差减少和额外的可追溯性链路强度超过相关阈值时，就会识别新要求与预先存在的要求之间的冲突。
-
公开(公告)号：US20110055373A1
公开(公告)日：2011-03-03
申请号：US12550377
申请日：2009-08-30
IPC分类号： G06F3/00 , G06F17/30 , G06F15/173
CPC分类号： G06F16/90335
摘要： A method for identifying computational services performed by one or more computing resources is provided. The method comprises analyzing digital data associated with the computing resources to identify similarities between the digital data; grouping sets of digital data into one or more clusters according to similarities identified between the digital data; and generating a description for the one or more clusters to describe at least one computational service associated with a set of digital data grouped in the one or more clusters.
摘要翻译： 提供了一种用于识别由一个或多个计算资源执行的计算服务的方法。 该方法包括分析与计算资源相关联的数字数据，以识别数字数据之间的相似性; 根据数字数据之间识别的相似性将数字数据集合分组成一个或多个集群; 以及生成用于所述一个或多个聚类的描述，以描述与在所述一个或多个聚类中分组的一组数字数据相关联的至少一个计算服务。
-
公开(公告)号：US08468512B2
公开(公告)日：2013-06-18
申请号：US12609142
申请日：2009-10-30
CPC分类号： G06F8/74 , G06F8/34 , G06F8/433 , G06F9/45516
摘要： A method that includes: obtaining a computer code usable to process insurance claims; building a computer readable directed graph representing a control flow of the code, by identifying decisions and actions in the code, the graph comprising nodes connected by edges, some of the nodes being decision nodes associated with the decisions and some of the nodes being action nodes associated with the actions; determining, on the graph, benefit action nodes that are each associated with at least one monetary outcome of a specified insurance claim; identifying all logic paths that lead to each benefit action node by traversing the graph from each benefit action node backwards, each logic path comprising a sequence of preceding decision nodes and action nodes connected by edges, each set of paths being associated with a specified benefit action node representing a benefit rule; and outputting all benefit rules by presenting each specified benefit action vis à vis grouped logic paths associated with the specified benefit action.
摘要翻译： 一种方法，包括：获得可用于处理保险索赔的计算机代码; 通过识别代码中的决策和动作来构建代表代码的控制流的计算机可读有向图，该图包括由边缘连接的节点，一些节点是与决策相关联的决策节点，并且一些节点是动作节点 与行动有关; 在图上确定每个与指定的保险索赔的至少一个货币结果相关联的行动节点的受益; 通过从每个受益动作节点向后遍历图来识别导致每个受益动作节点的所有逻辑路径，每个逻辑路径包括由边缘连接的先前决策节点和动作节点的序列，每组路径与指定的益处动作相关联 代表利益规则的节点; 并通过向与指定的利益行动相关的分组逻辑路径呈现每个指定的利益行动来输出所有利益规则。
-
公开(公告)号：US20110107315A1
公开(公告)日：2011-05-05
申请号：US12609142
申请日：2009-10-30
IPC分类号： G06F9/45
CPC分类号： G06F8/74 , G06F8/34 , G06F8/433 , G06F9/45516
摘要： A method that includes: obtaining a computer code usable to process insurance claims; building a computer readable directed graph representing a control flow of the code, by identifying decisions and actions in the code, the graph comprising nodes connected by edges, some of the nodes being decision nodes associated with the decisions and some of the nodes being action nodes associated with the actions; determining, on the graph, benefit action nodes that are each associated with at least one monetary outcome of a specified insurance claim; identifying all logic paths that lead to each benefit action node by traversing the graph from each benefit action node backwards, each logic path comprising a sequence of preceding decision nodes and action nodes connected by edges, each set of paths being associated with a specified benefit action node representing a benefit rule; and outputting all benefit rules by presenting each specified benefit action vis à vis grouped logic paths associated with the specified benefit action.
摘要翻译： 一种方法，包括：获得可用于处理保险索赔的计算机代码; 通过识别代码中的决策和动作来构建代表代码的控制流的计算机可读有向图，该图包括由边缘连接的节点，一些节点是与决策相关联的决策节点，并且一些节点是动作节点 与行动有关; 在图上确定每个与指定的保险索赔的至少一个货币结果相关联的行动节点的受益; 通过从每个受益动作节点向后遍历图来识别导致每个受益动作节点的所有逻辑路径，每个逻辑路径包括由边缘连接的先前决策节点和动作节点的序列，每组路径与指定的益处动作相关联 代表利益规则的节点; 并通过向与指定的利益行动相关的分组逻辑路径呈现每个指定的利益行动来输出所有利益规则。
-
公开(公告)号：US08612954B2
公开(公告)日：2013-12-17
申请号：US12541983
申请日：2009-08-17
申请人： Aharon Abadi , Ran Ettinger , Yishai Fieldman , Jonathan Bnayahu
发明人： Aharon Abadi , Ran Ettinger , Yishai Fieldman , Jonathan Bnayahu
IPC分类号： G06F9/45
CPC分类号： G06F8/433 , G06F11/3604
摘要： A method for generating a fine slice for a program is provided. The method comprises receiving a set of slicing criteria, wherein the set of slicing criteria comprises one or more variable occurrences or control dependences; receiving a set of cut points, wherein the set of cut points comprises one or more variable occurrences or control dependences; and generating a slice according to the set of slicing criteria and the set of cut points. The generated slice includes statements related to computation of values for the set of slicing criteria and excludes statements related to computation of values for the set of cut points. Missing information is added to the slice so that the slice is executable.
摘要翻译： 提供了一种用于为程序生成精细切片的方法。 所述方法包括接收一组切片标准，其中所述切片标准集包括一个或多个可变出现或控制依赖性; 接收一组切割点，其中所述切割点集合包括一个或多个可变事件或控制依赖性; 以及根据切片标准和切割点集合生成切片。 生成的切片包括与计算切片标准集合的值相关的语句，并排除与该切割点集合的值的计算相关的语句。 将缺少的信息添加到切片中，以使切片可执行。
-
9.发明申请DETERMINING SUITABLE INSERTION POINTS FOR STRING SANITIZERS IN A COMPUTER CODE 失效确定适用于计算机代码中的“圣诞老人”的插入点公开(公告)号：US20120304161A1
公开(公告)日：2012-11-29
申请号：US13113097
申请日：2011-05-23
申请人： Aharon Ahadi , Jonathan Bnayahu , Ran Ettinger , Yishai Abraham Feldman , Yinnon Avraham Haviv , Adi Sharabani
发明人： Aharon Ahadi , Jonathan Bnayahu , Ran Ettinger , Yishai Abraham Feldman , Yinnon Avraham Haviv , Adi Sharabani
IPC分类号： G06F9/45
CPC分类号： G06F8/433 , G06F21/12 , G06F2221/031 , G06F2221/033
摘要： A method of determining suitable insertion points for inserting string sanitizers in a computer code is provided herein. The method includes the following stages: obtaining: (i) a computer code associated with a data flow of externally supplied data, from one or more sources to one or more sinks, (ii) locations of the sources, and (iii) locations of the sinks; building a graph representing control paths, data paths and semantic relationships between the control paths and the data paths of the computer code; associating all tainted data paths on the graph, being data paths that go from sources to sinks and do not include a sanitizer; and determining, on the tainted data paths, potential control paths suitable for sanitizer insertion.
摘要翻译： 本文提供了一种在计算机代码中确定用于插入消毒器的合适插入点的方法。 该方法包括以下阶段：获得：（i）与外部提供的数据的数据流相关联的计算机代码，从一个或多个源到一个或多个汇点，（ii）源的位置，以及（iii） 水槽 构建表示控制路径和计算机代码的数据路径之间的控制路径，数据路径和语义关系的图; 将图中的所有污点数据路径相关联，即从源到汇的数据路径，不包括消毒剂; 并且在污染的数据路径上确定适于消毒剂插入的潜在控制路径。
-
10.发明授权公开(公告)号：US08621430B2
公开(公告)日：2013-12-31
申请号：US13039342
申请日：2011-03-03
IPC分类号： G06F9/44
CPC分类号： G06F8/72
摘要： A method of code transformation supporting temporal abstraction of parameters is provided herein. The method includes the following stages: extracting a set of statements from an original code and further creating a residual code being the original code without the statements, wherein two or more of the extracted statements are not on a same loop in the original code; adding conditions from the original code to the extracted set of statements, such that the added conditions are sufficient to render the set of statements executable; adding statements from the original code to the residual code, such that the added statements are sufficient to render the residual code executable; and adding code portions and variables to the set of statements and the residual code, such that a passing of values between the enhanced set of statements and the residual code maintains a respective passing of values in the original code.
摘要翻译： 本文提供了支持参数时间抽取的代码转换方法。 该方法包括以下步骤：从原始代码中提取一组语句，并进一步创建一个没有语句的原始代码的残差代码，其中两个或多个提取的语句不在原始代码中的同一个循环中; 从原始代码添加到提取的语句集合的条件，使得添加的条件足以使该组语句可执行; 将原始代码中的语句添加到剩余代码，使得添加的语句足以使剩余代码可执行; 以及将代码部分和变量添加到所述语句集合和所述残余代码中，使得所述增强语句集合与所述残余代码之间的值的传递维持原始代码中的值的相应传递。
-
-
-
-
-
-
-
-
-
搜索结果
24 条记录 (耗时 0.024 秒)
