Christopher Brown

Christopher Brown

Auto-generated profile, based on publicly available information

Christopher Brown

University of St Andrews

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 2018 in Future Generation Computer Systems
Verified
Journal Article
Closed access
ABAdam D. Barwell
Adam D. Barwell
CBChristopher Brown
Christopher Brown
KHKevin Hammond
Kevin Hammond

3 September 2013 in International Journal of Parallel Programming
Verified
Journal Article
Closed access
PDF file
CBChristopher Brown
Christopher Brown
MDMarco Danelutto
Marco Danelutto
KHKevin Hammond
Kevin Hammond
PKPeter Kilpatrick
Peter Kilpatrick
AEArchibald Elliott
Archibald Elliott

18 January 2010
Verified
Conference Paper
Open access
PDF file
CBChristopher Brown
Christopher Brown
STSimon Thompson
Simon Thompson
Duplicated code is a well known problem in software maintenance and refactoring. Code clones tend to increase program size and several studies have shown that duplicated code makes maintenance and code understanding more complex and time consuming. This paper presents a new technique for the detection and removal of duplicated Haskell code. The system is implemented within the refactoring framework of the Haskell Refactorer (HaRe), and uses an Abstract Syntax Tree (AST) based approach. Detection of duplicate code is automatic, while elimination is semi-automatic, with the user managing the clone removal. After presenting the system, an example is given to show how it works in practice.

1 January 2013
Verified
Book Chapter
Closed access
PDF file
KHKevin Hammond
Kevin Hammond
MAMarco Aldinucci
Marco Aldinucci
CBChristopher Brown
Christopher Brown
FCFrancesco Cesarini
Francesco Cesarini
MDMarco Danelutto
Marco Danelutto
GSGilad Shainer
Gilad Shainer

3 September 2014
Verified
Conference Paper
Open access
IBIstván Bozó
István Bozó
VFViktoria Fordós
Viktoria Fordós
ZHZoltán Horvath
Zoltán Horvath
MTMelinda Tóth
Melinda Tóth
DHDániel Horpácsi
Dániel Horpácsi
KHKevin Hammond
Kevin Hammond

1 February 2016
Verified
Conference Paper
Closed access
VJV. Janjic
V. Janjic
CBC. Brown
C. Brown
KMK. Mackenzie
K. Mackenzie
KHK. Hammond
K. Hammond
MDM. Danelutto
M. Danelutto
JGJ. Daniel Garcia
J. Daniel Garcia
Parallelising sequential applications is usually a very hard job, due to many different ways in which an application can be parallelised and a large number of programming models (each with its own advantages and disadvantages) that can be used. In this paper, we describe a method to semi-automatically generate and evaluate different parallelisations of the same application, allowing programmers to find the best parallelisation without significant manual reengineering of the code. We describe a novel, high-level domain-specific language, Refactoring Pattern Language (RPL), that is used to represent the parallel structure of an application and to capture its extra-functional properties (such as service time). We then describe a set of RPL rewrite rules that can be used to generate alternative, but semantically equivalent, parallel structures (parallelisations) of the same application. We also describe the RPL Shell that can be used to evaluate these parallelisations, in terms of the desired extra-functional properties. Finally, we describe a set of C++ refactorings, targeting OpenMP, Intel TBB and FastFlow parallel programming models, that semi-automatically apply the desired parallelisation to the application's source code, therefore giving a parallel version of the code. We demonstrate how the RPL and the refactoring rules can be used to derive efficient parallelisations of two realistic C++ use cases (Image Convolution and Ant Colony Optimisation).