专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20120151592A1 STRING OPERATIONS WITH TRANSDUCERS 审中-公开
标题翻译：带传感器的STRING操作
公开(公告)号：US20120151592A1
公开(公告)日：2012-06-14
申请号：US12965930
申请日：2010-12-13
申请人： Margus Veanes , Pieter Hooimeijer , Benjamin Livshits , Prateek Saxena , David Molnar
发明人： Margus Veanes , Pieter Hooimeijer , Benjamin Livshits , Prateek Saxena , David Molnar
IPC分类号： G06F11/00
CPC分类号： G06F21/51
摘要： There is provided a computer-implemented method for analyzing string-manipulating programs. An exemplary method comprises describing a string-manipulating program as a finite state transducer. The finite state transducer may be evaluated with a constraint solving methodology to determine whether a particular string may be provided as output by the string-manipulating program. The constraint solving methodology may involve the use of one or more satisfiability modulo theories (SMT) solvers. A determination may be made regarding whether the string-manipulating program may contain a potential security risk depending on whether the particular string may be provided as output by the string-manipulating program.
摘要翻译：提供了一种用于分析字符串操作程序的计算机实现的方法。一种示例性的方法包括将字符串操作程序描述为有限状态传感器。可以用约束求解方法来评估有限状态传感器，以确定特定的串可以被提供为字符串操作程序的输出。约束求解方法可能涉及使用一个或多个可满足性模理论（SMT）求解器。可以确定字符串操纵程序是否可能包含潜在的安全风险，这取决于特定字符串是否可以通过字符串操作程序提供为输出。

2. 发明授权

US07149678B2 High level executable network abstract machine 失效
公开(公告)号：US07149678B2
公开(公告)日：2006-12-12
申请号：US10112319
申请日：2002-03-28
申请人： Yuri Gurevich , Margus Veanes , Uwe Glässer
发明人： Yuri Gurevich , Margus Veanes , Uwe Glässer
IPC分类号： G06F9/455 , G06F15/16
CPC分类号： G06F17/5009 , B33Y50/00 , G06F2217/06 , H04L41/145
摘要： A generic algorithm for simulating communications software in the network environment, based on the model of plural Abstract State Machines (ASMs) is discussed. Other properties and behaviors can supplement the generic case, for example, network topology, delaying behaviors, message transport reliability, and message priority. Plural executing agents, each a sequential abstract state machine, are combined to simulate the behavior of a dynamic network environment. Agent and message behavior is altered based on the proposed or selected network under simulation. The desired behaviors and constraints are coded, compiled, and executed using an executable abstract state machine language.

3. 发明申请

US20050086633A1 Content layers 有权
标题翻译：内容层
公开(公告)号：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，图像，文本等的媒体内容的版本也是有用的。

4. 发明授权

US08515891B2 Symbolic finite automata 有权
标题翻译：符号有限自动机
公开(公告)号：US08515891B2
公开(公告)日：2013-08-20
申请号：US12950586
申请日：2010-11-19
申请人： Margus Veanes , Jonathan Paul de Halleux , Nikolai Tillmann
发明人： Margus Veanes , Jonathan Paul de Halleux , Nikolai Tillmann
IPC分类号： G06F17/00 , G06N5/02
CPC分类号： G06F11/3684 , G06F11/3608
摘要： Described are symbolic finite automata for symbolically expressing and analyzing regular expression constraints, such as for use in program analysis and testing. A regular expression or pattern is transformed into a symbolic finite automaton having transitions that are labeled by formulas that denote sets of characters (rather than individual characters). Also described is composing two or more symbolic finite automata into a resulting symbolic finite automaton that is fully satisfiable. A constraint solver may be used to ensure satisfiability.
摘要翻译：描述了象征性的有限自动机，用于象征性地表达和分析正则表达式约束，例如用于程序分析和测试。将正则表达式或模式转换为具有由表示字符集（而不是单个字符）的公式标记的转换的符号有限自动机。还描述了将两个或更多个符号有限自动机组合成完全可满足的结果符号有限自动机。可以使用约束求解器来确保可满足性。

