Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 30 of 128

Full-Text Articles in Physical Sciences and Mathematics

Optimal Management Of Virtual Infrastructures Under Flexible Cloud Service Agreements, Zhiling Guo, Jin Li, Ram Ramesh Dec 2019

Optimal Management Of Virtual Infrastructures Under Flexible Cloud Service Agreements, Zhiling Guo, Jin Li, Ram Ramesh

Research Collection School Of Computing and Information Systems

A cloud service agreement entails the provisioning of a required set of virtual infrastructure resources at a specified level of availability to a client. The agreement also lays out the price charged to the client and a penalty to the provider when the assured availability is not met. The availability assurance involves backup resource provisioning, and the provider needs to allocate backups cost-effectively by balancing the resource-provisioning costs with the potential penalty costs. We develop stochastic dynamic optimization models of the backup resource-provisioning problem, leading to cost-effective resource-management policies in different practical settings. We present two sets of dynamic provisioning …


An Iot-Driven Smart Cafe Solution For Human Traffic Management, Maruthi Prithivirajan, Kyong Jin Shim Dec 2019

An Iot-Driven Smart Cafe Solution For Human Traffic Management, Maruthi Prithivirajan, Kyong Jin Shim

Research Collection School Of Computing and Information Systems

In this study, we present an IoT-driven solution for human traffic management in a corporate cafe. Using IoT sensors, our system monitors human traffic in a physical cafe located at a large international corporation located in Singapore. The backend system analyzes the streaming data from the sensors and provides insights useful to the cafe visitors as well as the cafe manager.


Finding Needles In A Haystack: Leveraging Co-Change Dependencies To Recommend Refactorings, Marcos César De Oliveira, Davi Freitas, Rodrigo Bonifacio, Gustavo Pinto, David Lo Dec 2019

Finding Needles In A Haystack: Leveraging Co-Change Dependencies To Recommend Refactorings, Marcos César De Oliveira, Davi Freitas, Rodrigo Bonifacio, Gustavo Pinto, David Lo

Research Collection School Of Computing and Information Systems

A fine-grained co-change dependency arises when two fine-grained source-code entities, e.g., a method,change frequently together. This kind of dependency is relevant when considering remodularization efforts (e.g., to keep methods that change together in the same class). However, existing approaches forrecommending refactorings that change software decomposition (such as a move method) do not explorethe use of fine-grained co-change dependencies. In this paper we present a novel approach for recommending move method and move field refactorings, which removes co-change dependencies and evolutionary smells, a particular type of dependency that arise when fine-grained entities that belong to different classes frequently change together. First …


Influence, Information And Team Outcomes In Large Scale Software Development, Subhajit Datta Dec 2019

Influence, Information And Team Outcomes In Large Scale Software Development, Subhajit Datta

Research Collection School Of Computing and Information Systems

It is widely perceived that the egalitarian ecosystems of large scale open source software development foster effective team outcomes. In this study, we question this conventional wisdom by examining whether and how the centralization of information and influence in a software development team relate to the quality of the team's work products. Analyzing data from more than a hundred real world projects that include development activities over close to a decade, involving 2000+ developers, who collectively resolve more than two hundred thousand defects through discussions covering more than six hundred thousand comments, we arrive at statistically significant evidence indicating that …


Treecaps: Tree-Structured Capsule Networks For Program Source Code Processing, Vinoj Jayasundara, Duy Quoc Nghi Bui, Lingxiao Jiang, David Lo Dec 2019

Treecaps: Tree-Structured Capsule Networks For Program Source Code Processing, Vinoj Jayasundara, Duy Quoc Nghi Bui, Lingxiao Jiang, David Lo

Research Collection School Of Computing and Information Systems

Program comprehension is a fundamental task in software development and maintenance processes. Software developers often need to understand a large amount of existing code before they can develop new features or fix bugs in existing programs. Being able to process programming language code automatically and provide summaries of code functionality accurately can significantly help developers to reduce time spent in code navigation and understanding, and thus increase productivity. Different from natural language articles, source code in programming languages often follows rigid syntactical structures and there can exist dependencies among code elements that are located far away from each other through …


