Актуальные научные исследования в современном мире iscience. In. Ua



Download 4,47 Mb.
Pdf ko'rish
bet32/194
Sana04.04.2022
Hajmi4,47 Mb.
#527906
1   ...   28   29   30   31   32   33   34   35   ...   194
Bog'liq
MODERN SCIENTIFIC CHALLENGES AND (web)

int
> inner_vector; 
public:
my_vector(
int
size): inner_vector(size) {} 
int
get(
int
pos) { 
return
inner_vector[200]; 

}; 
void
test1
() { 
my_vector my_vector(
3
); 
my_vector.get(
2
); 
}
void
test2
() { 
my_vector my_vector(
3
); 


«MODERN SCIENTIFIC CHALLENGES AND TRENDS»
 
SCIENCECENTRUM.PL 
ISSUE 3 
ISBN 978-83-949403-3-1 
38
my_vector.get(
1
); 

In this case both tests also fail but because of an error in my_vector class. 
So, it needs to fix just one bug to fix all other bugs. 
The crucial problem is the fact that there are the same stacktraces in both 
cases described above. This is the reason why it needs to specify a scope of 
problems that can be fixed by stacktraces analysis: 

Algorithm must work only with tests. 

Tests for software system must be written properly. It means that they 
shouldn‘t contain runtime errors and any checks for them. This 
requirement is s
ensible because test frameworks don‘t provide any 
possibilities for such checks now. 
The base idea of an algorithm reducing redundancy is the following: 
1. Compare two reports. If error types provided by reports are not the 
same, the reports describe different errors. 
2. Compare stacktraces caused by errors. 
3. Find test calls in the stacktraces. 
4. Compare substacktraces which are above tests calls. 
5. If these substacktraces are the same, the reports describe the same 
error. Otherwise, they describe different errors. 
Results.
Thus, the algorithm that is intended to decrease runtime error 
reports redundancy is developed. It can be used to create an application that will 
analyze reports of one of the existing runtime analysis tools and will make it easier 
to handle its rep
orts by reducing redundancy. It will decrease a developer‘s time 
spent on error analysis and will make the development process more efficient. 
REFERENCES 
1. Louden K. C. Compiler construction // Cengage Learning. 
– 1997. 
2. Davis E. B. Fast, compatible, complete memory safety For C programs: dis. 
– 
Massachusetts Institute of Technology, 2016. 
3. AddressSanitizer 
// 
The 
LLVM 
Compiler 
Infrastructure 
URL: 
https://clang.llvm.org/docs/AddressSanitizer.html 
4. ThreadSanitizer 
// 
The 
LLVM 
Compiler 
Infrastructure 
URL: 
https://clang.llvm.org/docs/ThreadSanitizer.html 
5. Valgrind User Manual // Valgrind URL: http://valgrind.org/docs/manual/mc-
manual.html 



Download 4,47 Mb.

Do'stlaringiz bilan baham:
1   ...   28   29   30   31   32   33   34   35   ...   194




Ma'lumotlar bazasi mualliflik huquqi bilan himoyalangan ©hozir.org 2024
ma'muriyatiga murojaat qiling

kiriting | ro'yxatdan o'tish
    Bosh sahifa
юртда тантана
Боғда битган
Бугун юртда
Эшитганлар жилманглар
Эшитмадим деманглар
битган бодомлар
Yangiariq tumani
qitish marakazi
Raqamli texnologiyalar
ilishida muhokamadan
tasdiqqa tavsiya
tavsiya etilgan
iqtisodiyot kafedrasi
steiermarkischen landesregierung
asarlaringizni yuboring
o'zingizning asarlaringizni
Iltimos faqat
faqat o'zingizning
steierm rkischen
landesregierung fachabteilung
rkischen landesregierung
hamshira loyihasi
loyihasi mavsum
faolyatining oqibatlari
asosiy adabiyotlar
fakulteti ahborot
ahborot havfsizligi
havfsizligi kafedrasi
fanidan bo’yicha
fakulteti iqtisodiyot
boshqaruv fakulteti
chiqarishda boshqaruv
ishlab chiqarishda
iqtisodiyot fakultet
multiservis tarmoqlari
fanidan asosiy
Uzbek fanidan
mavzulari potok
asosidagi multiservis
'aliyyil a'ziym
billahil 'aliyyil
illaa billahil
quvvata illaa
falah' deganida
Kompyuter savodxonligi
bo’yicha mustaqil
'alal falah'
Hayya 'alal
'alas soloh
Hayya 'alas
mavsum boyicha


yuklab olish