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

Evaluating control-flow graph Similarity for Grading Programming Exercises

Evaluating Control-Flow Graph Similarity for Grading Program...

International Conference on Data and Software Engineering (ICoDSE) - Data and Software Engineering for Supporting Sustainable Development Goals

作者： Sendjaja, Kevin Rukmono, Satrio Adi Perdana, Riza Satria Inst Teknol Bandung Sch Elect Engn & Informat Bandung Indonesia

ISBN: (纸本)9781665494533

Programming has become a fundamental skill in the current digital era. A formal programming course relies on an autograder to score student works. However, the usual black-box method only compares the output instead of adequately examining the code structure. As such, another method is required to measure the structure of the student submission code to give fairer scores. In this paper, an experiment is conducted using a control-flow graph (CFG) comparison algorithm to measure the similarity between student submission code and reference code from the instructor, followed by an analysis of the results obtained from the experiment. The comparison was made using the Hu Algorithm [1], based on previous CFG similarity measurements presented by Chan and Collberg [2]. Through the experiment and analysis process, it is concluded that the CFG comparison method implemented in this research is better applied to boost students who got low scores due to minor mistakes rather than be applied to the entire student submissions as the primary scoring algorithm.

关键词： control-flow graph cost matrix white-box

来源：评论

学校读者我要写书评

暂无评论

A Machine Learning Approach for Source Code Similarity via graph-Focused Features 1

引用

9th Annual Conference on Machine Learning, Optimization and Data science (LOD)

作者： Boldini, Giacomo Diana, Alessio Arceri, Vincenzo Bonnici, Vincenzo Bagnara, Roberto Univ Parma Dept Math Phys & Comp Sci Parco Area Sci 53-A I-43124 Parma Italy

ISBN: (数字)9783031539695

ISBN: (纸本)9783031539688;9783031539695

Source code similarity aims at recognizing common characteristics between two different codes by means of their components. It plays a significant role in many activities regarding software development and analysis which have the potential of assisting software teams working on large codebases. Existing approaches aim at computing similarity between two codes by suitable representation of them which captures syntactic and semantic properties. However, they lack explainability and generalization for multiple languages comparison. Here, we present a preliminary result that attempts at providing a graph-focused representation of code by means of which clustering and classification of programs is possible while exposing explainability and generalizability characteristics.

关键词： Code Similarity Machine Learning graph-focused Features control-flow graph

来源：评论

学校读者我要写书评

暂无评论

Leveraging control flow Knowledge in SMT Solving of Program Verification

引用

ACM TRANSACTIONS ON SOFTWARE ENGINEERING AND METHODOLOGY 2021年第4期30卷 p1-26页

作者： Chen, Jianhui He, Fei Tsinghua Univ Sch Software Beijing Peoples R China MoE Key Lab Informat Syst Secur Beijing Peoples R China Beijing Natl Res Ctr Informat Sci & Technol Beijing Peoples R China

Satisfiability modulo theories (SMT) solvers have been widely applied as the reasoning engine for diverse software analysis and verification technologies. The efficiency of the SMT solver has significant effects on the performance of these technologies. However, current SMT solvers are designed for the general purpose of constraint solving. Lots of useful knowledge of programs cannot be utilized during SMT solving. As a result, the SMT solver may spend much effort to explore redundant search space. In this article, we propose a novel approach to utilizing control-flow knowledge in SMT solving. With this technique, the search space can be considerably reduced, and the efficiency of SMT solving is observably improved. We conducted extensive experiments on credible benchmarks. The results show significant improvements of our approach.

关键词： Program verification satisfiability modulo theory control-flow graph

来源：评论

学校读者我要写书评

暂无评论

Tapir: Embedding Recursive Fork-join Parallelism into LLVM's Intermediate Representation

引用

ACM TRANSACTIONS ON PARALLEL COMPUTING 2019年第4期6卷 1–33页

作者： Schardl, Tao B. Moses, William S. Leiserson, Charles E. MIT Comp Sci & Artificial Intelligence Lab 32 Vassar St Cambridge MA 02139 USA

Tapir (pronounced TAY-per) is a compiler intermediate representation (IR) that embeds recursive fork-join parallelism, as supported by task-parallel programming platforms such as Cilk and OpenMP, into a mainstream compiler's IR. Mainstream compilers typically treat parallel linguistic constructs as syntactic sugar for function calls into a parallel runtime. These calls prevent the compiler from performing optimizations on and across parallel control constructs. Remedying this situation has generally been thought to require an extensive reworking of compiler analyses and code transformations to handle parallel semantics. Tapir leverages the "serial-projection property," which is commonly satisfied by task-parallel programs, to handle the semantics of these programs without an extensive rework of the compiler. For recursive fork-join programs that satisfy the serial-projection property, Tapir enables effective compiler optimization of parallel programs with only minor changes to existing compiler analyses and code transformations. Tapir uses the serial-projection property to order logically parallel fine-grained tasks in the program's control-flow graph. This ordered representation of parallel tasks allows the compiler to optimize parallel codes effectively with only minor modifications. For example, to implement Tapir/LLVM, a prototype of Tapir in the LLVM compiler, we added or modified less than 3,000 lines of LLVM's half-millionline core middle-end functionality. These changes sufficed to enable LLVM's existing compiler optimizations for serial code including loop-invariant-code motion, common-subexpression elimination, and tail-recursion elimination-to work with parallel control constructs such as parallel loops and Cilk's cilk_spawn keyword. Tapir also supports parallel optimizations, such as loop scheduling, which restructure the parallel control flow of the program. By making use of existing LLVM optimizations and new parallel optimizations, Tapir/LLVM can opti