Guest Editorial: Special Issue On Software Engineering For Mobile Applications, Sebastiano Panichella, Fabio Palomba, David Lo, Meiyappan Nagappan Dec 2019

Guest Editorial: Special Issue On Software Engineering For Mobile Applications, Sebastiano Panichella, Fabio Palomba, David Lo, Meiyappan Nagappan

Research Collection School Of Computing and Information Systems

As Andreessen stated “software is eating the world” (Andreessen 2011). Most of todays industries, from engineering, manufacturing, logistics to health, are run on enterprise software applications and can efficiently automate the analysis and manipulation of several, heterogeneous types of data. One of the most prominent examples of such software diffusion is represented by the widespread adoption of mobile applications. Indeed, during the recent years, the Global App Economy experienced unprecedented growth, driven by the increasing usage of apps and by the greater adoption of mobile devices (e.g., smartphone) around the globe. This mobile application market, which is expected in few …


Salience-Aware Adaptive Resonance Theory For Large-Scale Sparse Data Clustering, Lei Meng, Ah-Hwee Tan, Chunyan Miao Dec 2019

Salience-Aware Adaptive Resonance Theory For Large-Scale Sparse Data Clustering, Lei Meng, Ah-Hwee Tan, Chunyan Miao

Research Collection School Of Computing and Information Systems

Sparse data is known to pose challenges to cluster analysis, as the similarity between data tends to be ill-posed in the high-dimensional Hilbert space. Solutions in the literature typically extend either k-means or spectral clustering with additional steps on representation learning and/or feature weighting. However, adding these usually introduces new parameters and increases computational cost, thus inevitably lowering the robustness of these algorithms when handling massive ill-represented data. To alleviate these issues, this paper presents a class of self-organizing neural networks, called the salience-aware adaptive resonance theory (SA-ART) model. SA-ART extends Fuzzy ART with measures for cluster-wise salient feature modeling. …


Twenty Years Of Open Source Software: From Skepticism To Mainstream, Gregorio Robles, Igor Steinmacher, Paul Adams, Christoph Treude Dec 2019

Twenty Years Of Open Source Software: From Skepticism To Mainstream, Gregorio Robles, Igor Steinmacher, Paul Adams, Christoph Treude

Research Collection School Of Computing and Information Systems

Open source software (OSS) has conquered the software world. You can see it nearly everywhere, from Internet infrastructure to mobile phones to the desktop. In addition to that, although many OSS practices were viewed with skepticism 20 years ago, several have become mainstream in software engineering today: from development tools such as Git to practices such as modern code reviews.


Pieces Of Contextual Information Suitable For Predicting Co-Changes? An Empirical Study, Igor Scaliante Wiese, Rodrigo Takashi Kuroda, Igor Steinmacher, Gustavo A. Oliva, Reginaldo Ré, Christoph Treude, Marco Aurélio Gerosa Dec 2019

Pieces Of Contextual Information Suitable For Predicting Co-Changes? An Empirical Study, Igor Scaliante Wiese, Rodrigo Takashi Kuroda, Igor Steinmacher, Gustavo A. Oliva, Reginaldo Ré, Christoph Treude, Marco Aurélio Gerosa

Research Collection School Of Computing and Information Systems

Models that predict software artifact co-changes have been proposed to assist developers in altering a software system and they often rely on coupling. However, developers have not yet widely adopted these approaches, presumably because of the high number of false recommendations. In this work, we conjecture that the contextual information related to software changes, which is collected from issues (e.g., issue type and reporter), developers’ communication (e.g., number of issue comments, issue discussants and words in the discussion), and commit metadata (e.g., number of lines added, removed, and modified), improves the accuracy of co-change prediction. We built customized prediction models …


Automating Change-Level Self-Admitted Technical Debt Determination, Meng Yan, Xin Xia, Emad Shihab, David Lo, Jianwei Yin, Xiaohu Yang Dec 2019

