Data processing: software development – installation – and managem – Software program development tool – Translation of code
Reexamination Certificate
2007-06-26
2007-06-26
An, Meng-Al T. (Department: 2193)
Data processing: software development, installation, and managem
Software program development tool
Translation of code
C717S116000, C717S118000, C717S148000, C717S151000, C707S793000, C711S006000
Reexamination Certificate
active
09912720
ABSTRACT:
A method for controlling disposition of a candidate object in an object-oriented programming environment is disclosed. The method may include the step of determining the number of cyclic paths that include the candidate object in the object-oriented programming environment. The method may also include the step of determining a number of internal references to the candidate object. The internal references are references from other objects in the object-oriented programming environment. The method may control the disposition of the candidate object on the basis of a predetermined relationship between the number of the internal references and the number of the cyclic paths.
REFERENCES:
patent: 5485613 (1996-01-01), Engelstad et al.
patent: 5675803 (1997-10-01), Preisler et al.
patent: 5799185 (1998-08-01), Watanabe
patent: 6047295 (2000-04-01), Endicott et al.
patent: 6061721 (2000-05-01), Ismael et al.
patent: 6173444 (2001-01-01), Archambault
patent: 6230160 (2001-05-01), Chan et al.
patent: 6249793 (2001-06-01), Printezis et al.
patent: 6282699 (2001-08-01), Zhang et al.
patent: 6289395 (2001-09-01), Apte et al.
patent: 6363403 (2002-03-01), Roy et al.
patent: 6370684 (2002-04-01), De Pauw et al.
patent: 6381738 (2002-04-01), Choi et al.
patent: 6421690 (2002-07-01), Kirk, III
patent: 6438616 (2002-08-01), Callsen et al.
patent: 6467075 (2002-10-01), Sato et al.
patent: 6499095 (2002-12-01), Sexton et al.
patent: 6502110 (2002-12-01), Houldsworth
patent: 6526422 (2003-02-01), Flood et al.
patent: 6604182 (2003-08-01), Sexton et al.
patent: 6675379 (2004-01-01), Kolodner et al.
patent: 6701334 (2004-03-01), Ye et al.
patent: 6757890 (2004-06-01), Wallman
patent: 6760825 (2004-07-01), Sexton et al.
patent: 2001/0013117 (2001-08-01), Ungar
patent: 2001/0056522 (2001-12-01), Satyanarayana
patent: 2002/0056019 (2002-05-01), Kolodner et al.
patent: 2002/0062419 (2002-05-01), Konson et al.
patent: 2002/0129343 (2002-09-01), Pinter et al.
patent: 2002/0178437 (2002-11-01), Blais et al.
patent: 2002/0194421 (2002-12-01), Berry et al.
patent: 2004/0015873 (2004-01-01), Sokolov et al.
patent: 2004/0015920 (2004-01-01), Schmidt
Tiernan, “An Efficient Search Algorithm to Find the Elementary Circuits of a Graph”,Comm. of the ACM,.13:722-726, (1970).
Tarjan, “Depth-First Search and Linear Graph Algorithms”, SIAMJ. Comp., 1:146-160, (Jun. 1972).
Tarjan, “Enumeration of the Elementary Circuits of a Directed Graph”Cornell University Technical Report TR72-145 (1972).
Weinblatt, “A New Search Algorithm for Finding the Simple Cycles of a Finite Directed Graph”,JACM19:43-56 (Jan. 1972).
IBM Technical Disclosure Bulletin, Generating Event Adapters to Facilitate Connections Between Java Beans, Jan. 1, 1998, p. 1-3.
John Henry Moore, Microsoft's New, Improved Proxy Server, Dec. 1997, p. 1-3.
Samir B. Gehani, A Java Based Framework for Explicitly Partitioning, 1997, Section 3.1 Java Beans.
David M. Gay, Symbolic-Algebraic Computations in a Modeling Language for Mathematical Programming, Nov. 1999, Schloss Dagstuhl, p. 4-7.
Hartmut Pohlheim, Genetic and Evolutionary Algorithm Toolbox for use with MATLAB, Jul. 1997.
An Meng-Al T.
Kang Insun
Lahive & Cockfield LLP
The Mathworks, Inc.
LandOfFree
Designating an object for destruction does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Designating an object for destruction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Designating an object for destruction will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3841940