关键词： Cilk compiling control-flow graph fork-join parallelism LLVM multicore OpenMP optimization parallel computing serial-projection property Tapir

来源：评论

学校读者我要写书评

暂无评论

DoSE: Deobfuscation based on Semantic Equivalence 8

DoSE: Deobfuscation based on Semantic Equivalence

引用

8th Software Security, Protection, and Reverse Engineering Workshop (SSPREW)

作者： Tofighi-Shirazi, Ramtine Christofi, Maria Elbaz-Vincent, Philippe Le, Thanh-ha Univ Grenoble Alpes CNRS Inst Fourier F-38000 Grenoble France Trusted Labs Meudon France Oppida Montigny Le Bretonneux France

ISBN: (纸本)9781450360968

Software deobfuscation is a key challenge in malware analysis to understand the internal logic of the code and establish adequate countermeasures. In order to defeat recent obfuscation techniques, state-of-the-art generic deobfuscation methodologies are based on dynamic symbolic execution (DSE). However, DSE suffers from limitations such as code coverage and scalability. In the race to counter and remove the most advanced obfuscation techniques, there is a need to reduce the amount of code to cover. To that extend, we propose a novel deobfuscation approach based on semantic equivalence, called DoSE. With DoSE, we aim to improve and complement DSE-based deobfuscation techniques by statically eliminating obfuscation transformations (built on code-reuse). This improves the code coverage. Our method's novelty comes from the transposition of existing binary diffing techniques, namely semantic equivalence checking, to the purpose of the deobfuscation of untreated techniques, such as two-way opaque constructs, that we encounter in surreptitious software. In order to challenge DoSE, we used both known malwares such as Cryptowall, WannaCry, Flame and BitCoinMiner and obfuscated code samples. Our experimental results show that DoSE is an efficient strategy of detecting obfuscation transformations based on code-reuse with low rates of false positive and/or false negative results in practice, and up to 63% of code reduction on certain types of malwares.

关键词： Obfuscation deobfuscation reverse engineering malware analysis symbolic execution opaque predicate control-flow graph code cloning

来源：评论

学校读者我要写书评

暂无评论

control flow-Guided SMT Solving for Program Verification 18

Control Flow-Guided SMT Solving for Program Verification

引用

33rd IEEE/ACM International Conference on Automated Software Engineering (ASE)

作者： Chen, Jianhui He, Fei Tsinghua Univ Sch Software Key Lab Informat Syst Secur MoEBeijing Natl Res Ctr Informat Sci & Technol Beijing Peoples R China

ISBN: (数字)9781450359375

ISBN: (纸本)9781450359375

Satisfiability modulo theories (SMT) solvers have been widely applied as the reasoning engine for diverse software analysis and verification technologies. The efficiency of the SMT solver has significant effects on the performance of these technologies. However, the current SMT solvers are designed for the general purpose of constraint solving. Many useful knowledge of programs cannot be utilized during the SMT solving. As a result, the SMT solver may spend a lot of effort to explore redundant search space. In this paper, we propose a novel approach for utilizing control-flow knowledge in SMT solving. With this technique, the search space can be considerably reduced and the efficiency of SMT solving is observably improved. We conducted extensive experiments on credible benchmarks, the results show orders of magnitude improvements of our approach.

关键词： Program verification Satisfiability modulo theory control-flow graph

来源：评论

学校读者我要写书评

暂无评论

Tapir: Embedding Fork-Join Parallelism into LLVM's Intermediate Representation 17

Tapir: Embedding Fork-Join Parallelism into LLVM's Intermedi...

引用

22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP)

作者： Schardl, Tao B. Moses, William S. Leiserson, Charles E. MIT Comp Sci & Artificial Intelligence Lab 32 Vassar St Cambridge MA 02139 USA

ISBN: (纸本)9781450344937

This paper explores how fork-join parallelism, as supported by concurrency platforms such as Cilk and OpenMP, can be embedded into a compiler's intermediate representation (IR). Mainstream compilers typically treat parallel linguistic constructs as syntactic sugar for function calls into a parallel runtime. These calls prevent the compiler from performing optimizations across parallel control constructs. Remedying this situation is generally thought to require an extensive reworking of compiler analyses and code transformations to handle parallel semantics. Tapir is a compiler IR that represents logically parallel tasks asymmetrically in the program's control flow graph. Tapir allows the compiler to optimize across parallel control constructs with only minor changes to its existing analyses and code transformations. To prototype Tapir in the LLVM compiler, for example, we added or modified about 6000 lines of LLVM's 4-million-line codebase. Tapir enables LLVM's existing compiler optimizations for serial code - including loop-invariant-code motion, common-subexpression elimination, and tail-recursion elimination - to work with parallel control constructs such as spawning and parallel loops. Tapir also supports parallel optimizations such as loop scheduling.