Automating Change-Level Self-Admitted Technical Debt Determination, Meng Yan, Xin Xia, Emad Shihab, David Lo, Jianwei Yin, Xiaohu Yang

Research Collection School Of Computing and Information Systems

Self-Admitted Technical Debt (SATD) refers to technical debt that is introduced intentionally. Previous studies that identify SATD at the file-level in isolation cannot describe the TD context related to multiple files. Therefore, it is more beneficial to identify the SATD once a change is being made. We refer to this type of TD identification as “Change-level SATD Determination”, and identifying SATD at the change-level can help to manage and control TD by understanding the TD context through tracing the introducing changes. In this paper, we propose a change-level SATD Determination mode by extracting 25 features from software changes that are …


Scompile: Critical Path Identification And Analysis For Smart Contracts, Jialiang Chang, Bo Gao, Hao Xiao, Jun Sun, Yan Cai, Zijiang Yang Nov 2019

Scompile: Critical Path Identification And Analysis For Smart Contracts, Jialiang Chang, Bo Gao, Hao Xiao, Jun Sun, Yan Cai, Zijiang Yang

Research Collection School Of Computing and Information Systems

Ethereum smart contracts are an innovation built on top of the blockchain technology, which provides a platform for automatically executing contracts in an anonymous, distributed, and trusted way. The problem is magnified by the fact that smart contracts, unlike ordinary programs, cannot be patched easily once deployed. It is important for smart contracts to be checked against potential vulnerabilities. In this work, we propose an alternative approach to automatically identify critical program paths (with multiple function calls including inter-contract function calls) in a smart contract, rank the paths according to their criticalness, discard them if they are infeasible or otherwise …


Recommendation-Based Team Formation For On-Demand Taxi-Calling Platforms, Lingyu Zhang, Tianshu Song, Yongxin Tong, Zimu Zhou, Dan Li, Wei Ai, Lulu Zhang, Guobin Wu, Yan Liu, Jieping Ye Nov 2019

Recommendation-Based Team Formation For On-Demand Taxi-Calling Platforms, Lingyu Zhang, Tianshu Song, Yongxin Tong, Zimu Zhou, Dan Li, Wei Ai, Lulu Zhang, Guobin Wu, Yan Liu, Jieping Ye

Research Collection School Of Computing and Information Systems

On-demand taxi-calling platforms often ignore the social engagement of individual drivers. The lack of social incentives impairs the work enthusiasms of drivers and will affect the quality of service. In this paper, we propose to form teams among drivers to promote participation. A team consists of a leader and multiple members, which acts as the basis for various group-based incentives such as competition. We define the Recommendation-based Team Formation (RTF) problem to form as many teams as possible while accounting for the choices of drivers. The RTF problem is challenging. It needs both accurate recommendation and coordination among recommendations, since …


Stressmon: Scalable Detection Of Perceived Stress And Depression Using Passive Sensing Of Changes In Work Routines And Group Interactions, Nur Camellia Binte Zakaria, Rajesh Balan, Youngki Lee Nov 2019

Stressmon: Scalable Detection Of Perceived Stress And Depression Using Passive Sensing Of Changes In Work Routines And Group Interactions, Nur Camellia Binte Zakaria, Rajesh Balan, Youngki Lee

Research Collection School Of Computing and Information Systems

Stress and depression are a common affliction in all walks of life. When left unmanaged, stress can inhibit productivity or cause depression. Depression can occur independently of stress. There has been a sharp rise in mobile health initiatives to monitor stress and depression. However, these initiatives usually require users to install dedicated apps or multiple sensors, making such solutions hard to scale. Moreover, they emphasise sensing individual factors and overlook social interactions, which plays a significant role in influencing stress and depression while being a part of a social system. We present StressMon, a stress and depression detection system that …


Safe Inputs Approximation For Black-Box Systems, Bai Xue, Yang Liu, Lei Ma, Xiyue Zhang, Meng Sun, Xiaofei Xie Nov 2019

