Reformulating resources with nodes reachable from defined...

Data processing: software development – installation – and managem – Software program development tool – Managing software components

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C717S162000, C717S163000

Reexamination Certificate

active

10463480

ABSTRACT:
Historically, resources (e.g., dynamic linked libraries) were organized based on factors including the expertise of development teams. Unfortunately, this creates shared resources of much greater functionality than required by any one client application. By reformulating shared resources according to the nodes reachable from a set of defined entry points, the reformulated resources will contain nodes of relevance. This optimization reduces memory requirements which is useful for embedded systems and for reducing disk accesses.

REFERENCES:
patent: 5664191 (1997-09-01), Davidson et al.
patent: 5774722 (1998-06-01), Gheith
patent: 5848274 (1998-12-01), Hamby et al.
patent: 5933640 (1999-08-01), Dion
patent: 6167564 (2000-12-01), Fontana et al.
patent: 6175957 (2001-01-01), Ju et al.
patent: 6185734 (2001-02-01), Saboff et al.
patent: 6199196 (2001-03-01), Madany et al.
patent: 6226792 (2001-05-01), Goiffon et al.
patent: 6282701 (2001-08-01), Wygodny et al.
patent: 6292934 (2001-09-01), Davidson et al.
patent: 6314558 (2001-11-01), Angel et al.
patent: 6321240 (2001-11-01), Chilimbi et al.
patent: 6330692 (2001-12-01), Kamuro et al.
patent: 6336122 (2002-01-01), Lee et al.
patent: 6381735 (2002-04-01), Hunt
patent: 6385741 (2002-05-01), Nakamura
patent: 6385768 (2002-05-01), Ziebell
patent: 6412106 (2002-06-01), Leask et al.
patent: 6427230 (2002-07-01), Goiffon et al.
patent: 6460178 (2002-10-01), Chan et al.
patent: 6546551 (2003-04-01), Sweeney et al.
patent: 6662356 (2003-12-01), Edwards et al.
patent: 6665866 (2003-12-01), Kwiatkowski et al.
patent: 6678886 (2004-01-01), Kumon
patent: 6718535 (2004-04-01), Underwood
patent: 6851111 (2005-02-01), McGuire et al.
patent: 6957422 (2005-10-01), Hunt
patent: 7003759 (2006-02-01), Jameson
patent: 7020329 (2006-03-01), Prempraneerach et al.
patent: 7058941 (2006-06-01), Venkatesan et al.
patent: 7076784 (2006-07-01), Russell et al.
patent: 2003/0204836 (2003-10-01), Srivastava et al.
Sreedhar et al, “A framework for interprocedural optimization in the presence of dyanmic class loading”, ACM PLDI, pp. 196-207, 2000.
Hammer et al, “Dynamic path conditions in dependence graphs”, ACM PEPM, pp. 58-67, 2006.
Vlaovic et al, “Improving BTB performance in the presence of DLLs”, IEEE, pp. 1-10, 2000.
Milenkovic et al, “A framework for trusted instruction execution via basic block signature verification”, ACM SE, pp. 191-196, 2004.
U.S. Appl. No. 09/343,805, filed Jun. 30, 1999.
U.S. Appl. No. 09/712,063, filed Nov. 14, 2000.
Amitabh Srivastava et al.; Effectively Prioritizing Tests in Development Environment; International Symposium on Software Testing and Analysis, Jul. 2002; 11 pages.
Zheng Wang et al.; BMAT—A Binary Matching Tool for Stale Profile Propagation; Journal of Instruction—Level Parallelism 2; Apr. 2000; pp. 1-20.
Amitabh Srivastava et al.; Vulcan Binary transformation in a distributed environment; Technical Report; Apr. 2001; pp. 1-12.
Srivastava et al., “Effectively Prioritizing Tests in Development Environment,” Feb. 2002, MSR-TR-2002-15, Publisher: Association for Computing Machinery, Inc., pp. 1-10.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Reformulating resources with nodes reachable from defined... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Reformulating resources with nodes reachable from defined..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reformulating resources with nodes reachable from defined... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3749993

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.