公开(公告)号：US20100088679A1

公开(公告)日：2010-04-08

申请号：US12244967

申请日：2008-10-03

申请人： David E. Langworthy ,  Gavin Bierman ,  Andrew D. Gordon ,  Donald F. Box ,  Bradford H. Lovering ,  Jeffrey C. Schlimmer ,  John D. Doty

发明人： David E. Langworthy ,  Gavin Bierman ,  Andrew D. Gordon ,  Donald F. Box ,  Bradford H. Lovering ,  Jeffrey C. Schlimmer ,  John D. Doty

IPC分类号： G06F9/45 ,  G06F9/44 ,  G06N5/02

CPC分类号： G06F8/437

摘要： An efficient, logical and expressive type system supports the combination of refinement types and type membership expressions, as well as a top type that encompasses all valid values as members. A bidirectional type checking algorithm is provided for the type system including synthesis and checking steps to statically verify types of code based on the type system.

摘要翻译： 一种高效，逻辑和表达型的系统支持细化类型和类型成员关系表达式的组合，以及包含所有有效值作为成员的顶级类型。 为类型系统提供了双向类型检查算法，包括综合和检查步骤，以静态验证基于类型系统的代码类型。

公开(公告)号：US07593994B2

公开(公告)日：2009-09-22

申请号：US11074619

申请日：2005-03-08

申请人： Andrew D. Milligan ,  Harris Syed ,  John D. Doty ,  Max Attar Feingold ,  Saji Abraham

发明人： Andrew D. Milligan ,  Harris Syed ,  John D. Doty ,  Max Attar Feingold ,  Saji Abraham

IPC分类号： G06F15/16

CPC分类号： H04L67/02

摘要： Example embodiments of the present invention provide a mechanism for allowing developers to define new interfaces and insert custom translational code that implements these new interfaces for legacy components that otherwise cannot communicate in a web service environment. These new interfaces are then exposed to the web service client in such a way that abstracts the web service client from the legacy components interfaces. The objects that implement the new interfaces are referred to herein as “service surrogates” and the new interfaces will be commonly referred to as a, “surrogate interfaces.” These surrogate interfaces may be initialized along with an instance of the service surrogate upon startup of an application that offers the services. In addition, a dynamic web service can simultaneously run along with the service surrogate for those services that may not need the features offered by the service surrogates.

摘要翻译： 本发明的示例性实施例提供了一种允许开发人员定义新接口并插入为实现这些新接口的定制翻译代码的机制，用于传统组件，否则无法在Web服务环境中进行通信。 这些新接口然后以Web服务客户端从传统组件接口抽象出来。 实现新接口的对象在这里被称为“服务代理”，新接口通常被称为“代理接口”。 这些代理接口可以在启动提供服务的应用程序时与服务代理的实例一起初始化。 此外，动态Web服务可以与可能不需要服务代理提供的功能的那些服务的服务代理同时运行。

公开(公告)号：US20090157767A1

公开(公告)日：2009-06-18

申请号：US11959352

申请日：2007-12-18

申请人： John D. Doty ,  Graig A. Critchley

发明人： John D. Doty ,  Graig A. Critchley

IPC分类号： G06F17/30

CPC分类号： G06F11/0751 ,  G06F17/30368 ,  G06F17/30371

摘要： The setting up of a circular log implementation to be able to detect amnesia in a circular log, and to the determination of whether or not amnesia has occurred in such a circular log. Upon detecting a checkpoint trigger, information is preserved sufficient to detect whether or not the removed records ever existed in the circular log. If a request for information from a record were subsequently to be received by the circular log implementation, and if the record was not actually in the circular log, the preserved information could then be consulted to see if it indicates that the record had once existed in the circular log. If the information indicates that the record had once existed in the circular log, then amnesia has not occurred. If the information does not indicate that the record had once existed in the circular log, then amnesia has occurred. Accordingly, amnesia detection is made possible even in a complicated circular log implementation.

