公开(公告)号：US20060212759A1

公开(公告)日：2006-09-21

申请号：US11085624

申请日：2005-03-18

申请人： Colin Campbell ,  Lev Nachmanson ,  Margus Veanes ,  Michael Barnett ,  Nikolai Tillmann ,  Wolfgang Grieskamp ,  Wolfram Schulte

发明人： Colin Campbell ,  Lev Nachmanson ,  Margus Veanes ,  Michael Barnett ,  Nikolai Tillmann ,  Wolfgang Grieskamp ,  Wolfram Schulte

IPC分类号： G06F11/00

CPC分类号： G06F11/36

摘要： Techniques and tools for testing multi-threaded or distributed software systems are described. For example, a multi-threaded system is instrumented and executed to produce logs of events that are performed by each of its agents. The agent logs contain a totally ordered series of events per agent, as well as information about accesses to resources shared between the agents. With this information, a partial ordering of the events performed by all the agents is described for the execution. The agent logs are then multiplexed into one or more serialized event orderings, which can then be compared to a specification of the system in a conformance testing engine.

摘要翻译： 描述了用于测试多线程或分布式软件系统的技术和工具。 例如，多线程系统被检测和执行以产生由其每个代理执行的事件的日志。 代理日志包含每个代理的完全有序的事件序列，以及有关访问代理之间共享的资源的信息。 利用该信息，描述所有代理执行的事件的部分排序用于执行。 代理日志然后被复用到一个或多个序列化的事件顺序中，然后可以将其与在一致性测试引擎中的系统的规范进行比较。

公开(公告)号：US20060179383A1

公开(公告)日：2006-08-10

申请号：US11041087

申请日：2005-01-21

申请人： Andreas Blass ,  Colin Campbell ,  Lev Nachmanson ,  Margus Veanes ,  Michael Barnett ,  Nikolai Tillmann ,  Wolfgang Grieskamp ,  Wolfram Schulte ,  Yuri Gurevich

发明人： Andreas Blass ,  Colin Campbell ,  Lev Nachmanson ,  Margus Veanes ,  Michael Barnett ,  Nikolai Tillmann ,  Wolfgang Grieskamp ,  Wolfram Schulte ,  Yuri Gurevich

IPC分类号： G01R31/28 ,  G06F11/00

CPC分类号： G06F11/263

摘要： State spaces are traversed to produce test cases, or test coverage. Test coverage is a test suite of sequences. Accepting states are defined. Expected costs are assigned to the test graph states. Strategies are created providing transitions to states with lower expected costs. Linear programs and other approximations are discussed for providing expected costs. Strategies are more likely to provide access to an accepting state, based on expected costs. Strategies are used to append transitions to test segments such that the new test segment ends in an accepting state.

公开(公告)号：US20060161404A1

公开(公告)日：2006-07-20

申请号：US11040187

申请日：2005-01-20

申请人： Colin Campbell ,  Lev Nachmanson ,  Margus Veanes ,  Wolfgang Grieskamp ,  Wolfram Schulte ,  Nikolai Tillmann

发明人： Colin Campbell ,  Lev Nachmanson ,  Margus Veanes ,  Wolfgang Grieskamp ,  Wolfram Schulte ,  Nikolai Tillmann

IPC分类号： G06F17/10

CPC分类号： G06F11/3688

摘要： Exploration algorithms are relevant to the industrial practice of generating test cases from an abstract state machine whose runs define the predicted behavior of the software system under test. Here, a new exploration algorithm allows multiple state groupings to simultaneously guide the search for states that are interesting or relevant for testing. In some cases, the algorithm allows exploration to be optimized from exponential to linear complexity. An extended example is included that illustrates the use of the algorithm.

摘要翻译： 探索算法与从运行定义被测软件系统的预测行为的抽象状态机生成测试用例的工业实践相关。 这里，新的探索算法允许多个状态分组同时引导搜索对于测试有趣或相关的状态。 在某些情况下，该算法允许探索从指数线性复杂度进行优化。 包括一个扩展示例，说明了算法的使用。

公开(公告)号：US20060242466A1

公开(公告)日：2006-10-26

申请号：US11112282

申请日：2005-04-21

申请人： Nikolai Tillmann ,  Colin Campbell ,  Wolfgang Grieskamp ,  Lev Nachmanson ,  Wolfram Schulte ,  Margus Veanes

发明人： Nikolai Tillmann ,  Colin Campbell ,  Wolfgang Grieskamp ,  Lev Nachmanson ,  Wolfram Schulte ,  Margus Veanes

IPC分类号： G06F11/00

CPC分类号： G06F11/3684

摘要： Techniques and tools for generating test cases for methods or programs with input preconditions are described. For example, after finding feasible control flow paths for a tested method along with each path's associated input conditions, a new program is created which tests these conditions along with the precondition. By analyzing this new program's control flow graph, a class of test cases is found while avoiding inefficiencies created by doing complete searches of paths through the combined control flow graph of the precondition and the method. Additional efficiencies are introduced by partitioning a control flow graph for the precondition into branched and straight sections.