Safe Inputs Approximation For Black-Box Systems, Bai Xue, Yang Liu, Lei Ma, Xiyue Zhang, Meng Sun, Xiaofei Xie

Research Collection School Of Computing and Information Systems

Given a family of independent and identically distributed samples extracted from the input region and their corresponding outputs, in this paper we propose a method to under-approximate the set of safe inputs that lead the blackbox system to respect a given safety specification. Our method falls within the framework of probably approximately correct (PAC) learning. The computed under-approximation comes with statistical soundness provided by the underlying PAC learning process. Such a set, which we call a PAC under-approximation, is obtained by computing a PAC model of the black-box system with respect to the specified safety specification. In our method, the …


Wuji: Automatic Online Combat Game Testing Using Evolutionary Deep Reinforcement Learning, Yan Zheng, Xiaofei Xie, Ting Su, Lei Ma, Jianye Hao, Zhaopeng Meng, Yang Liu, Ruimin Shen, Yingfeng Chen, Changjie Fan Nov 2019

Wuji: Automatic Online Combat Game Testing Using Evolutionary Deep Reinforcement Learning, Yan Zheng, Xiaofei Xie, Ting Su, Lei Ma, Jianye Hao, Zhaopeng Meng, Yang Liu, Ruimin Shen, Yingfeng Chen, Changjie Fan

Research Collection School Of Computing and Information Systems

—Game testing has been long recognized as a notoriously challenging task, which mainly relies on manual playing and scripting based testing in game industry. Even until recently, automated game testing still remains to be largely untouched niche. A key challenge is that game testing often requires to play the game as a sequential decision process. A bug may only be triggered until completing certain difficult intermediate tasks, which requires a certain level of intelligence. The recent success of deep reinforcement learning (DRL) sheds light on advancing automated game testing, without human competitive intelligent support. However, the existing DRLs mostly focus …


Map-Coverage: A Novel Coverage Criterion For Testing Thread-Safe Classes, Zan Wang, Yingquan Zhao, Shuang Liu, Jun Sun, Xiang Chen, Huarui Lin Nov 2019

Map-Coverage: A Novel Coverage Criterion For Testing Thread-Safe Classes, Zan Wang, Yingquan Zhao, Shuang Liu, Jun Sun, Xiang Chen, Huarui Lin

Research Collection School Of Computing and Information Systems

Concurrent programs must be thoroughly tested, as concurrency bugs are notoriously hard to detect. Code coverage criteria can be used to quantify the richness of a test suite (e.g., whether a program has been tested sufficiently) or provide practical guidelines on test case generation (e.g., as objective functions used in program fuzzing engines). Traditional code coverage criteria are, however, designed for sequential programs and thus ineffective for concurrent programs. In this work, we introduce a novel code coverage criterion for testing thread-safe classes called MAP-coverage (short for memory-access patterns). The motivation is that concurrency bugs are often correlated with certain …


Autofocus: Interpreting Attention-Based Neural Networks By Code Perturbation, Duy Quoc Nghi Bui, Yijun Yu, Lingxiao Jiang Nov 2019

Autofocus: Interpreting Attention-Based Neural Networks By Code Perturbation, Duy Quoc Nghi Bui, Yijun Yu, Lingxiao Jiang

Research Collection School Of Computing and Information Systems

Despite being adopted in software engineering tasks, deep neural networks are treated mostly as a black box due to the difficulty in interpreting how the networks infer the outputs from the inputs. To address this problem, we propose AutoFocus, an automated approach for rating and visualizing the importance of input elements based on their effects on the outputs of the networks. The approach is built on our hypotheses that (1) attention mechanisms incorporated into neural networks can generate discriminative scores for various input elements and (2) the discriminative scores reflect the effects of input elements on the outputs of the …


Mobidroid: A Performance-Sensitive Malware Detection System On Mobile Platform, Ruitao Feng, Sen Chen, Xiaofei Xie, Lei Ma, Guozhu Meng, Yang Liu, Shang-Wei Lin Nov 2019

