Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Puneet Kapur

dblp:25/3221 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2010
0000-0001-8821-9012ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 3 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Software maintenance and evolution · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Software maintenance and evolution › software reengineering › software modernization › software migration
library migration
0.112010
Refactoring references for library migration · OOPSLA 2010
Software maintenance and evolution
refactoring
0.112010
Refactoring references for library migration · OOPSLA 2010
Software maintenance and evolution
software ecosystems
0.112010
Refactoring references for library migration · OOPSLA 2010

Methods — techniques the papers use, named apart from their topics

automated refactoring · 0.1
YearPublicationVenuePosition
2010 Refactoring references for library migration
abstract
Automated refactoring is a key feature of modern IDEs. Existing refactorings rely on the transformation of source code declarations, in which references may also be transformed as a side effect. However, there exist situations in which a declaration is not available for refactoring or would be inappropriate to transform, for example, in the presence of dangling references or where a set of references should be retargeted to a different declaration.
Puneet Kapur, Bradley Cossette, Robert J. Walker
OOPSLA1
2010 Studying the impact of uncertainty in operational release planning - An integrated method and its initial evaluation
Ahmed Al-Emran, Puneet Kapur, Dietmar Pfahl, Günther Ruhe
Inf. Softw. Technol.2
2008 Optimized staffing for product releases and its application at Chartwell Technology
abstract
Abstract Release planning for incremental software development assigns features to releases such that technical, resource, risk and budget constraints are met. Each feature offers a piece of functionality. A feature can be offered as part of a release only if all its necessary tasks are done before the given release date. These tasks require different skills. Staffing for product releases as considered in this paper is the process of assigning human resources from a given pool of developers who might have varying levels of skill to perform different tasks. In addition to that, we consider time windows of absence of the developers. The primary goal of staffing is to provide product releases of best quality where quality means offering the most attractive features to customers in a timely manner. We call the problem STAFF‐PRO. The problem is known to be NP‐complete. Consequently, we have to be satisfied with solutions that are sufficiently good, but not necessarily optimal in the case of mid‐sized or large problems. Search‐based methods relying on meta‐heuristics have been proven to be successful in similar contexts. In this research, a focused search (FS) method is presented. This refers to a two‐phased solution approach where Phase 1 applies integer linear programming to a relaxed version of the full problem. Its solution is used as a starting point to perform FS in a reduced search space in Phase 2. The search itself is conducted by a genetic algorithm. It generates a solution that fulfills all the stated resource and scheduling constraints and is of a proven degree of optimality. We performed an empirical analysis of the proposed solution approach by comparing FS and unfocused search (UFS) (without Phase 1) for a series of 200 test examples. On average, FS performs about 15% better than UFS. The whole method was applied as an industrial case study performed at Chartwell Technology. The case study demonstrates that application of the FS method to STAFF‐PRO (i) allows a reduction in the time needed for generating acceptable staffing plans, (ii) generates plans of proven quality that are better than manual plans and (iii) supports the various types of re‐planning necessary for varying parameters, budgets and resource. Copyright © 2008 John Wiley & Sons, Ltd.
Puneet Kapur, An Ngo-The, Günther Ruhe
J. Softw. Maintenance Res. Pract.1