5. 发明授权

US07665072B2 Generating test cases for software with complex preconditions 有权
标题翻译：为具有复杂前提条件的软件生成测试用例
公开(公告)号：US07665072B2
公开(公告)日：2010-02-16
申请号：US11112282
申请日：2005-04-21
申请人： Nikolai Tillman , Colin L. Campbell , Wolfgang Grieskamp , Lev Borisovich Nachmanson , Wolfram Schulte , Margus Veanes
发明人： Nikolai Tillman , Colin L. Campbell , Wolfgang Grieskamp , Lev Borisovich Nachmanson , Wolfram Schulte , Margus Veanes
IPC分类号： G06F9/44
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.
摘要翻译：描述用于为具有输入前提条件的方法或程序生成测试用例的技术和工具。例如，在为每个路径的相关输入条件找到可行的控制流路之后，创建一个与前提条件一起测试这些条件的新程序。通过分析这个新程序的控制流图，发现了一类测试用例，同时避免了通过前提条件和方法的组合控制流程图完成对路径的搜索而产生的低效率。通过将前提条件的控制流程图划分为分支和直线部分来引入额外的效率。

6. 发明授权

US07590520B2 Non-deterministic testing 有权
标题翻译：非确定性测试
公开(公告)号：US07590520B2
公开(公告)日：2009-09-15
申请号：US10758797
申请日：2004-01-15
申请人： Lev Borisovich Nachmanson , Margus Veanes , Wolfgang Grieskamp , Nikolai Tillmann
发明人： Lev Borisovich Nachmanson , Margus Veanes , Wolfgang Grieskamp , Nikolai Tillmann
IPC分类号： G06F9/45 , G06F9/44 , G06F11/00
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.
摘要翻译：计算机化方法为非确定性程序创建测试覆盖。该方法接收表示正在测试的程序的边和图的图形，并创建一个到图形中每个边缘的连续循环周期至少一次。在一个示例中，该方法将连续循环分解成在图中到达非确定性节点的边缘处的离散序列，并验证执行程序是否符合由离散序列表示的行为。在另一示例中，一种方法创建用于在非确定性图中达到一个或多个顶点的概率策略。该策略提供了具有达到所需顶点的高概率的图形路径。

7. 发明授权

US07337388B2 Tool-based iterative document management 有权
标题翻译：基于工具的迭代文档管理
公开(公告)号：US07337388B2
公开(公告)日：2008-02-26
申请号：US10336222
申请日：2003-01-02
申请人： Michael Barnett , Jacqueline Lynette Reid , Margus Veanes , Lev Borisovich Nachmanson
发明人： Michael Barnett , Jacqueline Lynette Reid , Margus Veanes , Lev Borisovich Nachmanson
IPC分类号： G06F15/00 , G06F17/00 , G06F12/00 , G06F17/30
CPC分类号： G06F17/24 , Y10S707/99953 , Y10S707/99954
摘要： A change management method and system for tool-based document generation which incorporates tool input changes, tool changes, and user changes during iterative document creation. After a tool-based document is generated and saved by a tool, and then edited by a user, during a next iteration of creating the edited document, the tool first generates a new base document. The base document is then saved, and a three-way merge is performed on the former iteration's base document, this iteration's new base document, and the former iteration's edited document. The former iteration's base document serves as the base of the merge process. The merge outputs a merged document, and when further edits are needed, the merged document is edited, and saved as the edited document. If no edits are necessary, the merged document is saved directly as the edited document. In each iteration, the new base document and the edited document are saved for a possible next iteration.
摘要翻译：一种用于基于工具的文档生成的变更管理方法和系统，其中包含了在迭代文档创建过程中的工具输入更改，工具更改和用户更改。基于工具的文档由工具生成并保存，然后由用户进行编辑时，在创建编辑文档的下一次迭代期间，该工具首先生成新的基础文档。然后保存基本文档，并对前一个迭代的基本文档，该迭代的新基础文档和前一个迭代的编辑文档执行三向合并。前一个迭代的基本文档作为合并过程的基础。合并输出合并的文档，当需要进一步编辑时，合并的文档将被编辑，并保存为已编辑的文档。如果不需要编辑，则合并的文档将直接保存为已编辑的文档。在每次迭代中，保存新的基本文档和编辑的文档以进行下一次迭代。

