Loading…

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

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: distri...

Full description

Saved in:
Bibliographic Details
Main Authors: Sayward,Frederick G, Lipton,Richard J
Format: Report
Language:English
Subjects:
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Sayward,Frederick G
Lipton,Richard J
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. Prepared in cooperation with Yale Univ., New Haven, CT. Dept. of Computer Science.
format report
fullrecord <record><control><sourceid>dtic_1RU</sourceid><recordid>TN_cdi_dtic_stinet_ADA099500</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>ADA099500</sourcerecordid><originalsourceid>FETCH-dtic_stinet_ADA0995003</originalsourceid><addsrcrecordid>eNqFjc0KglAQRt20iOoNWswLFEK0cClpGBQEupebzr0O3B9xxsS3z0WrNq2-A4fDt46mUrBnqMKkhpYh15oaQi92hpvrLbqFyRt4DsEMysFjFCUUPJQzCzo-QtUhFGQ6uOMbLWTIZDwEDQoyYhnoNQq2v-E2WmllGXff3UT7a15dikMr1NS8fKLUaZbGSXKO49Mf_QF6WEKH</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>report</recordtype></control><display><type>report</type><title>Steps Towards Efficiently Implementing Program Mutation Systems. The High Level Design of a Distributed Mutation System</title><source>DTIC Technical Reports</source><creator>Sayward,Frederick G ; Lipton,Richard J</creator><creatorcontrib>Sayward,Frederick G ; Lipton,Richard J ; PRINCETON UNIV NJ DEPT OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCE</creatorcontrib><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. Prepared in cooperation with Yale Univ., New Haven, CT. Dept. of Computer Science.</description><language>eng</language><subject>COMMUNICATIONS NETWORKS ; COMPILERS ; COMPUTER ARCHITECTURE ; COMPUTER COMMUNICATIONS ; Computer Hardware ; COMPUTER LOGIC ; COMPUTER PROGRAM VERIFICATION ; COMPUTER PROGRAMMING ; Computer Programming and Software ; Computer Systems ; Distributed data processing ; DYNAMIC PROGRAMMING ; FLOW CHARTING ; FORTRAN ; HIGH LEVEL LANGUAGES ; MUTATIONS ; PARALLEL PROCESSING ; Program mutation ; SEMANTICS</subject><creationdate>1981</creationdate><rights>APPROVED FOR PUBLIC RELEASE</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>230,780,885,27567,27568</link.rule.ids><linktorsrc>$$Uhttps://apps.dtic.mil/sti/citations/ADA099500$$EView_record_in_DTIC$$FView_record_in_$$GDTIC$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Sayward,Frederick G</creatorcontrib><creatorcontrib>Lipton,Richard J</creatorcontrib><creatorcontrib>PRINCETON UNIV NJ DEPT OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCE</creatorcontrib><title>Steps Towards Efficiently Implementing Program Mutation Systems. The High Level Design of a Distributed Mutation System</title><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. Prepared in cooperation with Yale Univ., New Haven, CT. Dept. of Computer Science.</description><subject>COMMUNICATIONS NETWORKS</subject><subject>COMPILERS</subject><subject>COMPUTER ARCHITECTURE</subject><subject>COMPUTER COMMUNICATIONS</subject><subject>Computer Hardware</subject><subject>COMPUTER LOGIC</subject><subject>COMPUTER PROGRAM VERIFICATION</subject><subject>COMPUTER PROGRAMMING</subject><subject>Computer Programming and Software</subject><subject>Computer Systems</subject><subject>Distributed data processing</subject><subject>DYNAMIC PROGRAMMING</subject><subject>FLOW CHARTING</subject><subject>FORTRAN</subject><subject>HIGH LEVEL LANGUAGES</subject><subject>MUTATIONS</subject><subject>PARALLEL PROCESSING</subject><subject>Program mutation</subject><subject>SEMANTICS</subject><fulltext>true</fulltext><rsrctype>report</rsrctype><creationdate>1981</creationdate><recordtype>report</recordtype><sourceid>1RU</sourceid><recordid>eNqFjc0KglAQRt20iOoNWswLFEK0cClpGBQEupebzr0O3B9xxsS3z0WrNq2-A4fDt46mUrBnqMKkhpYh15oaQi92hpvrLbqFyRt4DsEMysFjFCUUPJQzCzo-QtUhFGQ6uOMbLWTIZDwEDQoyYhnoNQq2v-E2WmllGXff3UT7a15dikMr1NS8fKLUaZbGSXKO49Mf_QF6WEKH</recordid><startdate>198103</startdate><enddate>198103</enddate><creator>Sayward,Frederick G</creator><creator>Lipton,Richard J</creator><scope>1RU</scope><scope>BHM</scope></search><sort><creationdate>198103</creationdate><title>Steps Towards Efficiently Implementing Program Mutation Systems. The High Level Design of a Distributed Mutation System</title><author>Sayward,Frederick G ; Lipton,Richard J</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-dtic_stinet_ADA0995003</frbrgroupid><rsrctype>reports</rsrctype><prefilter>reports</prefilter><language>eng</language><creationdate>1981</creationdate><topic>COMMUNICATIONS NETWORKS</topic><topic>COMPILERS</topic><topic>COMPUTER ARCHITECTURE</topic><topic>COMPUTER COMMUNICATIONS</topic><topic>Computer Hardware</topic><topic>COMPUTER LOGIC</topic><topic>COMPUTER PROGRAM VERIFICATION</topic><topic>COMPUTER PROGRAMMING</topic><topic>Computer Programming and Software</topic><topic>Computer Systems</topic><topic>Distributed data processing</topic><topic>DYNAMIC PROGRAMMING</topic><topic>FLOW CHARTING</topic><topic>FORTRAN</topic><topic>HIGH LEVEL LANGUAGES</topic><topic>MUTATIONS</topic><topic>PARALLEL PROCESSING</topic><topic>Program mutation</topic><topic>SEMANTICS</topic><toplevel>online_resources</toplevel><creatorcontrib>Sayward,Frederick G</creatorcontrib><creatorcontrib>Lipton,Richard J</creatorcontrib><creatorcontrib>PRINCETON UNIV NJ DEPT OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCE</creatorcontrib><collection>DTIC Technical Reports</collection><collection>DTIC STINET</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Sayward,Frederick G</au><au>Lipton,Richard J</au><aucorp>PRINCETON UNIV NJ DEPT OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCE</aucorp><format>book</format><genre>unknown</genre><ristype>RPRT</ristype><btitle>Steps Towards Efficiently Implementing Program Mutation Systems. The High Level Design of a Distributed Mutation System</btitle><date>1981-03</date><risdate>1981</risdate><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. Prepared in cooperation with Yale Univ., New Haven, CT. Dept. of Computer Science.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_dtic_stinet_ADA099500
source DTIC Technical Reports
subjects COMMUNICATIONS NETWORKS
COMPILERS
COMPUTER ARCHITECTURE
COMPUTER COMMUNICATIONS
Computer Hardware
COMPUTER LOGIC
COMPUTER PROGRAM VERIFICATION
COMPUTER PROGRAMMING
Computer Programming and Software
Computer Systems
Distributed data processing
DYNAMIC PROGRAMMING
FLOW CHARTING
FORTRAN
HIGH LEVEL LANGUAGES
MUTATIONS
PARALLEL PROCESSING
Program mutation
SEMANTICS
title Steps Towards Efficiently Implementing Program Mutation Systems. The High Level Design of a Distributed Mutation System
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T13%3A37%3A27IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-dtic_1RU&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=unknown&rft.btitle=Steps%20Towards%20Efficiently%20Implementing%20Program%20Mutation%20Systems.%20The%20High%20Level%20Design%20of%20a%20Distributed%20Mutation%20System&rft.au=Sayward,Frederick%20G&rft.aucorp=PRINCETON%20UNIV%20NJ%20DEPT%20OF%20ELECTRICAL%20ENGINEERING%20AND%20COMPUTER%20SCIENCE&rft.date=1981-03&rft_id=info:doi/&rft_dat=%3Cdtic_1RU%3EADA099500%3C/dtic_1RU%3E%3Cgrp_id%3Ecdi_FETCH-dtic_stinet_ADA0995003%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true