IP Library › Granted Patent US 12,379,908
Granted Patent B2
US 12,379,908 · App. 18/130,735 · Granted Aug 5, 2025

Systems and methods for code clustering analysis and transformation

Inventors: Albrecht Gass (Fullerton, CA); Stefan Hetges (Mannheim, DE); Nikolaos Faradouris (Mannheim, DE); Oliver Flach (Leinfelden-Echterdingen, DE)
Assignee: SMARTSHIFT TECHNOLOGIES, INC.
G06F8/427G06F8/35G06F8/425G06F8/436G06F8/4436G06F8/65G06F8/751G06F9/44505
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,379,908
App. No.
18/130,735
Granted
Aug 5, 2025
Kind
B2
Abstract

The present application is directed towards systems and methods for cluster-based code analysis and transformation. Cluster-based analysis may group code objects based on their similarity across functional areas, such as where a code object is cloned in multiple areas (e.g. sort functions that are duplicated across areas, or reports or tables that are identical). In some implementations, objects may be grouped into clusters by type, or based on reading from or writing to a common table. In some implementations, clustering at different layers may be possible.

Claims (24)

1. A non-transitory software installation device storing processor-executable instructions configured to cause a computing device to perform automated for cluster-based code analysis and transformation by executing a method comprising:

selecting, by an analysis agent executed by a computing device, a first plurality of code objects of a source installation of an application to be transformed to a target installation of the application, responsive to each code object in the first plurality of code objects having an output to a common second code object;

generating, by the analysis agent, a first identifier for the selected first plurality of code objects based on the common second code object;

adding, by a transformer executed by the computing device, the first identifier to each code object in the selected first plurality of code objects, wherein the first identifier identifies each code object in the selected first plurality of code objects as being in the first plurality of code objects;

determining, by the transformer, that the common second code object is replaced with a third code object during transformation of the source installation to the target installation;

responsive to the determination, identifying each code object in the first plurality of code objects, by the transformer, via the added first identifier based on the common second code object; and

updating, by the transformer, each code object in the identified first plurality of code objects, to output to the third code object, responsive to the determination.

2. The non-transitory software installation device of claim 1 , wherein selecting the first plurality of code objects further comprises extracting an output variable from each code object in a second plurality of code objects.

3. The non-transitory software installation device of claim 2 , further comprising selecting the first plurality of code objects as a subset of the second plurality of code objects, responsive to the extracted output variable for each code object in the first plurality of code objects corresponding to the common second code object.

4. The non-transitory software installation device of claim 2 , wherein the updating further comprises changing a function name of the output variable from an old function name to a new function name.

5. The non-transitory software installation device of claim 1 , wherein the common second code object comprises a table.

6. The non-transitory software installation device of claim 1 , wherein the common second code object comprises a database.

7. The non-transitory software installation device of claim 1 , wherein selecting the first plurality of code objects further comprises:

identifying an object type of each code object in a second plurality of code objects; and

selecting the first plurality of code objects as a subset of the second plurality of code objects, responsive to the identified object type for each code object in the first plurality of code objects being identical.

8. The non-transitory software installation device of claim 1 , wherein the first identifier comprises a transformation disposition.

9. The non-transitory software installation device of claim 1 , wherein identifying each code object in the first plurality of code objects further comprises:

extracting, by the analysis agent, an identifier from each code object in a second plurality of code objects; and

identifying, by the analysis agent, each code object in the first plurality of code objects as a subset of the second plurality of code objects.

10. The non-transitory software installation device of claim 1 , wherein selecting the first plurality of code objects further comprises:

generating a meta-model comprising associations between code objects of the source installation; and

selecting the first plurality of code objects responsive to each code object in the first plurality of code objects being associated with the common same second code object in the generated meta-model.

11. The non-transitory software installation device of claim 1 , wherein the selecting further comprises identifying the common second code object as an associated node on a graph.