8. 发明申请

US20060212759A1 Conformance testing of multi-threaded and distributed software systems 有权
标题翻译：多线程和分布式软件系统的一致性测试
公开(公告)号：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.
摘要翻译：描述了用于测试多线程或分布式软件系统的技术和工具。例如，多线程系统被检测和执行以产生由其每个代理执行的事件的日志。代理日志包含每个代理的完全有序的事件序列，以及有关访问代理之间共享的资源的信息。利用该信息，描述所有代理执行的事件的部分排序用于执行。代理日志然后被复用到一个或多个序列化的事件顺序中，然后可以将其与在一致性测试引擎中的系统的规范进行比较。

9. 发明授权

US08180786B2 Symbolic query exploration 有权
标题翻译：符号查询探索
公开(公告)号：US08180786B2
公开(公告)日：2012-05-15
申请号：US12549380
申请日：2009-08-28
申请人： Margus Veanes , Nikolai Tillmann , Jonathan Paul de Halleux , Pavel Grigorenko
发明人： Margus Veanes , Nikolai Tillmann , Jonathan Paul de Halleux , Pavel Grigorenko
IPC分类号： G06F17/30
CPC分类号： G06F17/30634
摘要： A symbolic query exploration (QEX) module automatically produces output information that can be used to evaluate a database. The QEX module operates by converting an input query into a formula for processing by a satisfiability module theories (SMT) solver module. The SMT solver module generates a model that satisfies the formula. The model yields table information that is used to populate the database and, optionally, parameter information that is used to instantiate the query. A query evaluation module then submits the instantiated query to the populated database and evaluates whether an evaluation result produced thereby agrees with pre-specified condition information. The QEX module can preprocess the formula using either (or both) an eager expansion approach (in which the formula is expanded in an upfront manner) or a lazy expansion approach (in which axioms are identified for later possible expansion by the SMT solver module).
摘要翻译：符号查询探索（QEX）模块自动生成可用于评估数据库的输出信息。 QEX模块通过将输入查询转换为可满足性模块理论（SMT）求解器模块进行处理的公式来进行操作。 SMT求解器模块生成满足公式的模型。该模型产生用于填充数据库的表信息，以及可选的用于实例化查询的参数信息。查询评估模块然后将实例化的查询提交给填充的数据库，并评估由此产生的评估结果是否与预先指定的条件信息一致。 QEX模块可以使用（或两者）（或两者）预热扩展方法（其中公式以前期方式扩展）或延迟扩展方法（其中公理被识别用于随后可能由SMT求解器模块扩展）来预处理公式，。

10. 发明授权

US07926025B2 Symbolic program model compositions 失效
标题翻译：符号程序模型组成
公开(公告)号：US07926025B2
公开(公告)日：2011-04-12
申请号：US11322781
申请日：2005-12-30
申请人： Colin L. Campbell , Margus Veanes , Nicolas Kicillof , Nikolai Tillmann , Wolfgang Grieskamp , Wolfram Schulte
发明人： Colin L. 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.
摘要翻译：模型组合环境可以允许对填充或部分符号系统行为的描述，以及将特定特征的模型组合到复合模型中。组合运算符可以包括交集，连接，替换，交替细化，以及一组正则表达式运算符。称为“动作机器”的模型可以表示面向对象的，反应性的程序，并且动作机器可以由使用组合操作符的另一动作机构组成。这可以允许测试特定的场景或行为。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式