摘要翻译： 描述用于为具有输入前提条件的方法或程序生成测试用例的技术和工具。 例如，在为每个路径的相关输入条件找到可行的控制流路之后，创建一个与前提条件一起测试这些条件的新程序。 通过分析这个新程序的控制流图，发现了一类测试用例，同时避免了通过前提条件和方法的组合控制流程图完成对路径的搜索而产生的低效率。 通过将前提条件的控制流程图划分为分支和直线部分来引入额外的效率。

公开(公告)号：US20060224924A1

公开(公告)日：2006-10-05

申请号：US11097684

申请日：2005-03-31

申请人： Wolfgang Grieskamp ,  Colin Campbell ,  Lev Nachmanson ,  Margus Veanes ,  Michael Barnett ,  Nikolai Tillmann ,  Wolfram Schulte

发明人： Wolfgang Grieskamp ,  Colin Campbell ,  Lev Nachmanson ,  Margus Veanes ,  Michael Barnett ,  Nikolai Tillmann ,  Wolfram Schulte

IPC分类号： G06F11/00

CPC分类号： G06F11/3672

摘要： Techniques and tools for generating finite state machines (“FSMs”) for a software system with asynchronous callbacks are described. For example, method invocations in a model of the software system are partitioned into observable and controlled method invocations. The controlled method invocations are those which can be run from a test harness while the observed method invocations are those which are observed asynchronously as they are invoked in the system. An FSM is created with observation and control nodes such that observable transitions are found from observation nodes and controlled transitions are found from control nodes. If a state of the model contains both controlled and observable invocations, a timeout transition is added to the FSM to give an implementation time to come up with an observed method invocation before continuing to controlled invocations.

公开(公告)号：US20050160404A1

公开(公告)日：2005-07-21

申请号：US10758797

申请日：2004-01-15

申请人： Lev Nachmanson ,  Margus Veanes ,  Wolfgang Grieskamp ,  Nikolai Tillmann

发明人： Lev Nachmanson ,  Margus Veanes ,  Wolfgang Grieskamp ,  Nikolai Tillmann

IPC分类号： G06F9/44

CPC分类号： G06F11/3676

摘要： A computerized method creates test coverage for non-deterministic programs. The method receives a graph of edges and states representing a program under test, and creates a continuous cycle of edges that reaches each edge in the graph at least once. In one example, the method splits the continuous cycle into discrete sequences that end at edges reaching non-deterministic nodes in the graph, and verifies that the executing program conforms to the behavior represented by the discrete sequences. In another example, a method creates probabilistic strategies for reaching one or more vertices in a non-deterministic graph. The strategies provide a graph path with a high probability of reaching a desired vertex.

摘要翻译： 计算机化方法为非确定性程序创建测试覆盖。 该方法接收表示正在测试的程序的边和图的图形，并创建一个到图形中每个边缘的连续循环周期至少一次。 在一个示例中，该方法将连续循环分解成在图中到达非确定性节点的边缘处的离散序列，并验证执行程序是否符合由离散序列表示的行为。 在另一示例中，一种方法创建用于在非确定性图中达到一个或多个顶点的概率策略。 该策略提供了具有达到所需顶点的高概率的图形路径。

公开(公告)号：US20050086633A1

公开(公告)日：2005-04-21

申请号：US10687099

申请日：2003-10-15

申请人： Lev Nachmanson ,  Margus Veanes

发明人： Lev Nachmanson ,  Margus Veanes

IPC分类号： G06F9/44

CPC分类号： G06F11/3664 ,  G06F8/71

摘要： The technologies allow a digital content developer to define, and a user to switch between or select, various versions of digital content for purposes of displaying, rendering, improving, or testing digital content. For example, a source code developer inserts identifiers in source code, and a source code layer viewer displays code segment choices defined by the identifiers. A user (e.g., the developer or others) selects code segments for inclusion in a source code version. The technology is also useful for providing versions of media content such as audio, video, DVD, images, text, etc.

摘要翻译： 这些技术允许数字内容开发者定义和用户在数字内容的各种版本之间进行切换或选择，以便显示，呈现，改进或测试数字内容。 例如，源代码开发人员在源代码中插入标识符，源代码层查看器显示由标识符定义的代码段选项。 用户（例如，开发者或其他人）选择用于包含在源代码版本中的代码段。 该技术对于提供诸如音频，视频，DVD，图像，文本等的媒体内容的版本也是有用的。

公开(公告)号：US07932907B2

公开(公告)日：2011-04-26

申请号：US11751610

申请日：2007-05-21

申请人： Lev Nachmanson ,  George Robertson ,  Bongshin Lee

