Results 251 to 260 of about 11,897 (300)
Some of the next articles are maybe not open access.
Automated Software Engineering, 2000
Finding changed identifiers in programs is important for program comparison and merging. Comparing two versions of a program is complicated if renaming has occurred. Textual merging is highly unreliable if, in one version, identifiers were renamed, while in the other version, code using the old identifiers was added or modified.
Malpohl, Guido +2 more
openaire +1 more source
Finding changed identifiers in programs is important for program comparison and merging. Comparing two versions of a program is complicated if renaming has occurred. Textual merging is highly unreliable if, in one version, identifiers were renamed, while in the other version, code using the old identifiers was added or modified.
Malpohl, Guido +2 more
openaire +1 more source
Cancer Investigation, 2007
A subset of breast cancer survivors are reporting cognitive impairment after cancer treatment, which has commonly been attributed to the receipt of chemotherapy and colloquially termed "chemobrain." For some, a fear of this side effect enters into their decision regarding therapy.
Arti, Hurria, George, Somlo, Tim, Ahles
openaire +2 more sources
A subset of breast cancer survivors are reporting cognitive impairment after cancer treatment, which has commonly been attributed to the receipt of chemotherapy and colloquially termed "chemobrain." For some, a fear of this side effect enters into their decision regarding therapy.
Arti, Hurria, George, Somlo, Tim, Ahles
openaire +2 more sources
Identifying Renaming Opportunities by Expanding Conducted Rename Refactorings
IEEE Transactions on Software Engineering, 2015To facilitate software refactoring, a number of approaches and tools have been proposed to suggest where refactorings should be conducted. However, identification of such refactoring opportunities is usually difficult because it often involves difficult semantic analysis and it is often influenced by many factors besides source code.
Hui Liu 0003 +3 more
openaire +1 more source
Recommending rename refactorings
Proceedings of the 2nd International Workshop on Recommendation Systems for Software Engineering, 2010Variable names play a major role in program comprehension. However, their choice is often subject to the intuition (or intention) of individual programmers: although code conventions and style guides may constrain identifier usage, programmers are individuals naming program concepts individually.
Andreas Thies, Christian Roth
openaire +1 more source
2008
We study the group renaming task, which is a natural generalization of the renaming task. An instance of this task consists of n processors, partitioned into m groups, each of at most g processors. Each processor knows the name of its group, which is in { 1, ..., M }. The task of each processor is to choose a new name for its group such that processors
Yehuda Afek +4 more
openaire +1 more source
We study the group renaming task, which is a natural generalization of the renaming task. An instance of this task consists of n processors, partitioned into m groups, each of at most g processors. Each processor knows the name of its group, which is in { 1, ..., M }. The task of each processor is to choose a new name for its group such that processors
Yehuda Afek +4 more
openaire +1 more source
2020 43rd International Convention on Information, Communication and Electronic Technology (MIPRO), 2020
Register renaming unit is a bottleneck in the superscalar cores because it limits the number of instructions and the number of threads that may concurrently be processed. We propose a register renaming unit with linear complexity with respect to the number of instructions simultaneously renamed.
openaire +1 more source
Register renaming unit is a bottleneck in the superscalar cores because it limits the number of instructions and the number of threads that may concurrently be processed. We propose a register renaming unit with linear complexity with respect to the number of instructions simultaneously renamed.
openaire +1 more source
On the Boosting of Instruction Scheduling by Renaming
The Journal of Supercomputing, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
L. Wang, Ted C. Yang
openaire +1 more source
Physics World, 2023
Robert P Crease reveals what Physics World readers told him about whether we should airbrush out physicists who’ve done bad things in the past – and what he thinks.
openaire +1 more source
Robert P Crease reveals what Physics World readers told him about whether we should airbrush out physicists who’ve done bad things in the past – and what he thinks.
openaire +1 more source
An introduction to the renaming problem
2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings., 2003The aim of this paper is to provide a brief introduction to the renaming problem for unfamiliar readers. In the renaming problem the processes have to acquire new names from a small bounded space despite possible process crashes and asynchrony. The problem is first introduced. Then two solutions are presented.
openaire +1 more source
2008
Nominal techniques are based on the idea of sets with a finitely-supported atoms-permutation action. We consider the idea of nominal renaming sets , which are sets with a finitely-supported atoms-renaming action; renamings can identify atoms, permutations cannot.
Murdoch James Gabbay +1 more
openaire +1 more source
Nominal techniques are based on the idea of sets with a finitely-supported atoms-permutation action. We consider the idea of nominal renaming sets , which are sets with a finitely-supported atoms-renaming action; renamings can identify atoms, permutations cannot.
Murdoch James Gabbay +1 more
openaire +1 more source