An Android application sandbox system for suspicious software detection

Smartphones are steadily gaining popularity, creating new application areas as their capabilities increase in terms of computational power, sensors and communication. Emerging new features of mobile devices give opportunity to new threats. Android is one of the newer operating systems targeting smartphones. While being based on a Linux kernel, Android has unique properties and specific limitations due to its mobile nature. This makes it harder to detect and react upon malware attacks if using conventional techniques. In this paper, we propose an Android Application Sandbox (AASandbox) which is able to perform both static and dynamic analysis on Android programs to automatically detect suspicious applications. Static analysis scans the software for malicious patterns without installing it. Dynamic analysis executes the application in a fully isolated environment, i.e. sandbox, which intervenes and logs low-level interactions with the system for further analysis. Both the sandbox and the detection algorithms can be deployed in the cloud, providing a fast and distributed detection of suspicious software in a mobile software store akin to Google's Android Market. Additionally, AASandbox might be used to improve the efficiency of classical anti-virus applications available for the Android operating system.

A framework for identification of similarities between multiple algorithms

This thesis in software engineering presents a novel automated framework to identify similar operations utilized by multiple algorithms for solving related computing problems. It provides a new effective solution to perform multi-application based algorithm analysis, employing fundamentally light-weight static analysis techniques compared to the state-of-art approaches. Significant performance improvements are achieved across the objective algorithms through enhancing the efficiency of the identified similar operations, targeting discrete application domains.

Fuzzy-logic-based health monitoring and residual-life prediction for composite helicopter rotor

A health-monitoring and life-estimation strategy for composite rotor blades is developed in this work. The cross-sectional stiffness reduction obtained by physics-based models is expressed as a function of the life of the structure using a recent phenomenological damage model. This stiffness reduction is further used to study the behavior of measurable system parameters such as blade deflections, loads, and strains of a composite rotor blade in static analysis and forward flight. The simulated measurements are obtained using an aeroelastic analysis of the composite rotor blade based on the finite element in space and time with physics-based damage modes that are then linked to the life consumption of the blade. The model-based measurements are contaminated with noise to simulate real data. Genetic fuzzy systems are developed for global online prediction of physical damage and life consumption using displacement- and force-based measurement deviations between damaged and undamaged conditions. Furthermore, local online prediction of physical damage and life consumption is done using strains measured along the blade length. It is observed that the life consumption in the matrix-cracking zone is about 12-15% and life consumption in debonding/delamination zone is about 45-55% of the total life of the blade. It is also observed that the success rate of the genetic fuzzy systems depends upon the number of measurements, type of measurements and training, and the testing noise level. The genetic fuzzy systems work quite well with noisy data and are recommended for online structural health monitoring of composite helicopter rotor blades.

A numerical investigation of ductile fracture initiation in a high-strength low-alloy steel

In this work, static and drop-weight impact experiments, which have been conducted using three-point bend fracture specimens of a high-strength low-alloy steel, are analysed by performing finite-element simulations. The Gurson constitutive model that accounts for the ductile failure mechanisms of microvoid nucleation, growth and is employed within the framework of a finite deformation plasticity theory. Two populations of second-phase particles are considered, including large inclusions which initiate voids at an early stage and small particles which require large strains to nucleate voids. The most important objective of the work is to assess quantitatively the effects of material inertia, strain rate sensitivity and local adiabatic temperature rise (due to conversion of plastic work into heat) on dynamic ductile crack initiation. This is accomplished by comparing the evolution histories of void volume fraction near the notch tip in the static analysis with the dynamic analyses. The results indicate that increased strain hardening caused by strain rate sensitivity, which becomes important under dynamic loading, plays a benign role in considerably slowing down the void growth rate near the notch tip. This is partially opposed by thermal softening caused by adiabatic heating near the notch tip.

Variable Granularity Access Tracking Scheme for Improving the Performance of Software Transactional Memory

Software transactional memory (STM) has been proposed as a promising programming paradigm for shared memory multi-threaded programs as an alternative to conventional lock based synchronization primitives. Typical STM implementations employ a conflict detection scheme, which works with uniform access granularity, tracking shared data accesses either at word/cache line or at object level. It is well known that a single fixed access tracking granularity cannot meet the conflicting goals of reducing false conflicts without impacting concurrency adversely. A fine grained granularity while improving concurrency can have an adverse impact on performance due to lock aliasing, lock validation overheads, and additional cache pressure. On the other hand, a coarse grained granularity can impact performance due to reduced concurrency. Thus, in general, a fixed or uniform granularity access tracking (UGAT) scheme is application-unaware and rarely matches the access patterns of individual application or parts of an application, leading to sub-optimal performance for different parts of the application(s). In order to mitigate the disadvantages associated with UGAT scheme, we propose a Variable Granularity Access Tracking (VGAT) scheme in this paper. We propose a compiler based approach wherein the compiler uses inter-procedural whole program static analysis to select the access tracking granularity for different shared data structures of the application based on the application's data access pattern. We describe our prototype VGAT scheme, using TL2 as our STM implementation. Our experimental results reveal that VGAT-STM scheme can improve the application performance of STAMP benchmarks from 1.87% to up to 21.2%.

