-
公开(公告)号：US20050216508A1
公开(公告)日：2005-09-29
申请号：US10809171
申请日：2004-03-25
CPC分类号： G06F9/4493
摘要： The present invention provides systems and methods that isomorphically maps constructs between domain spaces (e.g., object, markup, relational and user interface domains). The systems and methods employ a mapping component that utilizes at least one suppress label(s), introduce label(s) and/or mediating schema to facilitate construct mapping. Examples of such mapping include transforming a named construct to an anonymous construct, a named construct to a named construct, an anonymous construct to a named construct, and an anonymous construct to an anonymous construct. In general, introduce labels can be utilized to provide names for anonymous constructs and/or modify existing names; suppress labels typically are utilized to suppress names such as introduced names or names a user desires to be suppressed; and mediating schema can be utilized to provide a default or user customized mapping to an intermediate schema before, during and/or after construct mapping.
摘要翻译： 本发明提供了在域空间（例如，对象，标记，关系和用户界面域）之间同构地映射构造的系统和方法。 系统和方法使用利用至少一个抑制标签，引入标签和/或中介模式以便于构建映射的映射组件。 这种映射的示例包括将命名结构转换为匿名结构，命名结构到命名结构，命名结构的匿名结构以及匿名构造的匿名结构。 通常，引入标签可以用于为匿名构造提供名称和/或修改现有名称; 抑制标签通常用于抑制用户希望被抑制的名称，例如引入的名称或名称; 并且可以使用中介模式来在构造映射之前，期间和/或之后提供对中间模式的默认或用户定制映射。
-
公开(公告)号：US08468505B2
公开(公告)日：2013-06-18
申请号：US12551345
申请日：2009-08-31
IPC分类号： G06F9/45
CPC分类号： G06F9/463
摘要： A state component saves a present state of a program or model. This state component can be invoked by the program or model itself, thereby making state a first-class citizen. As the state of the program evolves from the saved state, the saved state remains for reflection and recall, for example, for testing, verification, transaction processing, etc. Using a state reference token, the saved state of the program or model can be accessed by the program or model. For example, the program or model by utilizing a state component, can return itself to the saved state. After returning to the saved state, a second execution path can be introduced without requiring re-execution of the actions leading to the saved state. In another example, the state space of an executing model is saved in order to generate inputs required to exercise a program or model.
-
公开(公告)号：US08387021B2
公开(公告)日：2013-02-26
申请号：US12239526
申请日：2008-09-26
申请人： Dries Vanoverberghe , Nikolai Tillmann , Jonathan Paul de Halleux , Nikolaj S Bjorner , Wolfram Schulte
发明人： Dries Vanoverberghe , Nikolai Tillmann , Jonathan Paul de Halleux , Nikolaj S Bjorner , Wolfram Schulte
IPC分类号： G06F9/44
CPC分类号： G06F11/3612 , G06F11/3684 , G06F11/3692
摘要： An extension of symbolic execution for programs involving contracts with quantifiers over large and potentially unbounded domains is described. Symbolic execution is used to generate, from a program, concrete test cases that exhibit mismatches between the program code and its contracts with quantifiers. Quantifiers are instantiated using symbolic values encountered during a set of exhibited runs. In this setting, quantifier instantiation is limited to values supplied to or produced by a symbolic execution. Quantifier instantiation is controlled by performing a matching algorithm that uses run-time values of input and program variables in order to guide and limit the set of quantifier instantiations. With a sufficient set of instances, test cases are derived that directly witness limitations of the auxiliary assertions.
摘要翻译： 描述了涉及与大型和潜在无界域上的量词相关联的程序的符号执行的扩展。 符号执行用于从程序生成具有程序代码与其与量词的合同之间不匹配的具体测试用例。 使用在一组展示的运行中遇到的符号值来实例化量词。 在此设置中，量化器实例化被限制为提供给或由符号执行产生的值。 量化器实例化是通过执行使用输入和程序变量的运行时值的匹配算法来控制的，以引导和限制一组量词实例。 使用足够的一组实例，导出直接看到辅助断言的限制的测试用例。
-
公开(公告)号：US20110302550A1
公开(公告)日：2011-12-08
申请号：US12795669
申请日：2010-06-08
IPC分类号： G06F9/44
CPC分类号： G06F17/5045 , G06F2217/08
摘要： A design space exploration (DSE) system automatically discovers viable solutions within a design space. The DSE system operates by creating or receiving a design specification that is described using a design language. The design specification contains a collection of constraints that an acceptable architecture is expected to satisfy. The DSE system then symbolically executes the design specification to provide a logical formula. The DSE system then interacts with a theorem prover module to identify one or more solutions to the formula. Finally, the DSE system converts the solutions into a user-interpretable form (e.g., expressed in the format of the modeling language) for viewing by a user. Each solution pertains to an architecture that satisfies the collection of constraints. The DSE system ensures that the solutions are diverse by disfavoring any solution that is deemed similar to any solution that has been previously encountered.
摘要翻译： 设计空间探索（DSE）系统在设计空间内自动发现可行的解决方案。 DSE系统通过创建或接收使用设计语言描述的设计规范进行操作。 设计规范包含可接受架构预期满足的约束集合。 DSE系统然后象征性地执行设计规范以提供逻辑公式。 然后，DSE系统与定理证明器模块进行交互，以识别公式的一个或多个解决方案。 最后，DSE系统将解决方案转换成用户可解释的形式（例如，以建模语言的格式表示），以供用户观看。 每个解决方案都涉及满足约束集合的体系结构。 DSE系统确保解决方案是多样的，因为不满意任何与以前遇到过的解决方案相似的解决方案。
-
公开(公告)号：US07747985B2
公开(公告)日：2010-06-29
申请号：US11085624
申请日：2005-03-18
申请人： Colin L. Campbell , Lev Borisovich Nachmanson , Margus Veanes , Michael Barnett , Nikolai Tillmann , Wolfgang Grieskamp , Wolfram Schulte
发明人： Colin L. Campbell , Lev Borisovich Nachmanson , Margus Veanes , Michael Barnett , Nikolai Tillmann , Wolfgang Grieskamp , Wolfram Schulte
IPC分类号： G06F9/44
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.
摘要翻译： 描述了用于测试多线程或分布式软件系统的技术和工具。 例如，多线程系统被检测和执行以产生由其每个代理执行的事件的日志。 代理日志包含每个代理的完全有序的事件序列，以及有关访问代理之间共享的资源的信息。 利用该信息，描述所有代理执行的事件的部分排序用于执行。 代理日志然后被复用到一个或多个序列化的事件顺序中，然后可以将其与在一致性测试引擎中的系统的规范进行比较。
-
公开(公告)号：US07661096B2
公开(公告)日：2010-02-09
申请号：US11045705
申请日：2005-01-28
IPC分类号： G06F9/45
CPC分类号： G06F9/4484
摘要： The subject invention pertains to systems and methods for iterating over or otherwise traversing a collection of objects or elements. More specifically, mechanisms are provided for handling both conventional non-nested streams such as enumeratables as well as nested streams. Nested streams provide a more efficient mechanism for traversing certain objects such as recursive generators. One problem with nested streams is that they need to be flattened or simplified. Techniques are provided herein to allow such streams to be flattened quickly and efficiently. Moreover, systems and methods are disclosed to preserve backward compatibility of optimized nested stream processing with conventional non-nested streams.
摘要翻译： 本发明涉及用于迭代或以其他方式遍历对象或元素的集合的系统和方法。 更具体地，提供了用于处理常规非嵌套流（诸如可枚举性）以及嵌套流的机制。 嵌套流为遍历某些对象（如递归生成器）提供了更有效的机制。 嵌套流的一个问题是它们需要被压缩或简化。 本文提供了技术以允许这样的流被快速和有效地平坦化。 此外，公开了系统和方法以保持优化的嵌套流处理与常规非嵌套流的向后兼容性。
-
公开(公告)号：US07363202B2
公开(公告)日：2008-04-22
申请号：US11040187
申请日：2005-01-20
申请人： Colin L. Campbell , Lev Borisovich Nachmanson , Margus Veanes , Wolfgang Grieskamp , Wolfram Schulte , Nikolai Tillmann
发明人： Colin L. Campbell , Lev Borisovich 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.
摘要翻译： 探索算法与从运行定义被测软件系统的预测行为的抽象状态机生成测试用例的工业实践相关。 这里，新的探索算法允许多个状态分组同时引导搜索对于测试有趣或相关的状态。 在某些情况下，该算法允许探索从指数线性复杂度进行优化。 包括一个扩展示例，说明了算法的使用。
-
公开(公告)号：US20070168927A1
公开(公告)日：2007-07-19
申请号：US11322781
申请日：2005-12-30
申请人： Colin Campbell , Margus Veanes , Nicolas Kicillof , Nikolai Tillmann , Wolfgang Grieskamp , Wolfram Schulte
发明人： Colin Campbell , Margus Veanes , Nicolas Kicillof , Nikolai Tillmann , Wolfgang Grieskamp , Wolfram Schulte
IPC分类号： G06F9/44
CPC分类号： G06F8/10 , G06F11/3672
摘要： A model composition environment can allow for description of fill or partial symbolic system behavior, as well as the combination of models of specific features into compound models. Compositional operators can include intersection, concatenation, substitution, alternating refinement, as well as a set of regular expression-like operators. Models called “action machines” can represent object-oriented, reactive programs, and an action machine may be composed with another action machine using a compositional operator. This can allow for testing of particular scenarios or behaviors.
摘要翻译： 模型组合环境可以允许对填充或部分符号系统行为的描述，以及将特定特征的模型组合到复合模型中。 组合运算符可以包括交集，连接，替换，交替细化，以及一组正则表达式运算符。 称为“动作机器”的模型可以表示面向对象的，反应性的程序，并且动作机器可以由使用组合操作符的另一动作机构组成。 这可以允许测试特定的场景或行为。
-
公开(公告)号：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
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.
摘要翻译： 探索算法与从运行定义被测软件系统的预测行为的抽象状态机生成测试用例的工业实践相关。 这里，新的探索算法允许多个状态分组同时引导搜索对于测试有趣或相关的状态。 在某些情况下，该算法允许探索从指数线性复杂度进行优化。 包括一个扩展示例，说明了算法的使用。
-
-
-
-
-
-
-
-
-
搜索结果
76 条记录 (耗时 0.043 秒)
