Laurence Tratt

Laurence Tratt

Auto-generated profile, based on publicly available information

Laurence Tratt

King's College London, London, United Kingdom

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

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

Representative Publications

View All Publications
7 July 2007
Verified
Conference Paper
Open access
PDF file
MHMark Harman
Mark Harman
LTLaurence Tratt
Laurence Tratt
Refactoring aims to improve the quality of a software systems' structure, which tends to degrade as the system evolves. While manually determining useful refactorings can be challenging, search based techniques can automatically discover useful refactorings. Current search based refactoring approaches require metrics to be combined in a complex fashion, and producea single sequence of refactorings. In this paper we show how Pareto optimality can improve search based refactoring, making the combination of metrics easier, and aiding the presentation of multiple sequences of optimal refactorings to users.

12 October 2017 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
BABarrett
Barrett
CBCarl Friedrich Bolz-Tereick
Carl Friedrich Bolz-Tereick
RKRebecca Killick
Rebecca Killick
SMSarah Mount
Sarah Mount
LTLaurence Tratt
Laurence Tratt
Virtual Machines (VMs) with Just-In-Time (JIT) compilers are traditionally thought to execute programs in two phases: the initial warmup phase determines which parts of a program would most benefit from dynamic compilation, before JIT compiling those parts into machine code; subsequently the program is said to be at a steady state of peak performance. Measurement methodologies almost always discard data collected during the warmup phase such that reported measurements focus entirely on peak performance. We introduce a fully automated statistical approach, based on changepoint analysis, which allows us to determine if a program has reached a steady state and, if so, whether that represents peak performance or not. Using this, we show that even when run in the most controlled of circumstances, small, deterministic, widely studied microbenchmarks often fail to reach a steady state of peak performance on a variety of common VMs. Repeating our experiment on 3 different machines, we found that at most 43.5% of pairs consistently reach a steady state of peak performance.

1 December 2015 in Computer Languages, Systems & Structures
Verified
Journal Article
Closed access
SESebastian Erdweg
Sebastian Erdweg
TSTijs van der Storm
Tijs van der Storm
MVMarkus Völter
Markus Völter
LTLaurence Tratt
Laurence Tratt
RBRemi Bosman
Remi Bosman
JWJimi van der Woning
Jimi van der Woning

30 October 2008 in ACM Transactions on Programming Languages and Systems
Verified
Journal Article
Open access
PDF file
LTLaurence Tratt
Laurence Tratt
Domain specific languages (DSLs) are mini-languages that are increasingly seen as being a valuable tool for software developers and non-developers alike. DSLs must currently be created in an ad-hoc fashion, often leading to high development costs and implementations of variable quality. In this article, I show how expressive DSLs can be hygienically embedded in the Converge programming language using its compile-time meta-programming facility, the concept of DSL blocks, and specialised error reporting techniques. By making use of pre-existing facilities, and following a simple methodology, DSL implementation costs can be significantly reduced whilst leading to higher quality DSL implementations.

1 May 2005 in Software and Systems Modeling
Verified
Journal Article
Closed access
PDF file
LTLaurence Tratt
Laurence Tratt

19 September 2012
Verified
Conference Paper
Open access
PDF file
MCMel Ó Cinnéide
Mel Ó Cinnéide
LTLaurence Tratt
Laurence Tratt
MHMark Harman
Mark Harman
SCSteve Counsell
Steve Counsell
IMIman Hemati Moghadam
Iman Hemati Moghadam
Peer-reviewedA large number of software metrics have been proposed in the literature, but there is little understanding of how these metrics relate to one another. We propose a novel experimental technique, based on search-based refactoring, to assess software metrics and to explore relationships between them. Our goal is not to improve the program being refactored, but to assess the software metrics that guide the automated refactoring through repeated refactoring experiments.\ud We apply our approach to five popular cohesion metrics using eight real-world Java systems, involving 300,000 lines of code and over 3,000 refactorings. Our results demonstrate that cohesion metrics disagree with each other in 55% of cases, and show how our approach can be used to reveal novel and surprising insights into the software metrics under investigation