An efficient hybrid approach for design of automotive wheel bearings

Wheel bearings play a crucial role in the mobility of a vehicle by minimizing motive power loss and providing stability in cornering maneuvers. Detailed engineering analysis of a wheel bearing subsystem under dynamic conditions poses enormous challenges due to the nonlinearity of the problem caused by multiple factional contacts between rotating and stationary parts and difficulties in prediction of dynamic loads that wheels are subject to. Commonly used design methodologies are based on equivalent static analysis of ball or roller bearings in which the latter elements may even be represented with springs. In the present study, an advanced hybrid approach is suggested for realistic dynamic analysis of wheel bearings by combining lumped parameter and finite element modeling techniques. A validated lumped parameter representation serves as an efficient tool for the prediction of radial wheel load due to ground reaction which is then used in detailed finite element analysis that automatically accounts for contact forces in an explicit formulation.

Identifying services from Legacy batch applications

Transaction processing is a key constituent of the IT workload of commercial enterprises (e.g., banks, insurance companies). Even today, in many large enterprises, transaction processing is done by legacy "batch" applications, which run offline and process accumulated transactions. Developers acknowledge the presence of multiple loosely coupled pieces of functionality within individual applications. Identifying such pieces of functionality (which we call "services") is desirable for the maintenance and evolution of these legacy applications. This is a hard problem, which enterprises grapple with, and one without satisfactory automated solutions. In this paper, we propose a novel static-analysis-based solution to the problem of identifying services within transaction-processing programs. We provide a formal characterization of services in terms of control-flow and data-flow properties, which is well-suited to the idioms commonly exhibited by business applications. Our technique combines program slicing with the detection of conditional code regions to identify services in accordance with our characterization. A preliminary evaluation, based on a manual analysis of three real business programs, indicates that our approach can be effective in identifying useful services from batch applications.

Precise Slicing in Imperative Programs via Term-Rewriting and Abstract Interpretation

We propose a new approach for producing precise constrained slices of programs in a language such as C. We build upon a previous approach for this problem, which is based on term-rewriting, which primarily targets loop-free fragments and is fully precise in this setting. We incorporate abstract interpretation into term-rewriting, using a given arbitrary abstract lattice, resulting in a novel technique for slicing loops whose precision is linked to the power of the given abstract lattice. We address pointers in a first-class manner, including when they are used within loops to traverse and update recursive data structures. Finally, we illustrate the comparative precision of our slices over those of previous approaches using representative examples.

Compiler/Runtime Framework for Dynamic Dataflow Parallelization of Tiled Programs

Task-parallel languages are increasingly popular. Many of them provide expressive mechanisms for intertask synchronization. For example, OpenMP 4.0 will integrate data-driven execution semantics derived from the StarSs research language. Compared to the more restrictive data-parallel and fork-join concurrency models, the advanced features being introduced into task-parallelmodels in turn enable improved scalability through load balancing, memory latency hiding, mitigation of the pressure on memory bandwidth, and, as a side effect, reduced power consumption. In this article, we develop a systematic approach to compile loop nests into concurrent, dynamically constructed graphs of dependent tasks. We propose a simple and effective heuristic that selects the most profitable parallelization idiom for every dependence type and communication pattern. This heuristic enables the extraction of interband parallelism (cross-barrier parallelism) in a number of numerical computations that range from linear algebra to structured grids and image processing. The proposed static analysis and code generation alleviates the burden of a full-blown dependence resolver to track the readiness of tasks at runtime. We evaluate our approach and algorithms in the PPCG compiler, targeting OpenStream, a representative dataflow task-parallel language with explicit intertask dependences and a lightweight runtime. Experimental results demonstrate the effectiveness of the approach.

考虑海床变形的裸露悬跨海底管道静力分析

针对裸露悬跨海底管道,考虑线弹性海床刚度,利用梁的小挠度理论,研究管道在自重作用下的变形和内力,推导给出了未脱离海床的管道段和悬跨管道段的变形和内力公式。在跨度较大的悬跨情况下,悬跨管道段较大的向下弯曲变形可能引起海床上管道脱离海床而翘起。建立管道翘起的判定准则,对于翘起情况推导相应的计算公式,通过算例给出翘起情况下管道的变形和内力。通过计算分析发现：工程上多数悬跨是翘起情况,没有翘起的计算公式只适应于跨度较小的悬跨管道。同时翘起情况下不同海床刚度对悬跨管道无量纲内力影响不大。

