首页
编程语言
数据库
网络开发
Algorithm算法
移动开发
系统相关
金融统计
人工智能
其他
首页
>
> 详细
辅导 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 intra-procedural paths executed during
testing.
For example:
1 Statement Coverage: 150
2 Branch Coverage: 19
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 ‘.in‘ file with the same name as the program itself. 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
For example, if the program being run was
my_program.py
The file that the inputs would be written to would be
my_program.in
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-21:00
微信:codinghelp
热点文章
更多
讲解 program、辅导 c++设计...
2024-12-23
comp2012j 辅导 、讲解 java ...
2024-12-23
讲解 data 编程、辅导 pytho...
2024-12-23
讲解 en.553.413-613 applied ...
2024-12-23
讲解 steady-state analvsis讲...
2024-12-23
辅导 photo essay of a decidu...
2024-12-23
辅导 gpa analyzer调试c/c++语...
2024-12-23
讲解 comp 330 (fall 2024): a...
2024-12-23
辅导 pstat 160a fall 2024 - ...
2024-12-23
讲解 pstat 160a: stochastic ...
2024-12-23
讲解 7ssgn110 environmental ...
2024-12-23
讲解 compsci 4039 programmin...
2024-12-23
讲解 lab exercise 8: diction...
2024-12-23
辅导 fin2002s principles of ...
2024-12-23
讲解 ssk5221 internet of thi...
2024-12-23
讲解 cs152 project 8: pinbal...
2024-12-23
讲解 07 40063 lm economics o...
2024-12-23
讲解 fnsrsk612 determine and...
2024-12-23
讲解 econ30001 problem set 2...
2024-12-23
辅导 soulcycle startup valua...
2024-12-23
热点标签
mktg2509
csci 2600
38170
lng302
csse3010
phas3226
77938
arch1162
engn4536/engn6536
acx5903
comp151101
phl245
cse12
comp9312
stat3016/6016
phas0038
comp2140
6qqmb312
xjco3011
rest0005
ematm0051
5qqmn219
lubs5062m
eee8155
cege0100
eap033
artd1109
mat246
etc3430
ecmm462
mis102
inft6800
ddes9903
comp6521
comp9517
comp3331/9331
comp4337
comp6008
comp9414
bu.231.790.81
man00150m
csb352h
math1041
eengm4100
isys1002
08
6057cem
mktg3504
mthm036
mtrx1701
mth3241
eeee3086
cmp-7038b
cmp-7000a
ints4010
econ2151
infs5710
fins5516
fin3309
fins5510
gsoe9340
math2007
math2036
soee5010
mark3088
infs3605
elec9714
comp2271
ma214
comp2211
infs3604
600426
sit254
acct3091
bbt405
msin0116
com107/com113
mark5826
sit120
comp9021
eco2101
eeen40700
cs253
ece3114
ecmm447
chns3000
math377
itd102
comp9444
comp(2041|9044)
econ0060
econ7230
mgt001371
ecs-323
cs6250
mgdi60012
mdia2012
comm221001
comm5000
ma1008
engl642
econ241
com333
math367
mis201
nbs-7041x
meek16104
econ2003
comm1190
mbas902
comp-1027
dpst1091
comp7315
eppd1033
m06
ee3025
msci231
bb113/bbs1063
fc709
comp3425
comp9417
econ42915
cb9101
math1102e
chme0017
fc307
mkt60104
5522usst
litr1-uc6201.200
ee1102
cosc2803
math39512
omp9727
int2067/int5051
bsb151
mgt253
fc021
babs2202
mis2002s
phya21
18-213
cege0012
mdia1002
math38032
mech5125
07
cisc102
mgx3110
cs240
11175
fin3020s
eco3420
ictten622
comp9727
cpt111
de114102d
mgm320h5s
bafi1019
math21112
efim20036
mn-3503
fins5568
110.807
bcpm000028
info6030
bma0092
bcpm0054
math20212
ce335
cs365
cenv6141
ftec5580
math2010
ec3450
comm1170
ecmt1010
csci-ua.0480-003
econ12-200
ib3960
ectb60h3f
cs247—assignment
tk3163
ics3u
ib3j80
comp20008
comp9334
eppd1063
acct2343
cct109
isys1055/3412
math350-real
math2014
eec180
stat141b
econ2101
msinm014/msing014/msing014b
fit2004
comp643
bu1002
cm2030
联系我们
- QQ: 99515681 微信:codinghelp
© 2024
www.7daixie.com
站长地图
程序辅导网!