-
公开(公告)号：US08515891B2
公开(公告)日：2013-08-20
申请号：US12950586
申请日：2010-11-19
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.
摘要翻译： 描述了象征性的有限自动机，用于象征性地表达和分析正则表达式约束，例如用于程序分析和测试。 将正则表达式或模式转换为具有由表示字符集（而不是单个字符）的公式标记的转换的符号有限自动机。 还描述了将两个或更多个符号有限自动机组合成完全可满足的结果符号有限自动机。 可以使用约束求解器来确保可满足性。
-
公开(公告)号：US20120130932A1
公开(公告)日：2012-05-24
申请号：US12950586
申请日：2010-11-19
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.
摘要翻译： 描述了象征性的有限自动机，用于象征性地表达和分析正则表达式约束，例如用于程序分析和测试。 将正则表达式或模式转换为具有由表示字符集（而不是单个字符）的公式标记的转换的符号有限自动机。 还描述了将两个或更多个符号有限自动机组合成完全可满足的结果符号有限自动机。 可以使用约束求解器来确保可满足性。
-
公开(公告)号：US20110055237A1
公开(公告)日：2011-03-03
申请号：US12549380
申请日：2009-08-28
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求解器模块扩展）来预处理公式， 。
-
公开(公告)号：US07548911B2
公开(公告)日：2009-06-16
申请号：US11140061
申请日：2005-05-28
CPC分类号： G06F11/3636 , G06F11/3644 , Y10S707/99934
摘要： Diagnosing problems in distributed systems. In one aspect, a model of a distributed system defines trace statements are generated by various nodes of the system and placed in log files. The log files are sent to an automatic validator that attempts to reconcile the trace statements against the model. Results of the attempt are indicated. In another aspect, trace statements are received by a multiplexer that creates an ordering via sequence numbers. The ordering is forwarded to an automatic validator to determine whether the trace statements indicate correct behavior.
摘要翻译： 诊断分布式系统中的问题。 在一个方面，分布式系统的模型定义跟踪语句由系统的各个节点生成并放置在日志文件中。 日志文件被发送到一个自动验证器，它尝试将跟踪语句与模型进行协调。 显示尝试的结果。 另一方面，跟踪语句由多路复用器接收，该多路复用器通过序列号产生排序。 排序被转发到自动验证器以确定跟踪语句是否指示正确的行为。
-
公开(公告)号：US20120151592A1
公开(公告)日：2012-06-14
申请号：US12965930
申请日：2010-12-13
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）求解器。 可以确定字符串操纵程序是否可能包含潜在的安全风险，这取决于特定字符串是否可以通过字符串操作程序提供为输出。
-
公开(公告)号：US07149678B2
公开(公告)日：2006-12-12
申请号：US10112319
申请日：2002-03-28
申请人： Yuri Gurevich , Margus Veanes , Uwe Glässer
发明人： Yuri Gurevich , Margus Veanes , Uwe Glässer
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.
-
公开(公告)号：US07284235B2
公开(公告)日：2007-10-16
申请号：US10687099
申请日：2003-10-15
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，图像，文本等的媒体内容的版本也是有用的。
-
公开(公告)号：US07337388B2
公开(公告)日：2008-02-26
申请号：US10336222
申请日：2003-01-02
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.
摘要翻译： 一种用于基于工具的文档生成的变更管理方法和系统，其中包含了在迭代文档创建过程中的工具输入更改，工具更改和用户更改。 基于工具的文档由工具生成并保存，然后由用户进行编辑时，在创建编辑文档的下一次迭代期间，该工具首先生成新的基础文档。 然后保存基本文档，并对前一个迭代的基本文档，该迭代的新基础文档和前一个迭代的编辑文档执行三向合并。 前一个迭代的基本文档作为合并过程的基础。 合并输出合并的文档，当需要进一步编辑时，合并的文档将被编辑，并保存为已编辑的文档。 如果不需要编辑，则合并的文档将直接保存为已编辑的文档。 在每次迭代中，保存新的基本文档和编辑的文档以进行下一次迭代。
-
-
-
-
-
-
-
搜索结果
28 条记录 (耗时 0.029 秒)
