22 papers:
CSMR-WCRE-2014-KashiwabaraOIHYI #mining #recommendation #using- Recommending verbs for rename method using association rule mining (YK, YO, TI, YH, TY, KI), pp. 323–327.
ECOOP-2014-MayerS #automation #domain-specific language #framework #java #multi #refactoring- Automated Multi-Language Artifact Binding and Rename Refactoring between Java and DSLs Used by Java Frameworks (PM, AS), pp. 437–462.
OOPSLA-2013-FeldthausM #automation #javascript #refactoring- Semi-automatic rename refactoring for JavaScript (AF, AM), pp. 323–338.
ICSE-2012-NguyenNNN #detection #named #web- BabelRef: Detection and renaming tool for cross-language program entities in dynamic web applications (HVN, HAN, TTN, TNN), pp. 1391–1394.
MSR-2011-EshkevariAPOGA #case study #identifier- An exploratory study of identifier renamings (LME, VA, MDP, RO, YGG, GA), pp. 33–42.
ICPC-2010-JablonskiH #identifier- Renaming Parts of Identifiers Consistently within Code Clones (PJ, DH), pp. 38–39.
SAC-2010-KimJJ- Dynamic register-renaming scheme for reducing power-density and temperature (JK, STJ, CSJ), pp. 231–237.
- OOPSLA-2008-SchaferEM #java
- Sound and extensible renaming for java (MS, TE, OdM), pp. 277–294.
SAT-2008-KottlerKS- Computation of Renameable Horn Backdoors (SK, MK, CS), pp. 154–160.
- SAT-2007-LangloisST #bound
- Horn Upper Bounds and Renaming (ML, RHS, GT), pp. 80–93.
- SAT-2005-Coste-MarquisBL #branch #heuristic #quantifier
- A Branching Heuristics for Quantified Renamable Horn Formulas (SCM, DLB, FL), pp. 393–399.
DAC-2004-ShehataA #composition #verification- A general decomposition strategy for verifying register renaming (HIS, MA), pp. 234–237.
CGO-2004-RastelloFG #constraints #optimisation #using- Optimizing Translation Out of SSA Using Renaming Constraints (FR, FdF, CG), pp. 265–278.
SCAM-2003-GuoCD #java #using- Unique Renaming of Java Using Source Transformation (XG, JRC, TRD), pp. 151–160.
UML-2002-ClarkEK #metamodelling- A Metamodel for Package Extension with Renaming (TC, AE, SK), pp. 305–320.
SAT-2002-BueningX #complexity #morphism #satisfiability- The complexity of homomorphisms and renamings of minimal unsatisfiable formulas (HKB, DX), p. 9.
HPCA-2001-WangWKRS #execution #scheduling- Register Renaming and Scheduling for Dynamic Execution of Predicated Code (PHW, HW, RMK, KR, JPS), pp. 15–25.
ASE-2000-MalpohlHT #detection- Renaming Detection (GM, JJH, WFT), pp. 73–80.
LOPSTR-1998-BrogiCT #source code- The Use of Renaming in Composing General Programs (AB, SC, FT), pp. 124–142.
ICSM-1994-AmmannC #in the large- Inter-Module Renaming and Reorganizing: Examples of Program Manipulation-in-the-Large (MMA, RDC), pp. 354–361.
CADE-1990-Tour- Minimizing the Number of Clauses by Renaming (TBdlT), pp. 558–572.
ICALP-1977-HopnerO- Renaming and Erasing in Szilard Languages (MH, MO), pp. 244–257.
