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

Experimental evaluation of a tool for the verification and transformation of source code in event-driven systems

EMPIRICAL SOFTWARE ENGINEERING 2009年第6期14卷 720-777页

作者： Gulesir, Gurcan van den Berg, Klaas Bergmans, Lodewijk Aksit, Mehmet Univ Twente Dept Comp Sci NL-7500 AE Enschede Netherlands Univ Twente Software Engn Grp NL-7500 AE Enschede Netherlands

In event-driven systems, separating the reactive part of software (i.e., event-driven control) from the non-reactive part is a common design practice. The reactive part is typically structured according to the states and transitions of a system, whereas the non-reactive part is typically structured according to the concepts of the application domain (e.g., the services provided by the system). In such systems, the non-reactive part of software stimulates the reactive part with event calls. Whenever the non-reactive part is modified (e.g., during evolution), the existing event calls may become invalid, new event calls may become necessary, and the two parts of software may become incompatible. Manually finding and repairing these types of defects is a time-consuming and error-prone maintenance task. In this article, we present a solution that combines source code model checking and aspect-oriented programming techniques, to reduce the time spent by developers and to automatically find defects, while performing the maintenance task mentioned above. In addition, we present controlled experiments showing that the solution can reduce the time by 75%, and enable the prevention of one defect per 140 lines of source code.

关键词： Event-driven systems source code verification source code transformation Formal experiment

来源：评论

学校读者我要写书评

暂无评论

Automatic software tailoring for Green Internet of Things

引用

INTERNET OF THINGS 2025年 30卷

作者： Aragon-Jurado, Jose Miguel de la Torre, Juan Carlos Ruiz, Patricia Dorronsoro, Bernabe Univ Cadiz Sch Engn Puerto Real Spain

The proliferation of low-capacity, interconnected Internet of Things devices has increased the need for energy efficient software. Optimizing software performance for specific hardware requires tailored code transformations, as universal compiler optimizations are insufficient. Moreover, the diversity of devices and the software running on them requires automating this process. This work presents a novel combinatorial optimization problem focused on minimizing software energy consumption for specific hardware, and a methodology for solving it that accounts for system uncertainty. Additionally, a novel device for measuring the energy consumption during run time is introduced. This meter synchronizes with the experiments, enabling the automatic optimization of software as a combinatorial optimization problem. Specifically, the problem involves finding an LLVM transformation sequence that minimizes energy consumption during software execution. In our experiments, we considered two different software benchmarks and two embedded devices, using a cellular genetic algorithm to optimize them, alongside five state-of-the-art approaches to manage uncertainty. Our results demonstrate that the proposed methodology successfully overcomes uncertainty, leading to greener solutions with improvements of up to 62.29% in run time and up to 58.21% in energy consumption, outperforming the best generic compilation flags by up to 32.12% in run time and 27.84% in energy consumption.

关键词： Green software Green Internet of Things LLVM Energy consumption Uncertainty source code transformation Evolutionary computation

来源：评论

学校读者我要写书评

暂无评论

source code transformations for Improving Security of Time-bounded K-variant Systems

引用

INFORMATION AND SOFTWARE TECHNOLOGY 2021年 137卷 106601-106601页

作者： Bekiroglu, Berk Korel, Bogdan IIT Chicago IL 60616 USA

Context: source code transformation techniques can improve the security of systems against memory exploitation attacks. As such, the chance of exploitation of security vulnerabilities can be decreased by using different controlled source code transformation techniques. In K-variant architecture, multiple variants of a program are generated through a controlled source code transformation to improve the security of systems. Objective: To investigate the effectiveness and practicality of source code program transformations in improving the security of time-bounded K-variant systems for memory exploitation attacks. Method: The effectiveness of program transformations in improving the security of time-bounded K-variant systems is experimentally investigated for different memory attacks. Results: The results suggest that generating multiple variants using the presented transformations significantly improves the survivability of time-bounded K-variant systems under memory exploitation attacks. Conclusion: We conclude that generating multi-variants in time-bounded K-variant systems in accordance with the presented program transformations may improve the security of time-bounded K-variant systems significantly for memory exploitation attacks with a reasonable cost and overhead.

关键词： K-variant architecture System security Multiple variant architecture source code transformation Memory exploitation attacks

来源：评论

学校读者我要写书评

暂无评论

code and data structure partitioning for parallel and flexible MPSoC specification using designer-controlled recoding

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2008年第6期27卷 1078-1090页

作者： Chandraiah, Pramod Doemer, Rainer Univ Calif Irvine Irvine CA 92697 USA

