Patents by Inventor Raymond Paul Stata

Raymond Paul Stata 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: 9229980
    Abstract: Methods and apparatus for executing an application are disclosed. In accordance with one embodiment, a request is received. One or more of a plurality of module types are instantiated such that a plurality of module objects are generated. A query plan linking the plurality of module objects is executed such that a response to the request is generated. The response is then returned.
    Type: Grant
    Filed: February 23, 2010
    Date of Patent: January 5, 2016
    Assignee: Yahoo! Inc.
    Inventors: Andrew An Feng, Evgeniy Makeev, Jeffrey Budzinski, Swee Lim, Scott Alexander Banachowski, Raymond Paul Stata, Rohit Chandra
  • Publication number: 20110209007
    Abstract: Methods and apparatus for executing an application are disclosed. In accordance with one embodiment, a request is received. One or more of a plurality of module types are instantiated such that a plurality of module objects are generated. A query plan linking the plurality of module objects is executed such that a response to the request is generated. The response is then returned.
    Type: Application
    Filed: February 23, 2010
    Publication date: August 25, 2011
    Applicant: YAHOO! INC.
    Inventors: Andrew An Feng, Evgeniy Makeev, Jeffrey Budzinski, Swee Lim, Scott Alexander Banachowski, Raymond Paul Stata, Rohit Chandra
  • Patent number: 6353925
    Abstract: When a source program containing annotations is processed by a user-selected tool, the annotations in the source program are detected by a lexer and passed to an annotation processor corresponding to the selected tool. The system contains a number of annotation processors and a number of program processing tools, and the annotation processor to which the annotations are passed is selected based upon the user-selected tool. The selected annotation processor converts annotations compatible with the user-selected tool into annotation tokens and returns the annotation tokens to the lexer. The lexer generates tokens based upon the programming-language statements in the source program, and passes both the tokens and annotation tokens to a parser. The parser, in turn, assembles the tokens and annotation tokens into an abstract syntax tree, which is then passed to the user-selected tool for further processing.
    Type: Grant
    Filed: September 22, 1999
    Date of Patent: March 5, 2002
    Assignee: Compaq Computer Corporation
    Inventors: Raymond Paul Stata, Cormac Flanagan, K. Rustan M. Leino, Mark D. Lillibridge, James Benjamin Saxe
  • Patent number: 6253370
    Abstract: A method and apparatus annotates a computer program to facilitate subsequent processing of the program. Code representing the program is generated at a first computer system. Annotations are generated for the code that provide information about the code. At a second computer, the code is processed according to the information provided by the annotations. The annotations, for example, can indicate a control flow graph representing a flow of execution of the code. Also, the information provided by the annotations can be a register allocation that maps data structures of the code to registers of the second computer system. The second computer system can use such information to guide the interpreting of the code or to transform the code into a more optimized form. Other exemplary annotations can indicate that running the executable form of the code would perform an unauthorized operation at the second computer system.
    Type: Grant
    Filed: December 1, 1997
    Date of Patent: June 26, 2001
    Assignee: Compaq Computer Corporation
    Inventors: Martin Abadi, Sanjay Ghemawat, Raymond Paul Stata
  • Patent number: 6134531
    Abstract: A computerized method enables an audience to synchronously interact with a broadcast program in realtime. A broadcast clock of a broadcast system is synchronized to a standard time. A server clock of a server computer is synchronized to the standard time using a network timing protocol. A client computer clock of a client computer is synchronized to the server clock. The program is broadcast synchronously to the broadcast clock. Web pages are provided by the server computer to the client computer. Responses generated by the client computer are time-stamped according to the synchronized time of the client computer so that the responses can be time-correlated to segments of the program.
    Type: Grant
    Filed: September 24, 1997
    Date of Patent: October 17, 2000
    Assignee: Digital Equipment Corporation
    Inventors: Glenn Trewitt, David R. Jefferson, Raymond Paul Stata, Edward M. Gould
  • Patent number: 5987252
    Abstract: A method and an apparatus analyze a computer program for dependencies of the program output on the program input. To analyze the program, the program is transformed by a function into a Boolean expression called a verification condition. An example of this function is the weakest liberal precondition. The verification condition characterizes a condition between the input and the output of the program that must be satisfied for the output to be independent of the input. A theorem prover evaluates the verification condition to determine whether the output would depend on the input if the program was executed. If the verification condition evaluates to true, then the output is independent of the input; false, then the output depends on the input.
    Type: Grant
    Filed: September 19, 1997
    Date of Patent: November 16, 1999
    Assignee: Digital Equipment Corporation
    Inventors: K. Rustan M. Leino, Mark David Lillibridge, Raymond Paul Stata