检索结果-内蒙古大学图书馆

15th IEEE International Conference on Software Testing, Verification and Validation (ICST)

作者： Guarnieri, Giovanni F. Pizzoleto, Alessandro, V Ferrari, Fabiano C. Univ Fed Sao Carlos Sorocaba SP Brazil Univ Fed Sao Carlos Sao Carlos SP Brazil

ISBN: (纸本)9781665496285

This paper presents an implementation and assessment of a framework named SiMut. The framework was introduced in a previous paper with the objective of helping reducing the cost for testing a program based on groups of similar programs previously tested with mutation. The implementation presented in the paper handles Java programs and includes a set of variants that relate to three types of program abstraction (original source code, processed source code, and internal complexity metrics), three similarity calculation strategies (clustering, information diversity, and plagiarism), and one mutation cost reduction approach (inspired by the One-Op mutation technique). Our evaluation encompasses 20 variant combinations, also referred to as SiMut configurations, and 35 small Java programs. A cross-comparison involving the formed clusters and a comparison with randomly formed clusters points to configurations that tend to reach high effectiveness in foreseeing the best mutation operators for untested programs.

关键词： mutation testing cost reduction program similarity

来源：评论

学校读者我要写书评

暂无评论

SiMut: Exploring program similarity to Support the Cost Reduction of Mutation Testing 13

SiMut: Exploring Program Similarity to Support the Cost Redu...

引用

13th IEEE International Conference on Software Testing, Verification and Validation (ICST)

作者： Pizzoleto, Alessandro, V Ferrari, Fabiano C. Dallilo, Lucas D. Offutt, Jeff Univ Fed Sao Carlos Comp Dept Sao Carlos SP Brazil Univ Sao Paulo Dept Comp Syst Sao Carlos SP Brazil George Mason Univ Dept Comp Sci Fairfax VA 22030 USA

ISBN: (纸本)9781728110752

Scientists have created many cost reduction techniques for mutation testing, and most of them reduce cost with minor losses of effectiveness. However, many of these techniques are difficult to generalize, difficult to scale, or both. Published results are usually limited to a modest collection of programs. Therefore, an open question is whether the results of a given cost reduction technique on programs studied in the paper will hold true for other programs. This paper introduces a conceptual framework, named SiMut, to support the cost reduction of mutation testing based on historical data and program similarity. Given a new, untested program u, the central idea is applying to u the same cost reduction strategy applied to a group G of programs that are similar to u and have already been tested with mutation, and check for consistency of results in terms of reduced costs and quality of test sets. SiMut includes activities to compute program abstractions and similarity. Based on this information, it supports the application of mutation cost reduction techniques to both G and u. This paper presents the concepts behind SiMut, a proof-of-concept implementation of SiMut, and results from a pilot study. Finally, we discuss some issues related to the use of SiMut, focusing on the composition of a representative dataset to properly explore the potential of our framework.

关键词： mutation testing cost reduction program similarity reuse of historical data

来源：评论

学校读者我要写书评

暂无评论

Multimodal Genetic programming Using program similarity Measurement and Its Application to Wall-Following Problem 19

Multimodal Genetic Programming Using Program Similarity Meas...

引用

Genetic and Evolutionary Computation Conference (GECCO)

作者： Yoshida, Shubu Harada, Tomohiro Thawonmas, Ruck Ritsumeikan Univ Kusatsu Shiga Japan

ISBN: (纸本)9781450367486

In this paper, we examine the effectiveness of multimodal genetic programming (MMGP) on the wall-following problem, which is a well-known benchmark problem of genetic programming (GP). MMGP aims to obtain multiple local optimal programs, including global optimal programs, that is, programs that achieve the same goal with different program structures. In this paper, we apply MMGP to the wall-following problem. The purpose of the wall-following problem is to find a program to control a robot having twelve distance sensors and four movements to follow irregular walls. We expect that there are several local optimal programs in the wall-following problem, which use different combinations of sensors. An experiment is conducted to investigate whether MMGP can get local optimal programs simultaneously for the wall-following problem. This experiment compares MMGP with a simple GP. The experimental results reveal that MMGP can achieve higher acquisition ratio of local optimal programs than the simple GP.

关键词： Multimodal optimization Genetic programming Wall-Following Problem program similarity

来源：评论

学校读者我要写书评

暂无评论

Common program similarity Metric Method for Anti-Obfuscation

引用

IEEE ACCESS 2018年 6卷 47557-47565页

作者： Zhang, Xiaochuan Pang, Jianmin Liu, Xiaonan State Key Lab Math Engn & Adv Comp Zhengzhou 450002 Henan Peoples R China

