Patents by Inventor Christopher A. Rouff
Christopher A. Rouff has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 7979848Abstract: Systems, methods and apparatus are provided through which, in some embodiments, a formal specification is pattern-matched from scenarios, the formal specification is analyzed, and flaws in the formal specification are corrected. The systems, methods and apparatus may include pattern-matching an equivalent formal model from an informal specification. Such a model can be analyzed for contradictions, conflicts, use of resources before the resources are available, competition for resources, and so forth. From such a formal model, an implementation can be automatically generated in a variety of notations. The approach can improve the resulting implementation, which, in some embodiments, is provably equivalent to the procedures described at the outset, which in turn can improve confidence that the system reflects the requirements, and in turn reduces system development time and reduces the amount of testing required of a new system.Type: GrantFiled: September 21, 2006Date of Patent: July 12, 2011Assignee: The United States of America as represented by the Administrator of the National Aeronautics and Space AdministrationInventors: Michael G. Hinchey, James L. Rash, Christopher A. Rouff
-
Patent number: 7886273Abstract: Described herein is a method that produces fully (mathematically) tractable development of policies for autonomic systems from requirements through to code generation. This method is illustrated through an example showing how user formulated policies can be translated into a formal mode which can then be converted to code. The requirements-based programming method described provides faster, higher quality development and maintenance of autonomic systems based on user formulation of policies. Further, the systems, methods and apparatus described herein provide a way of analyzing policies for autonomic systems and facilities the generation of provably correct implementations automatically, which in turn provides reduced development time, reduced testing requirements, guarantees of correctness of the implementation with respect to the policies specified at the outset, and provides a higher degree of confidence that the policies are both complete and reasonable.Type: GrantFiled: September 18, 2006Date of Patent: February 8, 2011Assignee: The United States of America as represented by the Administrator of the National Aeronautics and Space AdministrationInventors: Michael G. Hinchey, James L. Rash, Walter F. Truszkowski, Christopher A. Rouff, Roy Sterritt, Denis Gracanin
-
Publication number: 20100257505Abstract: Described herein is a method that produces fully (mathematically) tractable development of policies for autonomic systems from requirements through to code generation. This method is illustrated through an example showing how user formulated policies can be translated into a formal mode which can then be converted to code. The requirements-based programming method described provides faster, higher quality development and maintenance of autonomic systems based on user formulation of policies. Further, the systems, methods and apparatus described herein provide a way of analyzing policies for autonomic systems and facilities the generation of provably correct implementations automatically, which in turn provides reduced development time, reduced testing requirements, guarantees of correctness of the implementation with respect to the policies specified at the outset, and provides a higher degree of confidence that the policies are both complete and reasonable.Type: ApplicationFiled: September 18, 2006Publication date: October 7, 2010Applicant: NASA HQ'sInventors: Michael G. HINCHEY, James L. RASH, Walter F. TRUSZKOWSKI, Christopher A. ROUFF, Roy STERRITT, Denis Gracanin
-
Patent number: 7752608Abstract: Systems, methods and apparatus are provided through which in some embodiments, domain knowledge is translated into a knowledge-based system. In some embodiments, a formal specification is derived from rules of a knowledge-based system, the formal specification is analyzed, and flaws in the formal specification are used to identify and correct errors in the domain knowledge, from which a knowledge-based system is translated.Type: GrantFiled: August 12, 2005Date of Patent: July 6, 2010Assignee: The United States of America as represented by the Administrator of the National Aeronautics and Space AdministrationInventors: Michael G. Hinchey, James L. Rash, John D. Erickson, Denis Gracinin, Christopher A. Rouff
-
Patent number: 7739671Abstract: Systems, methods and apparatus are provided through which in some embodiments an informal specification is translated without human intervention into a formal specification. In some embodiments the formal specification is a process-based specification. In some embodiments, the formal specification is translated into a high-level computer programming language which is further compiled into a set of executable computer instructions.Type: GrantFiled: August 12, 2005Date of Patent: June 15, 2010Assignee: The United States of America as represented by the Administrator of the National Aeronautics and Space AdministrationInventors: Michael G. Hinchey, James L. Rash, John D. Erickson, Denis Gracinin, Christopher A. Rouff
-
Patent number: 7668796Abstract: Systems, methods and apparatus are provided through which in some embodiments, automata learning algorithms and techniques are implemented to generate a more complete set of scenarios for requirements based programming. More specifically, a CSP-based, syntax-oriented model construction, which requires the support of a theorem prover, is complemented by model extrapolation, via automata learning. This may support the systematic completion of the requirements, the nature of the requirement being partial, which provides focus on the most prominent scenarios. This may generalize requirement skeletons by extrapolation and may indicate by way of automatically generated traces where the requirement specification is too loose and additional information is required.Type: GrantFiled: September 28, 2006Date of Patent: February 23, 2010Assignee: The United States of America as represented by the Administrator of the National Aeronautics and Space AdministrationInventors: Michael G. Hinchey, Tiziana Margaria, James L. Rash, Christopher A. Rouff, Bernard Steffen
-
Patent number: 7543274Abstract: A system and method for deriving a process-based specification for a system is disclosed. The process-based specification is mathematically inferred from a trace-based specification. The trace-based specification is derived from a non-empty set of traces or natural language scenarios. The process-based specification is mathematically equivalent to the trace-based specification. Code is generated, if applicable, from the process-based specification. A process, or phases of a process, using the features disclosed can be reversed and repeated to allow for an interactive development and modification of legacy systems. The process is applicable to any class of system, including, but not limited to, biological and physical systems, electrical and electro-mechanical systems in addition to software, hardware and hybrid hardware-software systems.Type: GrantFiled: February 25, 2004Date of Patent: June 2, 2009Assignee: The United States of America as represented by the Administrator of the National Aeronautics and Space AdministrationInventors: Michael Gerard Hinchey, James Larry Rash, Christopher A. Rouff
-
Publication number: 20070162410Abstract: Systems, methods and apparatus are provided through which in some embodiments, automata learning algorithms and techniques are implemented to generate a more complete set of scenarios for requirements based programming. More specifically, a CSP-based, syntax-oriented model construction, which requires the support of a theorem prover, is complemented by model extrapolation, via automata learning. This may support the systematic completion of the requirements, the nature of the requirement being partial, which provides focus on the most prominent scenarios. This may generalize requirement skeletons by extrapolation and may indicate by way of automatically generated traces where the requirement specification is too loose and additional information is required.Type: ApplicationFiled: September 28, 2006Publication date: July 12, 2007Applicant: NASA HQ's.Inventors: Michael G. HINCHEY, Tiziana MARGARIA, James L. RASH, Christopher A. ROUFF, Bernard STEFFEN
-
Publication number: 20070074180Abstract: Systems, methods and apparatus are provided through which, in some embodiments, a script is derived from scenarios, the script is analyzed, and flaws in the script are corrected. The systems, methods and apparatus may include inferring an equivalent formal model from procedures described in natural language (such as English), as scenarios, use cases, or a representation in one of a plethora of graphical notations Such a model can be analyzed for contradictions, conflicts, use of resources before the resources are available, competition for resources, and so forth. From such a formal model, code can be automatically generated in a variety of notations. This may include high level programming languages, machine languages, and scripting languages. The approach improves the resulting code, which may be provably equivalent to the procedures described at the outset.Type: ApplicationFiled: August 1, 2006Publication date: March 29, 2007Applicant: NASA HQ'SInventors: Michael Hinchey, James Rash, Christopher Rouff, Denis Gracanin
-
Publication number: 20070067755Abstract: Systems, methods and apparatus are provided through which, in some embodiments, a formal specification is pattern-matched from scenarios, the formal specification is analyzed, and flaws in the formal specification are corrected. The systems, methods and apparatus may include pattern-matching an equivalent formal model from an informal specification. Such a model can be analyzed for contradictions, conflicts, use of resources before the resources are available, competition for resources, and so forth. From such a formal model, an implementation can be automatically generated in a variety of notations. The approach can improve the resulting implementation, which, in some embodiments, is provably equivalent to the procedures described at the outset, which in turn can improve confidence that the system reflects the requirements, and in turn reduces system development time and reduces the amount of testing required of a new system.Type: ApplicationFiled: September 21, 2006Publication date: March 22, 2007Applicant: U.S.A. as represented by the Administrator of the National Aeronautics and Space AdmInventors: Michael HINCHEY, James RASH, Christopher ROUFF
-
Publication number: 20050138602Abstract: A system and method for deriving a process-based specification for a system is disclosed. The process-based specification is mathematically inferred from a trace-based specification. The trace-based specification is derived from a non-empty set of traces or natural language scenarios. The process-based specification is mathematically equivalent to the trace-based specification. Code is generated, if applicable, from the process-based specification. A process, or phases of a process, using the features disclosed can be reversed and repeated to allow for an interactive development and modification of legacy systems. The process is applicable to any class of system, including, but not limited to, biological and physical systems, electrical and electro-mechanical systems in addition to software, hardware and hybrid hardware-software systems.Type: ApplicationFiled: February 25, 2004Publication date: June 23, 2005Inventors: Michael Hinchey, James Rash, Christopher Rouff