Mark Lawford

Mark Lawford

Auto-generated profile, based on publicly available information

Mark Lawford

McMaster University

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
25 December 2023 in IEEE Transactions on Software Engineering
Verified
Journal Article
Closed access
FFFederico Formica
Federico Formica
TFTony Fan
Tony Fan
ARAkshay Rajhans
Akshay Rajhans
VPVera Pantelic
Vera Pantelic
MLMark Lawford
Mark Lawford
Claudio MenghiClaudio Menghi
Claudio Menghi
Simulation-based software testing supports engineers in finding faults in Simulink® models. It typically relies on search algorithms that iteratively generate test inputs used to exercise models in simulation to detect design errors. While simulation-based software testing techniques are effective in many practical scenarios, they are typically not fully integrated within the Simulink environment and require additional manual effort. Many techniques require engineers to specify requirements using logical languages that are neither intuitive nor fully supported by Simulink, thereby limiting their adoption in industry. This work presents HECATE, a testing approach for Simulink models using Test Sequence and Test Assessment blocks from Simulink® TestTM. Unlike existing testing techniques, HECATE uses information from Simulink models to guide the search-based exploration. Specifically, HECATE relies on information provided by the Test Sequence and Test Assessment blocks to guide the search procedure. Across a benchmark of 18 Simulink models from different domains and industries, our comparison of HECATE with the state-of-the-art testing tool S-Taliro indicates that HECATE is both more effective (more failure-revealing test cases) and efficient (less iterations and computational time) than S-Taliro for ≈94% and ≈83% of benchmark models respectively. Furthermore, HECATE successfully generated a failure-revealing test case for a representative case study from the automotive domain demonstrating its practical usefulness.

4 April 2018
Verified
Book Chapter
Open access
PDF file
ZDZinovy Diskin
Zinovy Diskin
HKHarald König
Harald König
MLMark Lawford
Mark Lawford
Multiple (more than 2) model synchronization is ubiquitous and important for MDE, but its theoretical underpinning gained much less attention than the binary case. Specifically, the latter was extensively studied by the bx community in the framework of algebraic models for update propagation called lenses. Now we make a step to restore the balance and propose a notion of multiary delta lens. Besides multiarity, our lenses feature reflective updates, when consistency restoration requires some amendment of the update that violated consistency. We emphasize the importance of various ways of lens composition for practical applications of the framework, and prove several composition results.

1 December 2015 in Science of Computer Programming
Verified
Journal Article
Closed access
MBMarc Bender
Marc Bender
KLKaren Laurin
Karen Laurin
MLMark Lawford
Mark Lawford
VPVera Pantelic
Vera Pantelic
AKAlexandre Korobkine
Alexandre Korobkine
SPSteven Postma
Steven Postma

25 August 2022
Verified
Book Chapter
Closed access
PDF file
NANicholas Annable
Nicholas Annable
TCThomas Chiang
Thomas Chiang
MLMark Lawford
Mark Lawford
RPRichard F. Paige
Richard F. Paige
AWAlan Wassyng
Alan Wassyng

23 June 2025
Verified
Conference Paper
Open access
SWStephen Wynn-Williams
Stephen Wynn-Williams
RTRyan Tyrrell
Ryan Tyrrell
VPVera Pantelic
Vera Pantelic
MLMark Lawford
Mark Lawford
Claudio MenghiClaudio Menghi
Claudio Menghi
HAHassan Artail
Hassan Artail

28 September 2009 in Electronic Notes in Theoretical Computer Science
Verified
Journal Article
Open access
JHJohn Hatcliff
John Hatcliff
MHMats Heimdahl
Mats Heimdahl
MLMark Lawford
Mark Lawford
TMTom Maibaum
Tom Maibaum
AWAlan Wassyng
Alan Wassyng
FWFred Wurden
Fred Wurden
In August of 2007 and December of 2007, North American academic researchers, industry representatives and regulators were invited to meetings in Washington and Minneapolis, respectively, with the goal of forming a Software Certification Consortium (SCC). At the first meeting, objectives were established for the consortium and a certification grand challenge was issued. At the second meeting, all participants were asked to complete the statement: “Software certification is hard because …”. The group then synthesized the results into a “Top 9” list by means of discussion and voting. In this article, we describe the goals that we believe should be the goals of SCC, via details of these Top 9 hurdles that are preventing us from making software certification part of the mainstream