program similarity metrics, especially malware similarity metrics, have long been an area of active research. However, code obfuscation techniques bring many challenges to similarity analysis. Most prior techniques lack extensibility since they focus on problems of only one particular type, such as malicious programs on a specific platform. Moreover, some of these techniques cannot measure the similarity between the various components of two programs, and some cannot accommodate code obfuscation techniques, particularly for control flow obfuscation. To address these limitations, we present the new concept of the reductive instruction dependence graph (RIDG), which is platform-independent and stable throughout most code obfuscation processes. In addition, we propose a four-level similarity schema that is based on RIDG for measuring the similarity between two programs, which can be used to find the similarity between the components of programs. We use the proposed program similarity metric method to measure similarities among 100 different programs, and we evaluate the anti-obfuscation ability of this method by using four popular code obfuscation techniques. The experimental results show that the proposed method can overcome the limitations described above.

关键词： Anti-obfuscation program similarity RIDG

来源：评论

学校读者我要写书评

暂无评论

Static program Behavior Tracing for program similarity Quantification 1st

Static Program Behavior Tracing for Program Similarity Quant...

引用

1st International Conference on Computational Intelligence and Informatics (ICCII)

作者： Raman, Dugyala Bezawada, Bruhadeshwar Rajinikanth, T. V. Sathyanarayan, Sai Vardhaman Coll Engn Hyderabad Andhra Pradesh India Koneru Lakshmaiah Univ Guntur India Sreenidhi Inst Sci & Technol Hyderabad Andhra Pradesh India Citibank NA Singapore Singapore

ISBN: (纸本)9789811024719;9789811024702

Characterizing program behavior using static analysis is a challenging problem. In this work, we focus on the fundamental problem of program similarity quantification, i.e., estimating the behavioral similarity of two programs. The solution to this problem is a sub-routine for many important practical problems, such as malware classification, code-cloning detection, program testing, and so on. The main difficulty is to be able to characterize the run-time program behavior without actually executing the program or performing emulation. In this work, we propose a novel behavior tracing approach to characterize program behaviors. We use the call-dependency relationship among the program API calls to generate a trace of the API calling sequence. The dependency tracking is done in a backward fashion, so as to capture the cause and effect relationship among the API calls. Our hypothesis is that this relationship can capture the program behavior to a large extent. We performed experiments by considering several "versions" of a given software, where each version was generated using the code obfuscation techniques. Our approach was found to be resilient up to 20% obfuscation, i.e., our approach correctly detected that all obfuscated programs that are similar in behavior based on the API call sequences.

关键词： program similarity Static analysis Behavior tracing Malware

来源：评论

学校读者我要写书评

暂无评论

Reporting less coincidental similarity to educate students about programming plagiarism and collusion

引用

COMPUTER SCIENCE EDUCATION 2024年第3期34卷 442-472页

作者： Karnalim, Oscar Simon Chivers, William Univ Newcastle Sch Informat & Phys Sci Univ Dr Callaghan Australia Maranatha Christian Univ Fac Informat Technol Bandung Indonesia Maranatha Christian Univ Sch Informat & Phys Sci Jl Surya Sumantri 65SukawarnaKec Sukajadi Bandung 40164 West Java Indonesia

Background and ContextTo educate students about programming plagiarism and collusion, we introduced an approach that automatically reports how similar a submitted program is to others. However, as most students receive similar feedback, those who engage in plagiarism and collusion might feel inadequately *** students are likely to be engaging in plagiarism or collusion, we would like the system to apply enough pressure on them to make them reconsider their *** study proposes a variation of the approach, which is less likely to report coincidental similarity. The variation was compared with its predecessor via quasi-experiments with 202 computing *** with the new approach are slightly more aware of programming plagiarism and collusion than those with the previous approach with a reduction in cases of such *** is another way to automatically educate students about programming plagiarism and collusion with appropriate pressure.

关键词： program similarity plagiarism collusion academic integrity computing education

来源：评论

学校读者我要写书评

暂无评论

On the Characteristics of Symbolic Execution in the Problem of Assessing the Quality of Obfuscating Transformations

引用

AUTOMATIC CONTROL AND COMPUTER SCIENCES 2022年第7期56卷 595-605页

作者： Borisov, P. D. Kosolapov, Y. V. Southern Fed Univ Rostov Na Donu 344090 Russia