Mobidroid: A Performance-Sensitive Malware Detection System On Mobile Platform, Ruitao Feng, Sen Chen, Xiaofei Xie, Lei Ma, Guozhu Meng, Yang Liu, Shang-Wei Lin

Research Collection School Of Computing and Information Systems

Currently, Android malware detection is mostly performed on the server side against the increasing number of Android malware. Powerful computing resource gives more exhaustive protection for Android markets than maintaining detection by a single user in many cases. However, apart from the Android apps provided by the official market (i.e., Google Play Store), apps from unofficial markets and third-party resources are always causing a serious security threat to end-users. Meanwhile, it is a time-consuming task if the app is downloaded first and then uploaded to the server side for detection because the network transmission has a lot of overhead. In …


Automatic Generation Of Pull Request Descriptions, Zhongxin Liu, Xin Xia, Christoph Treude, David Lo, Shanping Li Nov 2019

Automatic Generation Of Pull Request Descriptions, Zhongxin Liu, Xin Xia, Christoph Treude, David Lo, Shanping Li

Research Collection School Of Computing and Information Systems

Enabled by the pull-based development model, developers can easily contribute to a project through pull requests (PRs). When creating a PR, developers can add a free-form description to describe what changes are made in this PR and/or why. Such a description is helpful for reviewers and other developers to gain a quick understanding of the PR without touching the details and may reduce the possibility of the PR being ignored or rejected. However, developers sometimes neglect to write descriptions for PRs. For example, in our collected dataset with over 333K PRs, more than 34% of the PR descriptions are empty. …


Assessing The Generalizability Of Code2vec Token Embeddings, Kang Hong Jin, Tegawende F. Bissyande, David Lo Nov 2019

Assessing The Generalizability Of Code2vec Token Embeddings, Kang Hong Jin, Tegawende F. Bissyande, David Lo

Research Collection School Of Computing and Information Systems

Many Natural Language Processing (NLP) tasks, such as sentiment analysis or syntactic parsing, have benefited from the development of word embedding models. In particular, regardless of the training algorithms, the learned embeddings have often been shown to be generalizable to different NLP tasks. In contrast, despite recent momentum on word embeddings for source code, the literature lacks evidence of their generalizability beyond the example task they have been trained for. In this experience paper, we identify 3 potential downstream tasks, namely code comments generation, code authorship identification, and code clones detection, that source code token embedding models can be applied …


Learning-Guided Network Fuzzing For Testing Cyber-Physical System Defences, Yuqi Chen, Chris Poskitt, Jun Sun, Sridhar Adepu, Fan Zhang Nov 2019

Learning-Guided Network Fuzzing For Testing Cyber-Physical System Defences, Yuqi Chen, Chris Poskitt, Jun Sun, Sridhar Adepu, Fan Zhang

Research Collection School Of Computing and Information Systems

The threat of attack faced by cyber-physical systems (CPSs), especially when they play a critical role in automating public infrastructure, has motivated research into a wide variety of attack defence mechanisms. Assessing their effectiveness is challenging, however, as realistic sets of attacks to test them against are not always available. In this paper, we propose smart fuzzing, an automated, machine learning guided technique for systematically finding 'test suites' of CPS network attacks, without requiring any knowledge of the system's control programs or physical processes. Our approach uses predictive machine learning models and metaheuristic search algorithms to guide the fuzzing of …


Smrtfridge: Iot-Based, User Interaction-Driven Food Item & Quantity Sensing, Amit Sharma, Archan Misra, Vengateswaran Subramaniam, Youngki Lee Nov 2019

Smrtfridge: Iot-Based, User Interaction-Driven Food Item & Quantity Sensing, Amit Sharma, Archan Misra, Vengateswaran Subramaniam, Youngki Lee

Research Collection School Of Computing and Information Systems