发明人： Lev Nachmanson ,  George Robertson ,  Bongshin Lee

IPC分类号： G09G5/00 ,  G06F17/00 ,  G06F3/048

CPC分类号： G06T11/206 ,  G09G2340/0407 ,  G09G2340/0442 ,  G09G2340/0464

摘要： A graph layout technique that creates a layered graph layout with a given aspect ratio. The present layered graph layout technique better utilizes the available space and, at the same time, creates an aesthetically pleasing drawing of a directed graph. In one embodiment it determines the layout of the new graph based on a modified Sugiyama technique combined with a modified Coffman-Graham scheduling algorithm. Given a directed graph and a desired aspect ratio, it uses a binary search and the Coffman-Graham scheduling algorithm to find a layout of the graph that has an aspect ratio that matches the given aspect ratio of the available space.

摘要翻译： 创建具有给定宽高比的分层图形布局的图形布局技术。 现有的分层图布局技术更好地利用了可用的空间，并且同时创建了一种美观的有向图的绘图。 在一个实施例中，它基于与修改的柯夫曼 - 格雷厄姆调度算法相结合的修改的Sugiyama技术来确定新图的布局。 给定有向图和期望的宽高比，它使用二分搜索和Coffman-Graham调度算法来找到具有与可用空间的给定宽高比匹配的纵横比的图的布局。

公开(公告)号：US20110307838A1

公开(公告)日：2011-12-15

申请号：US12814510

申请日：2010-06-14

申请人： Timothy G. Dwyer ,  Lev Nachmanson

发明人： Timothy G. Dwyer ,  Lev Nachmanson

IPC分类号： G06F3/048

CPC分类号： G06T11/206

摘要： An edge routing system is described herein that uses a spatial decomposition to achieve faster routing, and more quickly generates a sparse visibility graph using a cone spanner. The system provides two approaches that can be used separately or in combination to achieve faster—and hence more scalable and more interactive—edge routing using approximate shortest paths. The first approach uses a spatial decomposition of the nodes in a graph, moving them slightly to obtain strictly disjoint convex hulls around groups of nodes, and then computing visibility graphs over these composite hulls rather than individual nodes. The second approach generates a sparse visibility-graph spanner to accelerate the process of producing the visibility graph. The system allows high quality obstacle avoiding edge routing for large diagrams in interactive diagramming applications where very fast refreshes of routing are used with many nodes moving at the same time.

摘要翻译： 本文描述了使用空间分解来实现更快路由的边缘路由系统，并且更快地使用锥形扳手生成稀疏可见度图。 该系统提供了两种方法，可以单独使用或组合使用，以使用近似最短路径实现更快且更可扩展和更具交互性的边缘路由。 第一种方法使用图中节点的空间分解，稍微移动它们以在节点组周围获得严格不相交的凸包，然后计算这些复合船体而不是单个节点的可见性图。 第二种方法产生稀疏可见度图扳手，以加速生产可见度图的过程。 该系统允许在交互式图表应用中的大图的高质量障碍物避免边缘路由，其中​​使用非常快速的路由刷新与许多节点同时移动。

公开(公告)号：US08543944B2

公开(公告)日：2013-09-24

申请号：US12814510

申请日：2010-06-14

申请人： Timothy G. Dwyer ,  Lev Nachmanson

发明人： Timothy G. Dwyer ,  Lev Nachmanson

IPC分类号： G06F3/048

CPC分类号： G06T11/206

摘要： An edge routing system is described herein that uses a spatial decomposition to achieve faster routing, and more quickly generates a sparse visibility graph using a cone spanner. The system provides two approaches that can be used separately or in combination to achieve faster—and hence more scalable and more interactive—edge routing using approximate shortest paths. The first approach uses a spatial decomposition of the nodes in a graph, moving them slightly to obtain strictly disjoint convex hulls around groups of nodes, and then computing visibility graphs over these composite hulls rather than individual nodes. The second approach generates a sparse visibility-graph spanner to accelerate the process of producing the visibility graph. The system allows high quality obstacle avoiding edge routing for large diagrams in interactive diagramming applications where very fast refreshes of routing are used with many nodes moving at the same time.

摘要翻译： 本文描述了使用空间分解来实现更快路由的边缘路由系统，并且更快地使用锥形扳手生成稀疏可见度图。 该系统提供了两种方法，可以单独使用或组合使用，以使用近似最短路径实现更快且更可扩展和更具交互性的边缘路由。 第一种方法使用图中节点的空间分解，稍微移动它们以在节点组周围获得严格不相交的凸包，然后计算这些复合船体而不是单个节点的可见性图。 第二种方法产生稀疏可见度图扳手，以加速生产可见度图的过程。 该系统允许在交互式图表应用中的大图的高质量障碍物避免边缘路由，其中​​使用非常快速的路由刷新与许多节点同时移动。