Reference : Mart: A Mutant Generation Tool for LLVM

	Document type :	Scientific congresses, symposiums and conference proceedings : Paper published in a book
	Discipline(s) :	Engineering, computing & technology : Computer science
	Focus Areas :	Computational Sciences
	To cite this reference:	http://hdl.handle.net/10993/39780

Title :	Mart: A Mutant Generation Tool for LLVM
Language :	English
Author, co-author :	Titcheu Chekam, Thierry [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
	Papadakis, Mike [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > Computer Science and Communications Research Unit (CSC) >]
	Le Traon, Yves [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Publication date :	2019
Main document title :	Mart: A Mutant Generation Tool for LLVM
Author, co-author :	Titcheu Chekam, Thierry
	Papadakis, Mike
	Le Traon, Yves
Peer reviewed :	Yes
Event name :	The 27th ACM JointEuropean Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE 2019)
Event date :	August 26-30
Event organizer :	ACM
Event place (city) :	Tallinn
Event country :	Estonia
Keywords :	[en] mutation ; mutant operators ; software analysis ; LLVM bitcode ; Trivial Compiler Equivalence
Abstract :	[en] Program mutation makes small syntactic alterations to programs' code in order to artificially create faulty programs (mutants). Mutants are used, in software analysis, to evaluate and improve test suites. Mutants creation (generation) tools are often characterized by their mutation operators and the way they create and represent the mutants. This paper presents Mart, a mutants generation tool, for LLVM bitcode, that supports the fine-grained definition of mutation operators (as matching rule - replacing pattern pair; uses 816 defined pairs by default) and the restriction of the code parts to mutate. New operators are implemented in Mart by implementing their matching rules and replacing patterns. Mart also implements in-memory Trivial Compiler Equivalence to eliminate equivalent and duplicate mutants during mutants generation. Mart generates mutant code as separated mutant files, meta-mutants file, weak mutation, and mutant coverage instrumented files. The generated LLVM bitcode files can be interpreted using an LLVM interpreter or compiled into native code. Mart is publicly available (https://github.com/thierry-tct/mart) for use by researchers and practitioners. Mart has been applied to generate mutants for several research experiments and generated more than 4,000,000 mutants.
Target :	Researchers ; Professionals ; Students
Permalink :	http://hdl.handle.net/10993/39780
DOI :	10.1145/3338906.3341180
Other URL :	https://github.com/thierry-tct/mart
FnR project :	FnR ; FNR11278802 > Titcheu Chekam Thierry > > Tailoring Automated Software Techniques for Real World and Large Scale Software Applications > 01/03/2016 > 31/01/2020 > 2016

	File(s) associated to this reference
	Fulltext file(s): File Commentary Version Size Access Open access main.pdf Author preprint 820.31 kB View/Open

All documents in ORBi^lu are protected by a user license.

 

University of Luxembourg Library |  Feedback |  Legal notices Site Map