摘要翻译： 建立循环日志实施，以便能够在循环日志中检测健忘症，以及确定是否在这样的循环日志中发生遗忘。 在检测到检查点触发时，保留足够的信息以检测循环日志中是否存在已删除的记录。 如果通过循环日志实现后续收到来自记录的信息请求，并且如果记录实际上不在循环日志中，则可以查看保留的信息，以查看是否表明该记录曾经存在 循环日志。 如果信息表明记录曾经存在于循环日志中，则没有发生健忘。 如果信息没有表明记录曾经存在于循环日志中，则发生了健忘。 因此，即使在复杂的循环日志实现中也可以进行健忘检测。

公开(公告)号：US08539457B2

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

申请号：US12613925

申请日：2009-11-06

申请人： John Lawrence Hamby ,  Joshua Ryan Williams ,  John D. Doty ,  Clemens A. Szyperski ,  David Michael Miller

发明人： John Lawrence Hamby ,  Joshua Ryan Williams ,  John D. Doty ,  Clemens A. Szyperski ,  David Michael Miller

IPC分类号： G06F9/45 ,  G06F9/455

CPC分类号： G06N5/022

摘要： Computing responses to semantic queries. A method includes accessing a plurality of objects that represent source code for an input program. The source code is transformed into a plurality of immutable objects that are structured such that the immutable objects can be used to derive any response as defined by the semantic rules about the source code. A query is received from a requestor requesting a semantic characteristic of the input program. The semantic characteristic is calculated. The semantic characteristic is returned to the requestor. The semantic characteristic is cached in a cache. Information describing a dependency between the cached semantic characteristic and one or more of the objects in the plurality of objects is stored.

摘要翻译： 计算对语义查询的响应。 一种方法包括访问代表输入程序的源代码的多个对象。 源代码被转换成多个不可变对象，其被构造成使得不可变对象可以用于导出由关于源代码的语义规则定义的任何响应。 从请求者接收到询问输入程序的语义特征的查询。 计算语义特征。 语义特征被返回给请求者。 语义特征缓存在缓存中。 存储描述缓存的语义特征与多个对象中的一个或多个对象之间的依赖关系的信息。

公开(公告)号：US08473897B2

公开(公告)日：2013-06-25

申请号：US12244998

申请日：2008-10-03

申请人： Donald F. Box ,  Bradford H. Lovering ,  John D. Doty ,  Jeffrey C. Schlimmer ,  John L. Hamby ,  David E. Langworthy

发明人： Donald F. Box ,  Bradford H. Lovering ,  John D. Doty ,  Jeffrey C. Schlimmer ,  John L. Hamby ,  David E. Langworthy

IPC分类号： G06F9/44 ,  G06F9/45

CPC分类号： G06F8/437 ,  G06F8/31 ,  G06F8/42

摘要： A common intermediate representation for a data scripting language is provided for efficient representation and direct specification of programming constructs in memory. The common intermediate representation of data scripts allows data intensive applications to be created and analyzed in a machine accessible format, and the elements of the common intermediate representation can be stored independent of underlying storage specifics. Stored elements of the common intermediate representation of code are thus available for fast loading in memory when desired by other applications and programs by mapping the stored elements to the in memory intermediate representation.

摘要翻译： 提供了一种用于数据脚本语言的常用中间表示形式，用于有效地表示和直接指定存储器中的编程结构。 数据脚本的公共中间表示允许以机器可访问格式创建和分析数据密集型应用程序，并且可以独立于底层存储细节存储公共中间表示的元素。 因此，当通过将存储的元素映射到存储器中间表示中时，通过其它应用和程序的需要，代码的公共中间表示的存储元件可用于在存储器中快速加载。

公开(公告)号：US08413119B2

公开(公告)日：2013-04-02

申请号：US12244988

申请日：2008-10-03

申请人： David E. Langworthy ,  Gavin Bierman ,  Andrew D. Gordon ,  Donald F. Box ,  Bradford H. Lovering ,  Jeffrey C. Schlimmer ,  John D. Doty

