首页
网站开发
桌面应用
管理软件
微信开发
App开发
嵌入式软件
工具软件
数据采集与分析
其他
首页
>
> 详细
program代做、代写python设计编程
项目预算:
开发周期:
发布时间:
要求地区:
Part 1: Coverage
Introduction
This component requires the development of a comprehensive tool to analyse a provided test suite for
a piece of software. The analysis must cover two key white-box testing metrics: statement coverage
and branch coverage. The aim is to assess the efficacy and thoroughness of the test suite in detecting
faults and ensuring robustness in the software.
Objectives
• Implement a tool that takes a series of given test inputs and runs them on a program.
• Report the statement coverage and branch coverage for the program when run using the series
of test inputs.
Requirements
1. Statement Coverage
Objective: Determine the percentage of executable statements in the software that are executed by
the test cases in the test suite.
2. Branch Coverage
Objective: Identify and report the number of branches through the program’s control flow graph that
are covered by the test suite.
Input Specifications
Your program should take 2 command-line arguments:
1. The path to a Python script
2. The path to a directory containing a set of input (.in) files
It should be called using the following command:
python coverage.py
Output Specifications
Your program should produce output indicating:
1 Statement Coverage: The count of statements executed during testing.
2 Branch Coverage: The count of branches executed during testing.
For example:
1 Statement Coverage: 50%
2 Branch Coverage: 50%
Page 3
Part 2: Fuzzing with Mutated Inputs
Introduction
In this part of the assignment, you will develop a fuzzer designed to automate the generation and
mutation of test inputs to maximise the branch coverage of a test suite. The primary goal is to expand
the test coverage by identifying and adding inputs that expose new branches in the software under
test.
Objectives
• Develop a fuzzer capable of generating and mutating test inputs.
• Implement a method to measure the increase in branch coverage.
• Automate the process of enhancing the test suite with inputs that increase branch coverage.
Requirements
This task requires you to take a program along with a series of inputs and mutate the inputs to achieve
a minimum branch coverage (note that in Part I we ask for statement coverage and branch coverage).
You must automatically improve the test suite by adding mutated inputs that increase the branch
coverage.
Implementation Specifications
• Use the fuzzer to apply mutations to the initial set of inputs.
• For each mutated input, execute the test suite to determine if the mutation results in increased
branch coverage.
• If an input increases branch coverage (by reaching new conditions not previously tested), add
it to a ’population’ of effective test inputs.
• Continue this process until no further increase in branch coverage is observed, aiming to achieve
the largest possible branch coverage.
• Write the final set of test inputs that collectively provide the highest branch coverage observed
to a file.
Input Specifications
Your program should take 2 command-line arguments:
1. The path to a Python script
2. The path to a single text (.in) file
It should be called using the following command:
python mutation_fuzzer.py
The text file will contain a set of inputs, each on a new line.
For example:
1 Never
2 Gonna
3 Give
4 You
5 Up
Page 4
Output Specifications
Your program should write back to the provided input (.in) file with exactly the same number of
input strings as was provided initially.
For example:
1 Never
2 Gonna
3 Let
4 You
5 Down
Part 3: Grammar-Based Fuzzing
Introduction
Grammar-based fuzzing is a commonly used method to test programs that consume structured inputs,
particularly input parsers.
Objectives
• Implement a grammar-based fuzzer to generate structured inputs for testing.
• Explore various grammar structures to hit or exceed a branch coverage threshold specified.
Requirements
This task requires implementing a grammar-based fuzzer capable of generating structured inputs
based on a specified grammar. The goal is to hit or exceed a branch coverage threshold by generating a test suite that effectively tests the target program.
Implementation Specifications
• Develop algorithms to interpret grammar specifications and generate inputs accordingly.
• Explore different paths and options within the grammar to maximise the branch coverage.
• Test the generated inputs on the target program to assess its branch coverage.
• Implement mechanisms to adjust the generation process to hit or exceed the input and code
coverage threshold.
Input Specifications
Your program should take 3 command-line arguments:
1. The path to a Python script
2. The path to a single Python (.py) script containing the grammar specifications using the syntax
taught in the lectures and tutorials; the grammar will be stored as the variable ’grammar’
3. The number of strings your program should generate for the test suite
It should be called using the following command:
python grammar_fuzzer.py
Page 5
Output Specifications
The program should generate structured inputs based on the grammar specifications provided and
write them to an output file. The output file should contain the specified number of strings each on a
new line, where each string represents a test input. The generated inputs should cover various paths
and options within the grammar, aiming to hit or exceed the branch coverage threshold defined for
the target program.
For example, if the desired number of strings is 100:
1 input_1
2 input_2
3 ...
4 input_100
Make sure that the generated inputs cover as many grammar rules and options as possible to effectively
test the target program and meet the input and code coverage threshold.
Getting Started
• Review Tutorials and Lectures: Begin by reviewing the tutorials and lectures. Remember
that everything you need for each component has already been covered in this unit.
• Understand the Fundamentals: Go through the revision slides on Ed and make sure that
you understand all of the content covered so far.
• Ask Questions: If you have any questions or uncertainties about the material covered, don’t
hesitate to ask on Ed for clarification and a TA will get back to you shortly.
Frequently Asked Questions
• Hard coding will result in a 0 for all tasks.
• No external libraries (i.e. those installed using pip or another package manager) may be
used - this is a limitation of Edstem.
• You have unlimited attempts before the deadline.
• There are public, private and hidden test cases for all tasks.
• Test cases will gradually be released over the coming days, and you should check Ed for
announcements.
• You may reuse their code from Quiz 1 and any other task from this unit.
• All code, even your own, must be referenced as per the university’s policy.
• You may structure your program as you wish as long as it is written in Python and gets
called using the described commands.
Page 6
软件开发、广告设计客服
QQ:99515681
邮箱:99515681@qq.com
工作时间:8:00-23:00
微信:codinghelp
热点项目
更多
data程序代写、代做c/c++编程语...
2024-05-17
data程序代写、代做python编程...
2024-05-17
program代做、c/c++,python程...
2024-05-17
代写math 3333 3.0 - winter 2...
2024-05-17
代做seng6110 programming ass...
2024-05-17
代写seng6110 object oriented...
2024-05-17
代写comp828: statistical pro...
2024-05-17
代做culture and society调试数...
2024-05-17
代做comp 4911 winter 2024 as...
2024-05-17
代做lh physical iiib / 03 33...
2024-05-17
代做3032ict big data analyti...
2024-05-17
代写comp4702 report代写留学生...
2024-05-17
代写fin2020 hw6代写c/c++编程
2024-05-17
热点标签
fit2004
fit3152
mec208
econ20120
cpt304
econ2101
econ0051
engi4547
econ1048
eengm2510
fit1008
7033mkt
ec2066
cct380h5f
man00019m
mech265001
fin2020
fit9137
n1542
csc4140
math6119
comp1710
fina864
csys5020
busi4412
math5007
2702ict
dts204tc
comp2003j
cosc2673
ecmt2150
bff3121–
comu7000
stat6118
comp814
acc202
ematm0067
bit233
ecs776p
600543
bpln0025
comp3400
econ7030
159.342 ‐ operating
mang6134
math1005/math6005
geog5404m
comp1710/6780
infs 2042
inf6028
bman30702
math0002
msci242l
mgt11001
com00177m
bman71282
fit2001
cpt210
159.341
econ7310
comp3221
comp10002
cpt206
ecmt1010
finm081
econ2005
cpt202
fit3094
socs0030
data7201
data2x01
mn-3507
mat246h1
ib2d90
ib3j80
acc207
comp90007
compx518-24a
fit1050
info1111
acct2201
buad801
compsci369
cse 332s
info1110
math1033
scie1000
eeee2057
math4063
cmt219
econ5074
eng5009
csse2310/csse7231
ec333
econ0001
cpt204
elec4630
ma117
dts104tc
comp2017
640481
csit128
eco000109m
finc5090
ggr202h5f
nbs8295
4ssmn902
chc6171
dsa1002
ebu6304
comp1021
csci-ua.202
com6511
ma416
mec206
iom209
bism7202
idepg001
cpt106
comp1212
ecom209
math1062
mn-3526
fnce3000
fmhu5002
psyc10003
fina2222
be631-6-sp/1
finc2011
37989
5aaob204
citx1401
econ0028
bsan3204
comp9123
cmt218
itp122
qbus6820
ecmt1020
bus0117
soft3202/comp9202
basc0057
mecm30013
aem4060
acb1120
comp2123
econ2151
ecmt6006
inmr77
com 5140
ocmp5328
comp1039
had7002h
cmt309
asb-3715
elec373
cpt204-2324
be631-6-sp
econ3016
mast10007
buss6002
comp4403
comp30023
finm1416
csc-30002
6qqmn971
fin668
mnfg309
inft2031
cits1402
comp2011
eecs 3221
ebu4201
ct60a9600
com336
8pro102
econ7300
comp3425
comp8410
comp222
finm8007
comp2006
comp26020
comp1721
eeen3007j
cis432
csci251
comp5125m
com398sust
finm7405
econ7021
fin600
infs4205/7205
mktg2510-
32022
mth6158
comp328
finn41615
2024
mec302
联系我们
- QQ: 9951568
© 2021
www.rj363.com
软件定制开发网!