We present SmrtFridge, a consumer-grade smart fridge prototype that demonstrates two key capabilities: (a) identify the individual food items that users place in or remove from a fridge, and (b) estimate the residual quantity of food items inside a refrigerated container (opaque or transparent). Notably, both of these inferences are performed unobtrusively, without requiring any explicit user action or tagging of food objects. To achieve these capabilities, SmrtFridge uses a novel interaction-driven, multi-modal sensing pipeline, where Infrared (IR) and RGB video sensing, triggered whenever a user interacts naturally with the fridge, is used to extract a foreground visual image of …


Ad-Link: An Adaptive Approach For User Identity Linkage, Xin Mu, Wei Xie, Ka Wei, Roy Lee, Feida Zhu, Ee Peng Lim Nov 2019

Ad-Link: An Adaptive Approach For User Identity Linkage, Xin Mu, Wei Xie, Ka Wei, Roy Lee, Feida Zhu, Ee Peng Lim

Research Collection School Of Computing and Information Systems

User identity linkage (UIL) refers to linking accounts of the same user across different online social platforms. The state-of-the-art UIL methods usually perform account matching using user account’s features derived from the profile attributes, content and relationships. They are however static and do not adapt well to fast-changing online social data due to: (a) new content and activities generated by users; as well as (b) new platform functions introduced to users. In particular, the importance of features used in UIL methods may change over time and new important user features may be introduced. In this paper, we proposed AD-Link, a …


Secure Virtual Machine Placement In Cloud Data Centers, Amit Agarwal, Nguyen Binh Duong Ta Nov 2019

Secure Virtual Machine Placement In Cloud Data Centers, Amit Agarwal, Nguyen Binh Duong Ta

Research Collection School Of Computing and Information Systems

Due to an increasing number of avenues for conducting cross-VM side-channel attacks, the security of multi-tenant public IaaS cloud environments is a growing concern. These attacks allow an adversary to steal private information from a target user whose VM instance is co-located with that of the adversary. In this paper, we focus on secure VM placement algorithms which a cloud provider can use for the automatic enforcement of security against such co-location based attacks. To do so, we first establish a metric for evaluating and quantifying co-location security of multi-tenant public IaaS clouds, and then propose a novel VM placement …


Vitamon: Measuring Heart Rate Variability Using Smartphone Front Camera, Sinh Huynh, Rajesh Krishna Balan, Jeonggil Ko, Youngki Lee Nov 2019

Vitamon: Measuring Heart Rate Variability Using Smartphone Front Camera, Sinh Huynh, Rajesh Krishna Balan, Jeonggil Ko, Youngki Lee

Research Collection School Of Computing and Information Systems

We present VitaMon, a mobile sensing system that can measure the inter-heartbeat interval (IBI) from the facial video captured by a commodity smartphone's front camera. The continuous IBI measurement is used to compute heart rate variability (HRV), one of the most important markers of the autonomic nervous system (ANS) regulation. The underlying idea of VitaMon is that video recording of human face contains multiple cardiovascular pulse signals with different phase shift. Our measurement on 10 participants shows the significant time delay (36.79 ms) between the pulse signals measured at the jaw region and forehead region. VitaMon leverages deep neural network …


An Empirical Study Towards Characterizing Deep Learning Development And Deployment Across Different Frameworks And Platforms, Qianyu Guo, Sen Chen, Xiaofei Xie, Lei Ma, Qiang Hu, Hongtao Liu, Yang Liu, Jianjun Zhao, Xiaohong Li Nov 2019

An Empirical Study Towards Characterizing Deep Learning Development And Deployment Across Different Frameworks And Platforms, Qianyu Guo, Sen Chen, Xiaofei Xie, Lei Ma, Qiang Hu, Hongtao Liu, Yang Liu, Jianjun Zhao, Xiaohong Li

Research Collection School Of Computing and Information Systems

Deep Learning (DL) has recently achieved tremendous success. A variety of DL frameworks and platforms play a key role to catalyze such progress. However, the differences in architecture designs and implementations of existing frameworks and platforms bring new challenges for DL software development and deployment. Till now, there is no study on how various mainstream frameworks and platforms influence both DL software development and deployment in practice.To fill this gap, we take the first step towards understanding how the most widely-used DL frameworks and platforms support the DL software development and deployment. We conduct a systematic study on these frameworks …


