Proceedings of the 2014 International Symposium on Software Testing and Analysis 2014
DOI: 10.1145/2610384.2628052
|View full text |Cite
|
Sign up to set email alerts
|

MuCheck: an extensible tool for mutation testing of haskell programs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
18
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 27 publications
(18 citation statements)
references
References 12 publications
0
18
0
Order By: Relevance
“…The method has been applied on the most popular programming languages such as C [6], C++ [7], C# [8], Java [9], JavaScript [10], Ruby [11] including specification [2] and modelling languages [12]. It has also been adapted for the most popular programming paradigms such as Object-Oriented [13], Functional [14], aspect-oriented and declarative-oriented [15,16] programming.…”
Section: Introductionmentioning
confidence: 99%
“…The method has been applied on the most popular programming languages such as C [6], C++ [7], C# [8], Java [9], JavaScript [10], Ruby [11] including specification [2] and modelling languages [12]. It has also been adapted for the most popular programming paradigms such as Object-Oriented [13], Functional [14], aspect-oriented and declarative-oriented [15,16] programming.…”
Section: Introductionmentioning
confidence: 99%
“…Imperative languages aside, mutation testing has been considered for declarative and functional languages as well [1]. Usable tools exist, for instance, for Haskell [11].…”
Section: Related Workmentioning
confidence: 99%
“…Consider the following explicit definition of sort, which is used as an example in Le et al (2014). Given this definition, and properties 1-6 listed in §5.2, MuCheck with default settings gives the following output.…”
Section: Sorting ( §52)mentioning
confidence: 99%
“…The competent programmer hypothesis (Demillo et al 1978) states: "[Competent programmers] create programs that are close to being correct". In mutation-testing literature, mostly concerned with imperative languages (Jia and Harman 2011;Le et al 2014), closeness is usually regarded as syntactic closeness. We suggest that a semantic notion of closeness is even more suitable for pure strongly-typed functional programs: minor syntactic slips are very often caught by the type-checker; errors that are harder to detect involve incorrect associations between input and output values.…”
Section: Sorting ( §52)mentioning
confidence: 99%