skip to content
Steps Towards Efficiently Implementing Program Mutation Systems. The High Level Design of a Distributed Mutation System. Preview this item
ClosePreview this item
Checking...

Steps Towards Efficiently Implementing Program Mutation Systems. The High Level Design of a Distributed Mutation System.

Author: Frederick G Sayward; Richard J Lipton; PRINCETON UNIV NJ DEPT OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCE.
Publisher: Ft. Belvoir Defense Technical Information Center MAR 1981.
Edition/Format:   Book : English
Database:WorldCat
Summary:
Program mutation is a promising method for testing the functional correctness of programs. Its major criticism has been a lack of an efficient implementation method. This report presents four methods which have the potential to dramatically improve the time needed to perform program mutation: distributed computation, automatically detecting equivalent mutants, partial mutant execution, and a 'weak' version of  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Frederick G Sayward; Richard J Lipton; PRINCETON UNIV NJ DEPT OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCE.
OCLC Number: 227488160
Notes: Prepared in cooperation with Yale Univ., New Haven, CT. Dept. of Computer Science.
Description: 20 p.

Abstract:

Program mutation is a promising method for testing the functional correctness of programs. Its major criticism has been a lack of an efficient implementation method. This report presents four methods which have the potential to dramatically improve the time needed to perform program mutation: distributed computation, automatically detecting equivalent mutants, partial mutant execution, and a 'weak' version of program mutation. The presentation of the four potential speed-up methods is given in terms of a high-level design of a prototype distributed program mutation system. One goal of this system will be to analyze how the parallelism inherent in program mutation can be exploited on emerging distributed computer systems consisting of many processors. Another goal is to perform experiments to measure the gain in efficiency realizable by a distributed program mutation system and to compare the relative strength of weak program mutation against program mutation. In the report we also indicate areas which should receive special attention in the detailed design of a prototype distributed mutation system if these goals are to be met.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/227488160>
library:oclcnum"227488160"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/227488160>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:contributor
schema:datePublished"MAR 1981"
schema:datePublished"1981"
schema:description"Program mutation is a promising method for testing the functional correctness of programs. Its major criticism has been a lack of an efficient implementation method. This report presents four methods which have the potential to dramatically improve the time needed to perform program mutation: distributed computation, automatically detecting equivalent mutants, partial mutant execution, and a 'weak' version of program mutation. The presentation of the four potential speed-up methods is given in terms of a high-level design of a prototype distributed program mutation system. One goal of this system will be to analyze how the parallelism inherent in program mutation can be exploited on emerging distributed computer systems consisting of many processors. Another goal is to perform experiments to measure the gain in efficiency realizable by a distributed program mutation system and to compare the relative strength of weak program mutation against program mutation. In the report we also indicate areas which should receive special attention in the detailed design of a prototype distributed mutation system if these goals are to be met."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/1862872856>
schema:inLanguage"en"
schema:name"Steps Towards Efficiently Implementing Program Mutation Systems. The High Level Design of a Distributed Mutation System."@en
schema:numberOfPages"20"
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.