A Quantitative Analysis Framework For Recurrent Neural Network, Xiaoning Du, Xiaofei Xie, Yi Li, Lei Ma, Yang Liu, Jianjun Zhao Nov 2019

A Quantitative Analysis Framework For Recurrent Neural Network, Xiaoning Du, Xiaofei Xie, Yi Li, Lei Ma, Yang Liu, Jianjun Zhao

Research Collection School Of Computing and Information Systems

Recurrent neural network (RNN) has achieved great success in processing sequential inputs for applications such as automatic speech recognition, natural language processing and machine translation. However, quality and reliability issues of RNNs make them vulnerable to adversarial attacks and hinder their deployment in real-world applications. In this paper, we propose a quantitative analysis framework — DeepStellar— to pave the way for effective quality and security analysis of software systems powered by RNNs. DeepStellar is generic to handle various RNN architectures, including LSTM and GRU, scalable to work on industrial-grade RNN models, and extensible to develop customized analyzers and tools. We …


Deepmutation++: A Mutation Testing Framework For Deep Learning Systems, Qiang Hu, Lei Ma, Xiaofei Xie, Bing Yu, Yang Liu, Jianjun Zhao Nov 2019

Deepmutation++: A Mutation Testing Framework For Deep Learning Systems, Qiang Hu, Lei Ma, Xiaofei Xie, Bing Yu, Yang Liu, Jianjun Zhao

Research Collection School Of Computing and Information Systems

Deep neural networks (DNNs) are increasingly expanding their real-world applications across domains, e.g., image processing, speech recognition and natural language processing. However, there is still limited tool support for DNN testing in terms of test data quality and model robustness. In this paper, we introduce a mutation testing-based tool for DNNs, DeepMutation++, which facilitates the DNN quality evaluation, supporting both feed-forward neural networks (FNNs) and stateful recurrent neural networks (RNNs). It not only enables static analysis of the robustness of a DNN model against the input as a whole, but also allows the identification of the vulnerable segments of a …


Saffron: Adaptive Grammar-Based Fuzzing For Worst-Case Analysis, Xuan Bach D. Le, Corina Pasareanu, Rohan Padhye, David Lo, Willem Visser, Koushik Sen Nov 2019

Saffron: Adaptive Grammar-Based Fuzzing For Worst-Case Analysis, Xuan Bach D. Le, Corina Pasareanu, Rohan Padhye, David Lo, Willem Visser, Koushik Sen

Research Collection School Of Computing and Information Systems

Fuzz testing has been gaining ground recently with substantial efforts devoted to the area. Typically, fuzzers take a set of seed inputs and leverage random mutations to continually improve the inputs with respect to a cost, e.g. program code coverage, to discover vulnerabilities or bugs. Following this methodology, fuzzers are very good at generating unstructured inputs that achieve high coverage. However fuzzers are less effective when the inputs are structured, say they conform to an input grammar. Due to the nature of random mutations, the overwhelming abundance of inputs generated by this common fuzzing practice often adversely hinders the effectiveness …


Statistical Log Differencing, Lingfeng Bao, Nimrod Busany, David Lo, Shahar Maoz Nov 2019

Statistical Log Differencing, Lingfeng Bao, Nimrod Busany, David Lo, Shahar Maoz

Research Collection School Of Computing and Information Systems

Recent works have considered the problem of log differencing: given two or more system’s execution logs, output a model of their differences. Log differencing has potential applications in software evolution, testing, and security. In this paper we present statistical log differencing, which accounts for frequencies of behaviors found in the logs. We present two algorithms, s2KDiff for differencing two logs, and snKDiff, for differencing of many logs at once, both presenting their results over a single inferred model. A unique aspect of our algorithms is their use of statistical hypothesis testing: we let the engineer control the sensitivity of the …