Surf oholeko gilen elementu finitu bidezko analisia.

[EU]Lan honetan, surf oholetan erabiltzen diren gila mota desberdinen analisia egin da. Horretarako, merkatuan garrantzi handiena duten bi enpresek euren katalogoetan eskaintzen dituzten modelo batzuk aztertu dira. Ingeniaritza simulazioak ahalbidetzen dituen ansys softwarea erabiliz egin da aukeratutako modeloen diseinu geometrikoa. Hauen analisiari ekin baino lehenago, gila hauetako bat aztertu da, hau osatzen duen materiala ezagutu eta ezaugarriak zehaztu asmoz. Aztertutakoa modelo guztiek erabiltzen duten ohiko materiala izanik, lortutako emaitzak baliogarriak dira gila guztiak aztertzeko. Materialaren propietateak ezagututa eta aipatutako softwareaz baliatuz, analisi estatikoa egin da. Horretarako, surfean aurkitzen diren ohiko egoera batzuk irudikatu dira, hauetan agertzen diren esfortzuak kalkulatuz. Gila bakoitzaren portaera, jasandako tentsio eta deformazioak aztertuz ondorioztatu da. Horrela, kasu bakoitzean komenigarrienak diren ezaugarriak oinarri hartuz, modelo desberdinen arteko konparaketa egin da.

Estabilidade de talude com efeito sísmico a partir dos métodos de equilíbrio limite e de elementos finitos.

A Costa Peruana apresenta alta atividade sísmica, tornando imprescindível a execução de análises de estabilidade que considerem os eventos sísmicos. Com o desenvolvimento de novas ferramentas numéricas, a análise dinâmica está se tornando cada vez mais importante e usual na fase de projeto, não se justificando mais a execução de análises estáticas em locais tão vulneráveis a sismos. A presente dissertação tem como objetivo realizar a análise da estabilidade dos Penhascos de Lima, Peru, considerando quatro taludes distintos, em uma região bastante afetada por abalos sísmicos. As análises foram executadas pelos métodos de equilíbrio limite, elementos finitos e pseudo-estático, buscando-se uma comparação entre os diferentes métodos. O trabalho apresenta uma descrição completa dos taludes em estudo, uma avaliação da condição sismológica da região e finalmente a estabilidade dos Penhascos de Lima, fazendo uso dos programas computacionais Slide (método do equilíbrio limite) e Plaxis (método dos elementos finitos) em 2D. Os resultados mostraram que os três métodos adotados forneceram fatores de segurança compatíveis, principalmente quando se considera perfis menos estratificados. Para perfis homogêneos, as diferenças obtidas foram da ordem de 0,5 a 1,0 %. As análises ressaltaram a importância de considerar a condição dinâmica, e mostraram-se bastante sensíveis aos valores de carga sísmica adotado.

精确的程序静态分析

程序的静态分析是程序语言和编译领域的一个重要研究方向，已经被研究了很多年。近年来，它也引起形式方法和软件工程领域的重视，被用于程序测试和正确性验证。文中从程序的语法特征、所关心的数据类型和程序性质等方面比较了一些静态分析技术。着重描述基于路径的分析方法，特别是符号执行技术，讨论了程序路径可行性分析问题及其分类、复杂度。针对程序分析精度的一种量化指标，说明了其计算方法。

程序静态分析技术与工具

静态分析对于保证程序质量,提高软件生产率有重要的意义.本文综述了静态分析常用的策略,介绍了当前静态分析的研究现状,比较了目前已有的静态程序分析工具.

automated test case generation for the stress testing of multimedia systems

With the advancement in network bandwidth and computing power, multimedia systems have become a popular means for information delivery. However, general principles of system testing cannot be directly applied to testing of multimedia systems on account of their stringent temporal and synchronization requirements. In particular, few studies have been made on the stress testing of multimedia systems with respect to their temporal requirements under resource saturation. Stress testing is important because erroneous behavior is most likely to occur under resource saturation. This paper presents an automatable method of test case generation for the stress testing of multimedia systems. It adapts constraint solving techniques to generate test cases that lead to potential resource saturation in a multimedia system. Coverage of the test cases is defined upon the reachability graph of a multimedia system. The proposed stress testing technique is supported by tools and has been successfully applied to a real-life commercial multimedia system. Although our technique focuses on the stress testing of multimedia systems, the underlying issues and concepts are applicable to other types of real-time systems.