Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mark Hennessy

dblp:80/5989 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2008
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Software testing · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Software testing › test generation
grammar-based test generation
0.112005
An analysis of rule coverage as a criterion in generating minimal test suites for grammar-based software · ASE 2005
Software testing › test generation
test suite generation
0.112005
An analysis of rule coverage as a criterion in generating minimal test suites for grammar-based software · ASE 2005
Software testing › regression testing
test suite reduction
0.112005
An analysis of rule coverage as a criterion in generating minimal test suites for grammar-based software · ASE 2005

Methods — techniques the papers use, named apart from their topics

fault detection analysis · 0.1code coverage analysis · 0.1
YearPublicationVenuePosition
2008 Analysing the effectiveness of rule-coverage as a reduction criterion for test suites of grammar-based software
Mark Hennessy, James F. Power
Empir. Softw. Eng.1
2005 An analysis of rule coverage as a criterion in generating minimal test suites for grammar-based software
abstract
The term grammar-based software describes software whose input can be specified by a context-free grammar. This grammar may occur explicitly in the software, in the form of an input specification to a parser generator, or implicitly, in the form of a hand-written parser, or other input-verification routines. Grammar-based software includes not only programming language compilers, but also tools for program analysis, reverse engineering, software metrics and documentation generation. Such tools often play a crucial role in automated software development, and ensuring their completeness and correctness is a vital prerequisite for their us.In this paper we propose a strategy for the construction of test suites for grammar based software, and illustrate this strategy using the ISO CPP grammar. We use the concept of rule coverage as a pivot for the reduction of implementation-based and specification-based test suites, and demonstrate a significant decrease in the size of these suites. To demonstrate the validity of the approach, we use the reduced test suite to analyze three grammar-based tools for CPP++. We compare the effectiveness of the reduced test suite with the original suite in terms of code coverage and fault detection.
Mark Hennessy, James F. Power
ASE1