12. The non-transitory software installation device of claim 1 , wherein the updating further comprises updating the first plurality of code objects simultaneously.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 12, 2025
From: GASS, ALBRECHT; HETGES, STEFAN; FARADOURIS, NIKOLAOS; FLACH, OLIVER
To: SMARTSHIFT TECHNOLOGIES, INC.
Reel/Frame 070203/0134 →
Continuity (3)
Continuation 16990007 · Aug 11, 2020
Continuation 15890003 · Feb 6, 2018
Related Publication 20240078096A1 · Mar 7, 2024
References Cited (269)
US 5442771A · Filepp et al. · 1995 [cited by applicant]
US 5574898A · Leblang et al. · 1996 [cited by applicant]
US 6298342B1 · Graefe et al. · 2001 [cited by applicant]
US 6367077B1 · Brodersen et al. · 2002 [cited by applicant]
US 6615220B1 · Austin et al. · 2003 [cited by applicant]
US 6968538B2 · Rust et al. · 2005 [cited by applicant]
US 7051319B1 · Thorson et al. · 2006 [cited by applicant]
US 7076778B2 · Brodersen et al. · 2006 [cited by applicant]
US 7080371B1 · Arnaiz et al. · 2006 [cited by applicant]
US 7181694B2 · Reiss et al. · 2007 [cited by applicant]
US 7203938B2 · Ambrose et al. · 2007 [cited by applicant]
US 7240327B2 · Singh et al. · 2007 [cited by applicant]
US 7290244B2 · Peck et al. · 2007 [cited by applicant]
US 7305671B2 · Davidov et al. · 2007 [cited by applicant]
US 7310653B2 · Coyle et al. · 2007 [cited by applicant]
US 7356802B2 · De Sutter et al. · 2008 [cited by applicant]
US 7500234B2 · Hatasaki · 2009 [cited by applicant]
US 7516447B2 · Marvin et al. · 2009 [cited by applicant]
US 7536686B2 · Tan et al. · 2009 [cited by applicant]
US 7584467B2 · Wickham et al. · 2009 [cited by applicant]
US 7593958B2 · Bergstraesser et al. · 2009 [cited by applicant]
US 7614006B2 · Molander · 2009 [cited by applicant]
US 7669188B2 · Nickell et al. · 2010 [cited by applicant]
US 7700680B2 · Costanzi et al. · 2010 [cited by applicant]
US 7711680B2 · Barnes-Leon et al. · 2010 [cited by applicant]
US 7711708B2 · Bergstraesser et al. · 2010 [cited by applicant]
US 7784045B2 · Bowers · 2010 [cited by applicant]
US 7788659B1 · Rimlinger · 2010 [cited by applicant]
US 7802246B1 · Kennedy et al. · 2010 [cited by applicant]
US 7805719B2 · O'Neill · 2010 [cited by applicant]
US 7840955B1 · Weathersby et al. · 2010 [cited by applicant]
US 7865874B2 · Wookey · 2011 [cited by applicant]
US 7870512B2 · Misovski · 2011 [cited by applicant]
US 7895592B2 · Subramanian et al. · 2011 [cited by applicant]
US 7945907B2 · Dreiling et al. · 2011 [cited by applicant]
US 8020146B2 · Hudson, Jr. · 2011 [cited by applicant]
US 8060857B2 · Biggerstaff · 2011 [cited by applicant]
US 8091081B2 · Thorson et al. · 2012 [cited by applicant]
US 8091082B2 · Malik et al. · 2012 [cited by applicant]
US 8122430B2 · De Sutter et al. · 2012 [cited by applicant]
US 8132150B2 · De Sutter et al. · 2012 [cited by applicant]
US 8151256B2 · Ramannavar et al. · 2012 [cited by applicant]
US 8171470B2 · Goldman et al. · 2012 [cited by applicant]
US 8191060B2 · Malasky et al. · 2012 [cited by applicant]
US 8209672B2 · Ivanov · 2012 [cited by applicant]
US 8234638B2 · Bird · 2012 [cited by applicant]
US 8261231B1 · Hirsch et al. · 2012 [cited by applicant]
US 8261256B1 · Adler et al. · 2012 [cited by applicant]
US 8266615B2 · Shapiro · 2012 [cited by applicant]
US 8286132B2 · Yuan et al. · 2012 [cited by applicant]
US 8321834B2 · Baker et al. · 2012 [cited by applicant]
US 8327351B2 · Paladino et al. · 2012 [cited by applicant]
US 8387022B2 · Horning · 2013 [cited by examiner]
US 8413131B2 · Bowers · 2013 [cited by applicant]
US 8423502B1 · Degany et al. · 2013 [cited by applicant]
US 8434060B2 · Driesen et al. · 2013 [cited by applicant]
US 8438562B2 · Sero et al. · 2013 [cited by applicant]
US 8448161B2 · Goldman · 2013 [cited by applicant]
US 8539444B2 · Cao et al. · 2013 [cited by applicant]
US 8572566B2 · Gass et al. · 2013 [cited by applicant]
US 8671222B2 · Gass et al. · 2014 [cited by applicant]
US 8706771B2 · Gass et al. · 2014 [cited by applicant]
US 8707287B2 · Raundahl Gregersen et al. · 2014 [cited by applicant]
US 8739150B2 · Gass et al. · 2014 [cited by applicant]
US 8898627B2 · Gass et al. · 2014 [cited by applicant]
US 9442993B2 · Tung et al. · 2016 [cited by applicant]
US 9633317B2 · Gabel et al. · 2017 [cited by applicant]
US 9811325B2 · Gass et al. · 2017 [cited by applicant]
US 10089103B2 · Gass et al. · 2018 [cited by applicant]
US 10095734B2 · Fontenot et al. · 2018 [cited by applicant]
US 10121268B2 · Baumecker · 2018 [cited by applicant]
US 10157442B1 · Mostak et al. · 2018 [cited by applicant]
US 10248409B1 · Pohlack · 2019 [cited by examiner]
US 10262148B2 · Cote · 2019 [cited by applicant]
US 10338902B1 · Sevigny · 2019 [cited by examiner]
US 10481884B2 · Gass et al. · 2019 [cited by applicant]
US 10515121B1 · Setlur et al. · 2019 [cited by applicant]
US 10528343B2 · Gass et al. · 2020 [cited by applicant]
US 10585655B2 · Gass et al. · 2020 [cited by applicant]
US 10698674B2 · Gass et al. · 2020 [cited by applicant]
US 10740075B2 · Gass et al. · 2020 [cited by applicant]
US 10795660B1 · Sundresh · 2020 [cited by applicant]
US 11099823B2 · Gass et al. · 2021 [cited by applicant]
US 11188319B2 · Gass et al. · 2021 [cited by applicant]
US 11429365B2 · Gass et al. · 2022 [cited by applicant]
US 11436006B2 · Gass et al. · 2022 [cited by applicant]
US 11593342B2 · Gass et al. · 2023 [cited by applicant]
US 11620117B2 · Gass et al. · 2023 [cited by applicant]
US 11726760B2 · Gass et al. · 2023 [cited by applicant]
US 11789715B2 · Gass et al. · 2023 [cited by applicant]
US 20020042849A1 · Ho et al. · 2002 [cited by applicant]
US 20020062475A1 · Iborra et al. · 2002 [cited by applicant]
US 20030028864A1 · Bowen · 2003 [cited by applicant]
US 20030058277A1 · Bowman-Amuah · 2003 [cited by applicant]
US 20030172368A1 · Alumbaugh et al. · 2003 [cited by applicant]
US 20040028864A1 · Nelson · 2004 [cited by applicant]
US 20040068715A1 · Wong et al. · 2004 [cited by applicant]
US 20040073900A1 · Scott · 2004 [cited by applicant]
US 20040252886A1 · Pan et al. · 2004 [cited by applicant]
US 20040268299A1 · Lei et al. · 2004 [cited by applicant]
US 20050010919A1 · Ramanathan et al. · 2005 [cited by applicant]
US 20050097146A1 · Konstantinou et al. · 2005 [cited by applicant]
US 20050120347A1 · Asare et al. · 2005 [cited by applicant]
US 20050177825A1 · Kamalanathan · 2005 [cited by applicant]
US 20050204340A1 · Ruminer · 2005 [cited by examiner]
US 20050251797A1 · Omiya et al. · 2005 [cited by applicant]
US 20050257216A1 · Cornell et al. · 2005 [cited by applicant]
US 20050273705A1 · Mccain · 2005 [cited by applicant]
US 20060101452A1 · Mak · 2006 [cited by applicant]
US 20060123389A1 · Kolawa et al. · 2006 [cited by applicant]
US 20060129605A1 · Doshi · 2006 [cited by applicant]
US 20060130040A1 · Subramanian et al. · 2006 [cited by applicant]
US 20060242197A1 · Tsyganskiy et al. · 2006 [cited by applicant]
US 20060271528A1 · Gorelik · 2006 [cited by applicant]
US 20060288344A1 · Brodersen et al. · 2006 [cited by applicant]
US 20070061780A1 · Pokluda et al. · 2007 [cited by applicant]
US 20070136396A1 · Kulkarni et al. · 2007 [cited by applicant]
US 20070179939A1 · O'Neil et al. · 2007 [cited by applicant]
US 20070226728A1 · Thorson et al. · 2007 [cited by applicant]
US 20080028390A1 · Fors et al. · 2008 [cited by applicant]
US 20080082517A1 · Sattler et al. · 2008 [cited by applicant]
US 20080082972A1 · De Sutter et al. · 2008 [cited by applicant]
US 20080127123A1 · Sattler et al. · 2008 [cited by applicant]
US 20080228770A1 · Halcrow et al. · 2008 [cited by applicant]
US 20080256515A1 · Ponce de Leon · 2008 [cited by applicant]
US 20080295069A1 · Nicholls et al. · 2008 [cited by applicant]
US 20090019426A1 · Baeumer et al. · 2009 [cited by applicant]
US 20090070734A1 · Dixon et al. · 2009 [cited by applicant]
US 20090150866A1 · Schmidt · 2009 [cited by applicant]
US 20090172637A1 · Parikh · 2009 [cited by applicant]
US 20090235232A1 · Malik et al. · 2009 [cited by applicant]
US 20090300579A1 · Dutta et al. · 2009 [cited by applicant]
US 20090313601A1 · Baird et al. · 2009 [cited by applicant]
US 20100082386A1 · Cao et al. · 2010 [cited by applicant]
US 20100082407A1 · Akkiraju et al. · 2010 [cited by applicant]
US 20110077958A1 · Breitenstein et al. · 2011 [cited by applicant]
US 20110078211A1 · Gass et al. · 2011 [cited by applicant]
US 20110078667A1 · Dolby et al. · 2011 [cited by applicant]
US 20110107103A1 · Dehaan et al. · 2011 [cited by applicant]
US 20110161952A1 · Poddar et al. · 2011 [cited by applicant]
US 20110219361A1 · Dolby et al. · 2011 [cited by applicant]
US 20110225575A1 · Ningombam et al. · 2011 [cited by applicant]
US 20110282995A1 · Gass et al. · 2011 [cited by applicant]
US 20110283256A1 · Raundahl Gregersen et al. · 2011 [cited by applicant]
US 20110283269A1 · Gass · 2011 [cited by examiner]
US 20110283270A1 · Gass et al. · 2011 [cited by applicant]
US 20110296391A1 · Gass et al. · 2011 [cited by applicant]
US 20110302563A1 · Li · 2011 [cited by applicant]
US 20120102451A1 · Kulkarni et al. · 2012 [cited by applicant]
US 20120167036A1 · Tanaka et al. · 2012 [cited by applicant]
US 20120173515A1 · Jeong et al. · 2012 [cited by applicant]
US 20120192143A1 · Elaasar · 2012 [cited by examiner]
US 20120246170A1 · Iantorno · 2012 [cited by applicant]
US 20120254113A1 · Theroux et al. · 2012 [cited by applicant]
US 20120265727A1 · Naryzhnyy et al. · 2012 [cited by applicant]
US 20120284389A1 · Azagury et al. · 2012 [cited by applicant]
US 20130013248A1 · Brugler et al. · 2013 [cited by applicant]
US 20130060507A1 · Kianovski et al. · 2013 [cited by applicant]
US 20130239098A1 · Ichii et al. · 2013 [cited by applicant]
US 20130268916A1 · Misra · 2013 [cited by examiner]
US 20130268927A1 · Cochran · 2013 [cited by applicant]
US 20130283106A1 · King et al. · 2013 [cited by applicant]
US 20140130036A1 · Gurikar et al. · 2014 [cited by applicant]
US 20140173561A1 · Toub · 2014 [cited by applicant]
US 20140208316A1 · Ciano et al. · 2014 [cited by applicant]
US 20140215446A1 · Araya et al. · 2014 [cited by applicant]
US 20140281247A1 · Loaiza et al. · 2014 [cited by applicant]
US 20140282466A1 · Feldman et al. · 2014 [cited by applicant]
US 20150070379A1 · Fan et al. · 2015 [cited by applicant]
US 20150082296A1 · Thomas et al. · 2015 [cited by applicant]
US 20150143339A1 · Rajanna et al. · 2015 [cited by applicant]
US 20150205705A1 · Yates · 2015 [cited by applicant]
US 20150234642A1 · Araya et al. · 2015 [cited by applicant]
US 20150278110A1 · Gshwind · 2015 [cited by applicant]
US 20150339119A1 · Rehman · 2015 [cited by examiner]
US 20150348294A1 · Sridharan et al. · 2015 [cited by applicant]
US 20150363294A1 · Carback, III et al. · 2015 [cited by applicant]
US 20160041816A1 · Yang et al. · 2016 [cited by applicant]
US 20160092204A1 · Katkere et al. · 2016 [cited by applicant]
US 20160124966A1 · Cohen · 2016 [cited by examiner]
US 20160275159A1 · Jarvie et al. · 2016 [cited by applicant]
US 20160321307A1 · Dingman et al. · 2016 [cited by applicant]
US 20160335278A1 · Tabaaloute · 2016 [cited by examiner]
US 20160371351A1 · Kura et al. · 2016 [cited by applicant]
US 20160378445A1 · Kashiwagi et al. · 2016 [cited by applicant]
US 20170017475A1 · Tabaru · 2017 [cited by applicant]
US 20170039372A1 · Koval et al. · 2017 [cited by applicant]
US 20170060540A1 · Allen et al. · 2017 [cited by applicant]
US 20170083572A1 · Tankersley et al. · 2017 [cited by applicant]
US 20170090916A1 · Nishikawa et al. · 2017 [cited by applicant]
US 20170131872A1 · Husain · 2017 [cited by applicant]
US 20170139705A1 · Grisa et al. · 2017 [cited by applicant]
US 20170139952A1 · Arasan et al. · 2017 [cited by applicant]
US 20170147324A1 · Weber et al. · 2017 [cited by applicant]
US 20170147681A1 · Tankersley et al. · 2017 [cited by applicant]
US 20170242671A1 · Edler Von Koch et al. · 2017 [cited by applicant]
US 20170293668A1 · Crabtree et al. · 2017 [cited by applicant]
US 20170300206A1 · Rosinko et al. · 2017 [cited by applicant]
US 20170300306A1 · De et al. · 2017 [cited by applicant]
US 20170308372A1 · Thomas et al. · 2017 [cited by applicant]
US 20180075042A1 · Cruz et al. · 2018 [cited by applicant]
US 20180081650A1 · Larin · 2018 [cited by examiner]
US 20180088936A1 · Tanimoto et al. · 2018 [cited by applicant]
US 20180096053A1 · Panwar · 2018 [cited by examiner]
US 20180150528A1 · Shah et al. · 2018 [cited by applicant]
US 20180232227A1 · Deol et al. · 2018 [cited by applicant]
US 20180246703A1 · Ren et al. · 2018 [cited by applicant]
US 20180247235A1 · Williger · 2018 [cited by examiner]
US 20180336018A1 · Lu et al. · 2018 [cited by applicant]
US 20180349105A1 · Makkar · 2018 [cited by applicant]
US 20180352218A1 · Abe · 2018 [cited by applicant]
US 20180357051A1 · Puszkiewicz · 2018 [cited by examiner]
US 20180373504A1 · Chatty et al. · 2018 [cited by applicant]
US 20180373509A1 · Zhang · 2018 [cited by examiner]
US 20190043231A1 · Uzgin et al. · 2019 [cited by applicant]
US 20190050463A1 · Goradia et al. · 2019 [cited by applicant]
US 20190079754A1 · Makkar · 2019 [cited by applicant]
US 20190138428A1 · Sumitomo · 2019 [cited by examiner]
US 20190171438A1 · Franchitti · 2019 [cited by examiner]
US 20190279402A1 · Panetta et al. · 2019 [cited by applicant]
US 20190391791A1 · Bebee et al. · 2019 [cited by applicant]
US 20200334021A1 · Bucuvalas et al. · 2020 [cited by applicant]
DE 112015003587T5 · 2017 [cited by applicant]
WO 2001048601A2 · 2001 [cited by applicant]
WO 2011041246A1 · 2011 [cited by applicant]
WO WO2012017757A1 · 2012 [cited by examiner]
WO 2014130733A1 · 2014 [cited by applicant]
Zhengong Cai, A Pattern-Based Code Transformation Approach for Cloud Application Migration, 2015, pp. 1-8. https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7214025 (Year: 2015). [cited by examiner]
English translation, Takahashi Kazuaki (WO2012017757 A1), 2012, pp. 1-25. (Year: 2012). [cited by examiner]
Martim Carbone, Mapping Kernel Objects to Enable Systematic Integrity Checking, 2009, pp. 1-11. https://dl.acm.org/doi/pdf/10.1145/1653662.1653729 (Year: 2009). [cited by examiner]
Aveg Ashish, Clones Clustering Using K-Means, 2016, pp. 1-6. https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7726943 (Year: 2016). [cited by examiner]
Xu et al., “Data-Driven Shape Analysis and Processing”, 2016, pp. 1-38, https://dl.acm.org/doi/pdf/10.1145/2988458.2988473. [cited by applicant]
Bedini et al., “Transforming XML Schema to OWL Using Patterns”, 2011, IEEE, pp. 102-109, DOI: 10.1109/ICSC.2011.77. [cited by applicant]
Bourgeois et al., “Extending Executability of Applications on Varied Target Platforms”, IEEE International Conference on High Performance Computing and Communications, 2011, pp. 253-260. [cited by applicant]
Buschle et al., “Automating Enterprise Architecture Documentation using an Enterprise Service Bus”, Aug. 2012, Americas Conference on Information Systems (AMCIS), 16 pages. [cited by applicant]
Carbone et al., “Mapping Kernel Objects to Enable Systematic Integrity Checking”, 2009, ACM. [cited by applicant]
Daniels, “Transposing the rows and columns of a 2D array, jagged array and string in C#”, Code Project, Jul. 21, 2014. [cited by applicant]
Detten et al, “Combining Clustering and Pattern Detection for the Reengineering of Component-based Software Systems” ACM, 2011, pp. 23-32. [cited by applicant]
Dimitroulakos et al., “A Source-To-Source Compiler for Dynamic Code Analysis and Loop Transformations”, 2012, pp. 1-2. [cited by applicant]
Fischer et al., “Engage: A Deployment Management System”, Jun. 2012, ACM, pp. 263-273. [cited by applicant]
Gabriel et al., “Conscientious Software”, ACM, Oct. 2006, pp. 433-450. [cited by applicant]
Girardi et al, “An Ontology-based Knowledge Base for the Representation and Reuse of Software Patterns”, ACM SIGSOFT, 2006, pp. 1-6, vol. 31, No. 1. [cited by applicant]
Heydon et al., “The Vesta Approach to Software Configuraitn Management”, 1999, pp. 1-10. [cited by applicant]
Janjusic et al., “Trace Driven Data Structure Transformations”, IEEE, 2012, pp. 456-464. [cited by applicant]
Kobayashi et al, “Object-Oriented Modeling of Software Patterns” IEEE, 2001, pp. 100-109. [cited by applicant]
Kodhai et al., “Detecting and Investigating the Source Code Changes using Logical rules”, 2014, pp. 1603-1608. [cited by applicant]
Kuhfeld, “Heat Maps: Graphically Displaying Big Data and Small Tables”, 2017, pp. 1-20. [cited by applicant]
Lattner et al., “LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation”, International Symposium on Code Generation and Optimization, 2004, pp. 1-12. [cited by applicant]
Ledur et al., “Towards a Domain-Specific Language for Geospatial Data Visualization Maps with Big Data Sets”, 2015, pp. 1-8. [cited by applicant]
Lewandowski, “Frameworks for Compuonent-Based Client/Server Computing”, ACM Computing Surveys, Mar. 1998, pp. 3-27, vol. 30, No. 1. [cited by applicant]
Lin et al., An Empirical Study on the Characteristics of Python Fine-Grained Source Code Change Types, 2016, IEEE, pp. 188-199, DOI: 10.1109/ICSME.2016.25. [cited by applicant]
Martins et al., “A Clustering-Based Approach for Exploring Sequences of Compiler Optimizations”, 2014, pp. 2436-2443. [cited by applicant]
Martins et al., “Clustering-Based Selection for the Exploration of Compiler Optimization Sequences”, ACM Transactions on Architecture and Code Optimization, Mar. 2016, 28 pages, vol. 13, No. 1, Article 8. [cited by applicant]
Phankokkruad, “Classification of File Duplication by Hierarchical Clustering Based on Similarity Relations”, IEEE, 2017, pp. 1598-1563. [cited by applicant]
Rolim et al., “Learning Syntactic Program Transformations from Examples”, 2017, pp. 1-12. [cited by applicant]
Schanne et al., “Adding Automic Functionality to Object-Oriented Applications”, 6 pages. [cited by applicant]
Schindler et al., “Clustering Source Code Elements by Semantic Similarity Using Wikipedia”, 2015 IEEE/ACM 4th International Workshop on Realizing AI Synergies in Software Engineering, 6 pages, DOI 10.1109/Raise.2015.10. [cited by applicant]
Sethi et al., “Rapid Deployment of SOA Solutions via Automated Image Replication and Reconfiguration”, 2008, IEEE, 8 pages. [cited by applicant]
Siddiqui et al, “Glare: A Grid Activity Registration, Deployment and Provisioning Framework”, ACM, 2005, 12 pages. [cited by applicant]
Siegel, “Automatic Configuratin of Dynamically Alterable Object Oriented Systems”; IEEE, 1993, pp. 158-161. [cited by applicant]
Stepan, “Design Pattern Solutions as Explicit Entities in Component-based Software Development”, ACM, Jun. 2011, pp. 9-16. [cited by applicant]
Vetterli et al., “Metadata Standards for Data Warehousing: Open Information Model vs. Common Warehouse Metamodel”, ACM, Sep. 2000, 8 pages. [cited by applicant]
Ward et al., “Workload Migration into Clouds—Challenges, Experiences, Opportunities”, 2010, IEEE, pp. 164-171, DOI: 10.1109/Cloud.2010.84. [cited by applicant]
Ye et al., “Providing Access Control through Program Transformation”, IEEE, 2011, pp. 12-17, DOI: 10.1109/PDCAT.2011.71. [cited by applicant]
Zhengong et al., “A Pattern-Based Code Transformation Approach for Cloud Application Migration”, IEEE 8th International Conference on Cloud Computing, 2015, pp. 33-40. [cited by applicant]
Zhong et al., “The Application of K-Means Clustering Algorithm Based on Hadoop”, IEEE, 2016, pp. 88-92. [cited by applicant]
Beller et al., “Analyzing the State of Static Analysis: A Large-Scale Evaluation in Open Source Software”, 2016, pp. 1-12, https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7476667. [cited by applicant]
Forite et al., “FASMM: Fast and Accessible Software Migration Method”, 12 pages. [cited by applicant]
Zapata et al., “How to Speed up Software Migration and Modernization: Successful Strategies Developed by Precisiating Expert Knowledge”, 2015, 6 pages, https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7284166. [cited by applicant]
Cited By (3)
US 12,493,968 US 12,498,915 US 12,524,217