Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “code modification”

Simultaneous Modification Support based on Code Clone Analysis

Yoshiki Higo, Yasushi Ueda, Shinji Kusumoto et al. · Proceedings - Asia Pacific Software Engineering Conference/Proceedings · 2007

Maintaining software systems becomes more difficult as their size and complexity increase. One factor that makes software maintenance more difficult is the presence of code clones. A code clone is defined as a code fragment occurring more than once in identical or similar form into a software system. For example, the presence of code clones is a big factor of overlooking some places that should be modified simultaneously. One technique that helps the number of code clones is refactoring. There are several research efforts that provide support to refactor code clones, but unfortunately some code clones cannot or should not be refactored (ex. stereotyped process, absence of abstraction functionality, performance enhancement). In order to support maintaining the consistency among code clones, we propose a simultaneous modification support method. Given a software system, firstly, a maintainer identifies a code fragment that must be modified. Then, only the code clones between the identified code fragment and the source files of the software system are detected. We developed a simultaneous modification support tool, Libra, and applied it to open source software systems. The results showed that Libra was a good searching tool as much as grep, which is a useful tool of UNIX.

Cited by 27

Modification of Large-Displacement, Elastic/Plastic Computer Code

Donald Mason · 1977

Abstract : The capability of AFWL/DES to analyze certain classes of cratering problems (e.g., cratering in a thinly layered media) has been limited by difficulties that one of the currently used computer codes has in processing problems in which both strength and material mixing are significant. An attempt to rectify this limitation was made by implementing the engineering equation-of-state presently being used for cratering calculations into an existing large-displacement, elastic/plastic computer code (CSQII). The modified code was then evaluated.

Cited by 0

Using Context and Hierarchy Features to Enhance Code Completion in Code Modification Scenarios

Linhai Li, Mingjie Xing, Ling Li · Proceedings/Proceedings of the ... International Conference on Software Engineering and Knowledge Engineering · 2024

Automated software development has always been a research hotspot in the field of software engineering, and code completion can be regarded as a key technology.Currently, many studies on code completion regard the context of prediction as code that strictly appears before the cursor, and have not fully considered the use of code around the cursor for code modification scenarios.Meanwhile, the code serialization method has been developed from source code serialization to Abstract Syntax Tree (AST) serialization.However, AST serialization may lose original structure information.To solve these problems we propose contextual AST serialization (CAS) method, which can more accurately predict AST nodes by capturing the semantic association, context information and structure information between AST nodes.CAS not only converts AST nodes into sequences, but also connects AST sequences with the surrounding context to form richer representations.we conduct empirical studies using a standard Python dataset.The results demonstrate that CAS serialization method significantly improves the code prediction accuracy of the model, the MRR of various types of next token predictions is improved by 15.8% compared to TravTrans on average, and that of type node is improved by 19.4% on average.

Cited by 0Open access

Appendix C: Modification to Unigrid Code for Local Refinement

Stephen F. McCormick · 1992

Below is a listing of the code segment for modifying the global-grid unigrid routine given in Appendix A. It is to be used to convert the finest level to a local grid patch covering the lower left-hand quadrant of the unit square.

Cited by 0

Modification of the simulation code BLonD for lepton rings

Muller, J. F. Esteban · Zenodo (CERN European Organization for Nuclear Research) · 2017

BLonD is a macroparticle simulation code developed at CERN for longitudinal beam dynamics studies, which has been extensively used for hadron synchrotrons. This Note describes the new features included in BLonD to incorporate synchrotron radiation and quantum excitation effects, which enables the use of the code for stability studies in lepton rings. Examples of the application to the FCC-ee case are also presented.

Cited by 0Open access

Multiple-Plate Modification of QUICKE2 Analytical Electron Emission Code.

Shelley R. Rogers, Andrew J. Woods · Defense Technical Information Center (DTIC) · 1976