关键词： Cilk compiling control-flow graph fork-join parallelism LLVM multicore OpenMP optimization parallel computing serial semantics Tapir

来源：评论

学校读者我要写书评

暂无评论

A Method to Evaluate CFG Comparison Algorithms 14

A Method to Evaluate CFG Comparison Algorithms

引用

14th Annual International Conference on Quality Software (QSIC)

作者： Chan, Patrick P. F. Collberg, Christian Univ Arizona Dept Comp Sci Tucson AZ 85721 USA

ISBN: (纸本)9781479971978

control-flow graph (CFG) similarity is a core technique in many areas, including malware detection and software plagiarism detection. While many algorithms have been proposed in the literature, their relative strengths and weaknesses have not been previously studied. Moreover, it is not even clear how to perform such an evaluation. In this paper we therefore propose the first methodology for evaluating CFG similarity algorithms with respect to accuracy and efficiency. At the heart of our methodology is a technique to automatically generate benchmark graphs, CFGs of known edit distances. We show the result of applying our methodology to four popular algorithms. Our results show that an algorithm proposed by Hu et al. is most efficient both in terms of running time and accuracy.

关键词： flow graphs invasive software program debugging CFG comparison algorithm CFG similarity algorithm control-flow graph malware detection software plagiarism detection Accuracy Algorithm design and analysis Approximation algorithms Benchmark testing Malware Software Software algorithms Invasive software Algorithm design and analysis Spyware Software algorithms Debugging Benchmark testing flowcharts Approximation algorithms computer software

来源：评论

学校读者我要写书评

暂无评论

SSI Properties Revisited

引用

ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS 2012年第1期11卷 21-21页

作者： Boissinot, Benoit Brisk, Philip Darte, Alain Rastello, Fabrice UCB Lyon 1 ENS Lyon CNRS UMRLIPCompsys TeamInria 5668 Lyon France Univ Calif Riverside Riverside CA 92521 USA

The static single information (SSI) form is an extension of the static single assignment (SSA) form, a well-established compiler intermediate representation that has been successfully used for numerous compiler analysis and optimizations. Several interesting results have also been shown for SSI form concerning liveness analysis and the representation of live-ranges of variables, which could make SSI form appealing for just-in-time compilation. Unfortunately, we have uncovered several mistakes in the previous literature on SSI form, which, admittedly, is already quite sparse. This article corrects the mistakes that are most germane to SSI form. We first explain why the two definitions of SSI form proposed in past literature, first by C. S. Ananian, then by J. Singer, are not equivalent. Our main result is then to prove that basic blocks, and thus program points, can be totally ordered so that live-ranges of variables correspond to intervals on a line, a result that holds for both variants of SSI form. In other words, in SSI form, the intersection graph defined by live-ranges is an interval graph, a stronger structural property than for SSA form for which the intersection graph of live-ranges is chordal. Finally, we show how this structure of live-ranges can be used to simplify liveness analysis.

关键词： Algorithms Languages Theory control-flow graph interval graph liveness analysis loop nesting forest static single assignment (SSA) static single information (SSI) intersection/interference graph program structure tree (PST)

来源：评论

学校读者我要写书评

暂无评论

New aspect-oriented constructs for security hardening concerns

引用

COMPUTERS & SECURITY 2009年第6期28卷 341-358页

作者： Mourad, Azzam Soeanu, Andrei Laverdiere, Marc-Andre Debbabi, Mourad Concordia Univ Comp Secur Lab Concordia Inst Informat Syst Engn Montreal PQ Canada

In this paper, we present new pointcuts and primitives to Aspect-Oriented Programming (AOP) languages that are needed for systematic hardening of security concerns. The two proposed pointcuts allow to identify particular join points in a program's control-flow graph (CFG). The first one is the GAflow, Closest Guaranteed Ancestor, which returns the closest ancestor join point to the pointcuts of interest that is on all their runtime paths. The second one is the GDflow, Closest Guaranteed Descendant, which returns the closest child join point that can be reached by all paths starting from the pointcut of interest. The two proposed primitives are called ExportParameter and ImportParameter and are used to pass parameters between two pointcuts. They allow to analyze a program's call graph in order to determine how to change function signatures for passing the parameters associated with a given security hardening. We find these pointcuts and primitives to be necessary because they are needed to perform many security hardening practices and, to the best of our knowledge, none of the existing ones can provide their functionalities. Moreover, we show the viability and correctness of the proposed pointcuts and primitives by elaborating and implementing their algorithms and presenting the result of explanatory case studies. (C) 2009 Elsevier Ltd. All rights reserved.

关键词： Software security Security hardening Aspect-oriented programming Security/software engineering control-flow graph Dominators

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：