MultiProcessor Systems-on-Chip (MPSoCs) are increasingly being used to build efficient and cost-effective embedded systems that meet the necessary real-time requirements. However, programming heterogeneous MPSoCs is highly challenging. The existing automatic parallelizing techniques, although effective on homogeneous shared-memory architectures, are insufficient for MPSoCs, which are typically characterized by heterogeneous processing elements and memory architectures. The lack of effective automatic techniques for recoding and parallelization requires designers to manually partition the code and the data structures in the reference application to generate a parallel and flexible specification model. Such manual algorithm partitioning by the designer is time consuming and error prone. In this paper, we motivate the need for automation in system specification and present a novel designer-controlled approach to recode applications written in a C-based System-Level Description Language. We present six automated source code transformations that, under the control of the designer, automatically partition and reorganize code and data structures to create a parallel and flexible abstract specification model that can be mapped onto a heterogeneous MPSoC using a top-down system-level design flow. Our experimental results show significant productivity gains and quality improvements in the end design.

关键词： code and data partitioning design automation multi-processor systems-on-chip recoding source code transformation system level design

来源：评论

学校读者我要写书评

暂无评论

Trading-off security and performance in barrier slicing for remote software entrusting

引用

AUTOMATED SOFTWARE ENGINEERING 2009年第2期16卷 235-261页

作者： Ceccato, Mariano Preda, Mila Dalla Nagra, Jasvir Collberg, Christian Tonella, Paolo Fdn Bruno Kessler Trento Italy Univ Trent Trento Italy Univ Arizona Tucson AZ USA

Network applications often require that a trust relationship is established between a trusted host (e.g., the server) and an untrusted host (e.g., the client). The remote entrusting problem is the problem of ensuring the trusted host that whenever a request from an untrusted host is served, the requester is in a genuine state, unaffected by malicious modifications or attacks. Barrier slicing helps solve the remote entrusting problem. The computation of the sensitive client state is sliced and moved to the server, where it is not possible to tamper with it. However, this solution might involve unacceptable computation and communication costs for the server, especially when the slice to be moved is large. In this paper, we investigate the trade-off between security loss and performance overhead associated with moving only a portion of the barrier slice to the server and we show that this trade-off can be reduced to a multi-objective optimization problem. We describe how to make decisions in practice with reference to a case study, for which we show how to choose among the alternative options.

关键词： Program slicing Security source code transformation

来源：评论

学校读者我要写书评

暂无评论

Survivability Analysis of K-Variant Architecture for Different Memory Attacks and Defense Strategies

引用

IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING 2021年第4期18卷 1868-1881页

作者： Bekiroglu, Berk Korel, Bogdan IIT Dept Comp Sci Chicago IL 60616 USA

Many systems require high security during a limited operational timeframe. These systems can be exposed to many attacks that prevent tasks from being completed. To reduce the chances of a successful attack and increase the security of these systems, many fault tolerance architectures and defense strategies have been developed. N-version architecture is one technique to improve reliability and security. In this architecture, functionally equivalent variants of a program are developed and executed concurrently. However, due to the high cost of developing and maintaining N versions, it is used for large budget projects. In this paper, an alternative approach to improve security is K-variant architecture. By applying safe and automated program transformations, functionally equivalent variants of the original program are generated. The goal is to shift vulnerabilities in variants into different locations. These variants are executed simultaneously to complete a task so that the chance of a successful exploitation attack is decreased. In this paper, several types of memory exploitation attacks are analyzed along with the proposed four defense strategies. The experimental study investigates the effectiveness of defense strategies against these attacks. The results suggest that K-variant architecture with the proposed defense strategies may significantly improve the security of systems.

关键词： Security Buffer overflows Memory architecture Reliability Task analysis Analytical models Attack survivability source code transformation N-version architecture k-variant architecture memory exploitation attacks defense strategies

来源：评论

学校读者我要写书评

暂无评论

Automatic Software Tailoring for Optimal Performance

IEEE TRANSACTIONS ON SUSTAINABLE COMPUTING

引用

IEEE TRANSACTIONS ON SUSTAINABLE COMPUTING 2024年第3期9卷 464-481页

作者： Aragon-Jurado, Jose Miguel de la Torre, Juan Carlos Ruiz, Patricia Galindo, Pedro L. Zomaya, Albert Y. Dorronsoro, Bernabe Univ Cadiz Cadiz 11003 Spain Univ Cadiz Intelligent Syst Grp Cadiz 11003 Spain Univ Sydney Ctr Distributed & High Performance Comp Camperdown NSW 2050 Australia Univ Sydney Camperdown NSW 2050 Australia