This report examines the performance of the QUICKE2 source code. The version referred to in this report contains an IRT Corp. modification to accommodate photon attenuation and electron emission for multiple layers. Numerous comparisons are made of QUICKE2 calculations with other computer codes and with experiments for a variety of conditions. Information of a practical nature, necessary for modeling problems with the code, is provided. Specific input requirements are listed and outputs are interpreted by means of a sample problem.

Cited by 4

A Reverse Modification Method for Binary Code and Data

Lei Yu, Yucong Duan · Sensors · 2022

This paper reveals the hidden dangers of reverse data modifications on distributed software with network synchronization, during the era of 5G, which may occur in more important domains, such as telemedicine and automatic driving. We used pseudo-codes to formally elaborate the distributed software architectures and design patterns. It is necessary to deal with three challenges for the modification of binary code and data in the distributed software architectures: (1) the base virtual addresses of software objects are changed frequently for safety; (2) prior knowledge of the reverse is not considered; (3) system memory values of some target objects are changed with extreme speed. For this purpose, a novel reverse modification method for binary code and data is proposed. According to the knowledge-based rules, our method can manipulate physical data, sight data, animation data, etc., while the game synchronization mechanism cannot detect the changes. The implementation details of our method are presented using high-level programming languages (C++) and low-level programming languages (assembly), based on multiple snippets, so that readers can understand both the overall distributed software developments and the corresponding reverse processes. In particular, two network games are used for the demonstrations in this paper. The demonstration results show that our proposed methodology is efficient (as proved by formulas and practices) to manipulate the codes and data of distributed software using a synchronization mechanism.

Cited by 0Open access

Modification of the ssapre algorithm for semantic code motion

D.S. Gurchenkov · Proceedings. The 8th Russian-Korean International Symposium on Science and Technology, 2004. KORUS 2004. · 2005

Code motion (CM) is a technique for program transformation aimed at removing program statements that are redundant due to recomputing previously produced values. Such transformations improve the program performance and decrease its size, so redundancy elimination is employed by all optimizing compilers. Most of the algorithms used in production compilers perform syntactic code motion [1] in the sense that they find and remove redundancy between lexically identical expressions. This paper presents an improvement over the well-known SSAPRE algorithm that was previously limited to syntactic code motion. The proposed modification increases the algorithm strength by capturing the redundancy carried through assignment statements, including code patterns that cannot be optimized by any existing CM technique. The presented algorithm can be thought of as semantic code motion.

Cited by 0

ICD10 Code Modification Corresponding to DPC System in Japan

Makoto Anan, Kazuaki Kuwabara, Yoko Hisatomi et al. · Asian Pacific Journal of Disease Management · 2009

In order to realize the informatizaton of health system, it is indispensible to standardize the data format. That is, a set of standard code of diagnoses and procedures is necessary. In Japan, there are little problems for coding of procedures, because the coding system of procedures has been already introduced into the claim processing computer system. On the contrary, the coding of diagnosis has problems for its correctness. The two mains reasons are immature ability of clinical coders and intrinsic ambiguity of ICD structure. In order to solve these problems, we have investigated the coding quality based on the Japanese casemix data, so called DPC data. Using the research results, we have categorized the pattern of mistakes and developed a set of additional code for accurate ICD indexing.

Cited by 1Open access

Source Code for: Lava Flow Modification of the Wrinkle Ridges

liujianfei1, Pan, Lu · Zenodo (CERN European Organization for Nuclear Research) · 2025

Overview This release contains the collection of Python scripts used for data analysis, processing, and visualization in the manuscript "Lava Flow Modification of the Wrinkle Ridges in the Late Amazonian Volcanic Unit on Mars". The code allows for the reproduction of the figures and the calculation of parameters presented in the study. Data Processing Relocate.py: Relocates the surface pick (max value within ±10 pixels) and subsurface interface pick (max value within ±7 pixels) based on energy. Dependencies: caltime.py, readroi.py, re_dupli.py, findlatlon.py. ROI_relocated: This folder contains the relocated interface, with files named according to the corresponding SHARAD track numbers.

Cited by 0Open access