发明人： David E. Langworthy ,  Gavin Bierman ,  Andrew D. Gordon ,  Donald F. Box ,  Bradford H. Lovering ,  Jeffrey C. Schlimmer ,  John D. Doty

IPC分类号： G06F9/44

CPC分类号： G06F8/437

摘要： An efficient, logical and expressive type system supports the combination of refinement types and type membership expressions, as well as a top type that encompasses all valid values as members. Various embodiments verify the validity of subtyping relationships by translating to first-order logic, and invoking a general-purpose theorem prover with the first-order logic as input. In contrast to treating formulas as types, types are translated into formulas of standard first-order logic. Moreover, to represent data structures of the programming language as first-order logic, universal and existential quantifiers of first-order logic, and function symbols in terms, are exploited. Data intensive applications can be generated, verified, and deployed with greater speed and scale.

摘要翻译： 一种高效，逻辑和表达型的系统支持细化类型和类型成员关系表达式的组合，以及包含所有有效值作为成员的顶级类型。 各种实施例通过转换为一阶逻辑来验证子类型关系的有效性，并且以一阶逻辑作为输入来调用通用定理证明器。 与将处理公式作为类型相反，类型被转换为标准一阶逻辑的公式。 此外，为了将编程语言的数据结构表示为一阶逻辑，利用一阶逻辑的通用和存在量词，以及术语中的函数符号。 可以以更快的速度和规模生成，验证和部署数据密集型应用程序。

公开(公告)号：US08271454B2

公开(公告)日：2012-09-18

申请号：US11959352

申请日：2007-12-18

申请人： John D. Doty ,  Craig A. Critchley

发明人： John D. Doty ,  Craig A. Critchley

IPC分类号： G06F7/00 ,  G06F17/00 ,  G06F17/30

CPC分类号： G06F11/0751 ,  G06F17/30368 ,  G06F17/30371

摘要： The setting up of a circular log implementation to be able to detect amnesia in a circular log, and to the determination of whether or not amnesia has occurred in such a circular log. Upon detecting a checkpoint trigger, information is preserved sufficient to detect whether or not the removed records ever existed in the circular log. If a request for information from a record were subsequently to be received by the circular log implementation, and if the record was not actually in the circular log, the preserved information could then be consulted to see if it indicates that the record had once existed in the circular log. If the information indicates that the record had once existed in the circular log, then amnesia has not occurred. If the information does not indicate that the record had once existed in the circular log, then amnesia has occurred. Accordingly, amnesia detection is made possible even in a complicated circular log implementation.

摘要翻译： 建立循环日志实施，以便能够在循环日志中检测健忘症，以及确定是否在这样的循环日志中发生遗忘。 在检测到检查点触发时，保留足够的信息以检测循环日志中是否存在已删除的记录。 如果通过循环日志实现后续收到来自记录的信息请求，并且如果记录实际上不在循环日志中，则可以查看保留的信息，以查看是否表明该记录曾经存在 循环日志。 如果信息表明记录曾经存在于循环日志中，则没有发生健忘。 如果信息没有表明记录曾经存在于循环日志中，则发生了健忘。 因此，即使在复杂的循环日志实现中也可以进行健忘检测。

公开(公告)号：US07860900B2

公开(公告)日：2010-12-28

申请号：US12037004

申请日：2008-02-25

申请人： Clemens A. Szyperski ,  Geoffrey M. Kizer ,  Joshua R. Williams ,  John D. Doty

发明人： Clemens A. Szyperski ,  Geoffrey M. Kizer ,  Joshua R. Williams ,  John D. Doty

IPC分类号： G06F7/00 ,  G06F17/30

CPC分类号： G06F9/542

摘要： A signaling system of the present invention provides a synchronized approach to delivering, reporting, and/or otherwise processing status changes in a software dependency chain. In a first phase, the signaling system identifies all dependencies between software components, and further sets a binary indicator of each node in a first representation. After identifying any changes in a source node, the system (e.g., a value is updated), the system updates each binary indicator to a second setting. In a second phase, the system initiates all listeners in the dependency chain in an essentially progressive order from source node, to intermediate node, and end-node, etc. Once all listeners have had a chance to perform one or more processes based on the updated value, the system can discard the dependency graph, allowing a new dependency graph to be built for subsequent value changes.