Obfuscation is used to protect programs from analysis and reverse engineering. There are theoretically effective and resistant obfuscation methods, however, most of them are not implemented in practice yet. The main issues are the large overhead for the execution of obfuscated code and the limitation of application only to a specific class of programs. On the other hand, a large number of obfuscation methods have been developed that are applied in practice. The existing approaches to the assessment of such obfuscation methods are based mainly on the static characteristics of programs. Therefore, the comprehensive (taking into account the dynamic characteristics of programs) justification of their effectiveness and resistance is a relevant task. It seems that such a justification can be made using machine learning methods based on feature vectors that describe both static and dynamic characteristics of programs. In this paper, it is proposed to build such a vector on the basis of characteristics of two compared programs: the original and obfuscated, original and deobfuscated, obfuscated and deobfuscated. In order to obtain the dynamic characteristics of the program, a scheme based on a symbolic execution is constructed and presented in this paper. The choice of the symbolic execution is justified by the fact that such characteristics can describe the difficulty of comprehension of the program in dynamic analysis. This paper proposes two implementations of the scheme: extended and simplified. The extended scheme is closer to the process of analyzing a program by an analyst, since it includes the steps of disassembly and translation into intermediate code, while in the simplified scheme these steps are excluded. In order to identify the characteristics of symbolic execution that are suitable for assessing the effectiveness and resistance of obfuscation based on machine learning methods, experiments with the developed schemes were carried out. Based on the obtained resu

关键词： Keywords obfuscation symbolic execution program similarity program comprehension

来源：评论

学校读者我要写书评

暂无评论

Automated System for Numerical similarity Evaluation of Android Applications

引用

AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS 2024年第SUPPL3期58卷 S131-S142页

作者： Petrov, V. V. Kazan Fed Univ Inst Informat Technol & Intelligent Syst Kazan 420008 Russia

This paper is devoted to the design and development of a system for automating numerical similarity assessment of Android applications. The task of the evaluation of application similarity is reduced to the similarity evaluation of sets of control flow graphs constructed based on code from *** files of applications. The similarity value was calculated based on the similarity matrix. The algorithms of graph editing and Levenshtein distance were used to compare control flow graphs. The application similarity criteria were formulated, and their representation forms were investigated. Types of Android application models and methods of their construction are presented. A prototype of the system for automating the numerical evaluation of Android-applications similarity is developed. Optimization of the software solution is performed with the help of parallel programming tools. Experiments are carried out, and a conclusion is drawn concerning the ability of the developed system to detect similarities between Android applications.

关键词： Android application similarity program similarity similarity matrix control flow graph edit distance similarity matrix visualization control flow graph

来源：评论

学校读者我要写书评

暂无评论

Discovering Multiple Design Approaches in programming Assignment Submissions 21

Discovering Multiple Design Approaches in Programming Assign...

引用

36th Annual ACM Symposium on Applied Computing (SAC)

作者： Nikhila, K. N. Chakrabarti, Sujit Kumar Gupta, Manish Int Inst Informat Technol Bangalore Karnataka India

ISBN: (纸本)9781450381048

In this paper, we present a novel approach of automated evaluation of programming assignments (AEPA) the highlight of which is that it automatically identifies multiple solution approaches to the programming question from the set of submitted solutions. Our approach does not require the instructor to foresee all the possible solution approaches and accomplishes this task with little or no human intervention. This paves the way to multiple fundamental improvements in the way automated evaluation of programming assignments is done today. We have applied our method on multiple data sets of practical scale. In all cases, our method was able to detect the solution approaches employed by the students.

关键词： Automated Evaluation programming Assignments program similarity Node clustering

来源：评论

学校读者我要写书评

暂无评论

Calibration and Analysis of Source Code similarity Measures for Verilog Hardware Description Language Projects 20

Calibration and Analysis of Source Code Similarity Measures ...

引用

51st ACM SIGCSE Technical Symposium on Computer Science Education (SIGCSE)

作者： Power, James F. Waldron, John Maynooth Univ Dept Comp Sci Maynooth Kildare Ireland Trinity Coll Dublin Sch Comp Sci & Stat Lero Dublin Ireland

ISBN: (纸本)9781450367936

In this paper we report on our experiences during a first-year course on digital logic design using the Verilog hardware description language. As part of the course the students were given a series of take-home assignments, which were then marked using an automated assessment system developed by the authors. During the course the instructor was made aware that a set of solutions had been circulated to the students, and was asked to assess the impact that this had on the assessment regime. In order to answer this question, we examined and implemented a number of approaches to calculating similarity between Verilog programs, and we present the results of that study in this paper. An important feature of this work was ensuring that the measurements used were well-understood, properly calibrated and defensible. We report on the results of this study, applied to a class of 115 students who completed up to 11 projects each.

关键词： Automated assessment program similarity hardware description language

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：