Efficient green software solutions require being aware of the characteristics of both the software and the hardware where it is executed. Separately optimizing them leads to inefficient results, and there is a need for a perfect synergy between software and hardware for optimal outcomes. We present a novel combinatorial optimization problem for the minimization of the software execution time on a specific hardware, taking into account the existing uncertainty in the system. A solution to the problem is a sequence of LLVM code transformations, and a cellular genetic algorithm is used to find it. Assuming that hardware does not change, reducing the software runtime typically leads to a greener version with lower consumption. To cope with the uncertainty, two novel approaches relying on bootstrap method to compute confident intervals of the software runtime at negligible cost are proposed and compared to three other techniques and -O3 Clang compilation flag over four hardware architectures. Results show how the proposed approach effectively copes with the uncertainty, providing more robust solutions with respect to the compared methods. The execution time of the raw program is reduced from 28.1% to up to 63.2%, outperforming -O3 flag by 13.9% to 26.3%, for the different architectures.

关键词： Runtime Optimization codes Uncertainty Semantics Performance evaluation Computer architecture Evolutionary computation execution time LLVM software performance source code transformation uncertainty

来源：评论

学校读者我要写书评

暂无评论

Transforming MPI source code based on communication patterns

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2010年第1期26卷 147-154页

作者： Preissl, Robert Schulz, Martin Kranzlmueller, Dieter de Supinski, Bronis R. Quinlan, Daniel J. Johannes Kepler Univ Linz GUP Dept Graph & Parallel Proc Linz Austria Lawrence Livermore Natl Lab CASC Comp Sci Grp Livermore CA USA Lawrence Livermore Natl Lab ADEPT Adv Simulat & Comp Program Livermore CA USA Univ Munich Dept Comp Sci Munich Germany Bavarian Acad Sci Leibniz Supercomp Ctr LRZ Garching Germany

A high-level understanding of communication behavior can facilitate performance optimization of HPC applications. In particular, MPI communication patterns can serve as the basis of code transformations that substitute more efficient operations for those originally used by the application developer. We present a novel algorithm for identifying MPI communication patterns and a mechanism to perform source code transformations based on the observed patterns. Our transformation mechanism, implemented within the ROSE compiler framework, modifies the abstract syntax tree based on static analysis that confirms the generalizability of the patterns that we detect. Our results demonstrate the efficiency of our approach. Our pattern detection algorithm. which we evaluate with realistic applications using traces from up to 128 processors as well as with simple benchmarks, has low overhead as input or job size grows. Our transformation mechanism quickly optimizes MPI source code by replacing MPI code fragments for collective operations through highly optimized native MPI functions and by increasing the overlapping of communication and computation. (C) 2009 Elsevier B.V. All rights reserved.

关键词： MPI communication pattern ROSE compiler framework source code transformation Abstract syntax tree Suffix tree

来源：评论

学校读者我要写书评

暂无评论

SPOON: A library for implementing analyses and transformations of Java source code

引用

SOFTWARE-PRACTICE & EXPERIENCE 2016年第9期46卷 1155-1179页

作者： Pawlak, Renaud Monperrus, Martin Petitprez, Nicolas Noguera, Carlos Seinturier, Lionel Cincheo Paris France Univ Lille Campus Sci F-59655 Villeneuve Dascq France Inria F-59650 Villeneuve Dascq France Vrije Univ Brussel B-1050 Brussels Belgium

This paper presents SPOON, a library for the analysis and transformation of Java source code. SPOON enables Java developers to write a large range of domain-specific analyses and transformations in an easy and concise manner. SPOON analyses and transformations are written in plain Java. With SPOON, developers do not need to dive into parsing, to hack a compiler infrastructure, or to master a new formalism. Copyright (c) 2015 John Wiley & Sons, Ltd.

关键词： source code analysis source code transformation metaprogramming

来源：评论

学校读者我要写书评

暂无评论

Mechanisms for source code Obfuscation in C: Novel Techniques and Implementation 2

Mechanisms for Source Code Obfuscation in C: Novel Technique...

引用

2nd IEEE International Conference on Emerging Smart Computing and Informatics (ESCI)

作者： Ahire, Pallavi Abraham, Jibi Savitribai Phule Pune Univ Dept Technol Pune Maharashtra India Coll Engn Pune Maharashtra India

ISBN: (纸本)9781728152639

Due to exponential growth of internet, there is abundant assistance available online to learn programming languages much more efficiently. Most of the programmers use this valuable knowledge for the constructive purpose, whereas some of them are using this for the illegal means like unethical hacking, code spoofing, reverse engineering and many more. So to protect the applications from the anonymous attackers, the respective source codes are secured by converting them in the form of .exe, .jar, .bat, .property, .class and .jad files to store at the cloud server end. But most of the repositories store the bare source code at their cloud server end, which is inevitably a feast to the attackers. So to secure the bare source codes, obfuscation techniques are playing a vital role which eventually camouflage the written logic and leave the attacker in confused mode. So as a tiny step towards this idea of obfuscation, this paper presents seven available C obfuscators and four novel data obfuscation techniques that are being applied on '+' arithmetic operator that may lead to the new obfuscation arena.

关键词： Cloud Computing source code transformation code Obfuscation Data Obfuscation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：