摘要翻译： 本发明的信令系统提供了一种用于递送，报告和/或以其他方式处理软件依赖链中状态变化的同步方法。 在第一阶段，信令系统识别软件组件之间的所有依赖关系，并进一步在第一表示中设置每个节点的二进制指示符。 在识别源节点中的任何改变之后，系统（例如，值被更新），系统将每个二进制指示符更新为第二设置。 在第二阶段中，系统以从源节点到中间节点和终端节点等基本上渐进的顺序启动依赖关系链中的所有侦听器。一旦所有侦听器都有机会基于该进程执行一个或多个进程 更新的值，系统可以丢弃依赖图，允许为随后的值更改构建新的依赖关系图。

公开(公告)号：US20100088666A1

公开(公告)日：2010-04-08

申请号：US12244998

申请日：2008-10-03

申请人： Donald F. Box ,  Bradford H. Lovering ,  John D. Doty ,  Jeffrey C. Schlimmer ,  John L. Hamby ,  David E. Langworthy

发明人： Donald F. Box ,  Bradford H. Lovering ,  John D. Doty ,  Jeffrey C. Schlimmer ,  John L. Hamby ,  David E. Langworthy

IPC分类号： G06F9/44

CPC分类号： G06F8/437 ,  G06F8/31 ,  G06F8/42

摘要： A common intermediate representation for a data scripting language is provided for efficient representation and direct specification of programming constructs in memory. The common intermediate representation of data scripts allows data intensive applications to be created and analyzed in a machine accessible format, and the elements of the common intermediate representation can be stored independent of underlying storage specifics. Stored elements of the common intermediate representation of code are thus available for fast loading in memory when desired by other applications and programs by mapping the stored elements to the in memory intermediate representation.

摘要翻译： 提供了一种用于数据脚本语言的常用中间表示形式，用于有效地表示和直接指定存储器中的编程结构。 数据脚本的公共中间表示允许以机器可访问格式创建和分析数据密集型应用程序，并且可以独立于底层存储细节存储公共中间表示的元素。 因此，当通过将存储的元素映射到存储器中间表示中时，通过其它应用和程序的需要，代码的公共中间表示的存储元件可用于在存储器中快速加载。

公开(公告)号：US20100088661A1

公开(公告)日：2010-04-08

申请号：US12244981

申请日：2008-10-03

申请人： David E. Langworthy ,  Gavin Bierman ,  Andrew D. Gordon ,  Donald F. Box ,  Bradford H. Lovering ,  Jeffrey C. Schlimmer ,  John D. Doty

发明人： David E. Langworthy ,  Gavin Bierman ,  Andrew D. Gordon ,  Donald F. Box ,  Bradford H. Lovering ,  Jeffrey C. Schlimmer ,  John D. Doty

IPC分类号： G06F17/30

CPC分类号： G06F8/10 ,  G06F8/31

摘要： An efficient, logical and expressive type system is provided for flexibly defining types of a declarative programming language so that efficient and structurally compact data intensive applications can be generated. The type system supports the combination of refinement types and type membership expressions, as well as a top type that encompasses all valid values as members. With the type system, types can be expressed as intersections and/or unions of other types. Thus, types can be efficiently represented for a full range of types of data as may be found in real world data stores.

摘要翻译： 提供了一种高效，逻辑和表达型的系统，用于灵活定义声明式编程语言的类型，从而可以生成有效和结构紧凑的数据密集型应用程序。 类型系统支持细化类型和类型成员关系表达式的组合，以及包含所有有效值作为成员的顶级类型。 对于类型系统，类型可以表示为其他类型的交集和/或联合。 因此，可以在真实世界数据存储中可以找到的全部数据类型有效地表示类型。