Work Files Saved Searches
   My Account                                                  Search:   Quick/Number   Boolean   Advanced   Derwent    Help   


 The Delphion Integrated View

  Buy Now:   Buy PDF- 8pp  PDF  |   File History  |   Other choices   
  Tools:  Citation Link  |  Add to Work File:    
  View:  Expand Details   |  INPADOC   |  Jump to: 
  Go to:  Derwent  
 Email this to a friend  Email this to a friend 
       
Title: US7509631: Systems and methods for implementing a computer language type system
[ Derwent Title ]


Country: US United States of America

View Images High
Resolution

 Low
 Resolution

 
8 pages

 
Inventor: Lucas, Paul J.; Mountain View, CA, United States of America
Florescu, Daniela D.; Palo Alto, CA, United States of America
Riccardi, Fabio; Palo Alto, CA, United States of America

Assignee: Bea Systems, Inc., Redwood Shores, CA, United States of America
other patents from BEA SYSTEMS, INC. (752191) (approx. 18)
 News, Profiles, Stocks and More about this company

Published / Filed: 2009-03-24 / 2004-12-03

Application Number: US2004000004462

IPC Code: Advanced: G06F 9/44;
Core: more...

ECLA Code: G06F9/44L;

U.S. Class: 717/114;

Field of Search: Non/00e

Priority Number:
2004-12-03  US2004000004462
2004-05-21  US2004000573401P

Abstract:     The invention provides systems and methods for implementation of a computer language type system by augmenting finite state automata algorithms to accommodate symbols having both subtype relationships and nested types. To make the classical automata algorithms work for type system with subtypes, finite state automata for a data type is augmented by additional transitions that include secondary symbols, wherein secondary symbols are subtypes of symbols of alphabet of finite state automata. A data type when compared to another data type must compare both names and the contents.

Attorney, Agent or Firm: Fliesler Meyer LLP ;

Primary / Asst. Examiners: Dam, Tuan Q; Bui, Hanh T

INPADOC Legal Status: None          Buy Now: Family Legal Status Report

Parent Case: CLAIM OF PRIORITY
    This application claims priority to U.S. Provisional Patent Application No. 60/573,401, entitled SYSTEMS AND METHODS FOR IMPLEMENTING A COMPUTER LANGUAGE TYPE SYSTEM, by Paul J. Lucas, Daniela D. Florescu, and Fabio Riccardi, filed May 21, 2004, which is hereby incorporated herein by reference.

Family: Show 2 known family members

First Claim:
Show all 24 claims
    1. A method for implementing a data type system for use with a computer language, comprising the steps of:

accessing a computer language document using a programming language, wherein the programming language defines a plurality of complex data types and subtypes that specify whether data elements within the document are in a correct form;

creating a minimized deterministic finite state automata for use with the data types and subtypes used by the programming language, wherein the finite state automata includes states that represent language data types, and transitions between the states, and wherein each of the transitions includes a symbol of the alphabet of the minimized deterministic finite state automata;

augmenting the minimized deterministic finite state automata with additional transitions that include secondary symbols, wherein each of the secondary symbols corresponds in the programming language to a subtype of one of the data types; and

using the augmented minimized deterministic finite state automata with automata algorithms that include intersection and union, to compare and determine if data types and subtypes in the document are one of equal, subsets or intersect.



Background / Summary: Show background / summary

Drawing Descriptions: Show drawing descriptions

Description: Show description

       
U.S. References: Go to Result Set: All U.S. references   |  No patents reference this one   |   Backward references (4)   |   Citation Link

Buy
PDF
Patent  Pub.Date  Inventor Assignee   Title
Buy PDF- 7pp US7194462  2007-03 Riccardi et al.  Bea Systems, Inc. Systems and methods for implementing an XML query language
Buy PDF- 70pp US7240004  2007-07 Allauzen et al.  AT&T Corp. Systems and methods for determining the determinizability of finite-state automata and transducers
Buy PDF- 12pp US7240048  2007-07 Pontius   System and method of parallel pattern matching
Buy PDF- 13pp US20040013307A1  2004-01 Thienot et al.   Method for compressing/decompressing structure documents
       
Foreign References: None

Other References:
  • Markus Forsberg; Finite State Transducers in Haskell; Aug. 28, 2001; p. 1-41.
  • Andrew Eisenberg, An Early Look at XQuery, Dec. 2002, SIGMOD Record, vol. 31, No. 4, pp. 113-120.
  • Daniela Florescu, The BEA/SQRL Streaming XQuery Processor, 2003, pp. 1-12.


  • Continuity Data:
    Application Number Filed Notes

    US2004000004462 2004-12-03  is a related to the prior publication
         US20060010124A1 issued 2006-01-12  Systems and methods for implementing a computer language type system

    US2004000004462 2004-12-03  is a non-provisional of provisional
    US2004000573401P  2004-05-21


    Inquire Regarding Licensing

    Powered by Verity


    Plaques from Patent Awards      Gallery of Obscure PatentsNominate this for the Gallery...

    Thomson Reuters Copyright © 1997-2010 Thomson Reuters 
    Subscriptions  |  Web Seminars  |  Privacy  |  Terms & Conditions  |  Site Map  |  Contact Us  |  Help