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

Digital Commons Network™

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

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year

Articles 2611 - 2640 of 4281

Full-Text Articles in Entire DC Network

Fusing Wifi And Video Sensing For Accurate Group Detection In Indoor Spaces, Kasthuri Jayarajah, Zaman Lantra, Archan Misra Jun 2016

Fusing Wifi And Video Sensing For Accurate Group Detection In Indoor Spaces, Kasthuri Jayarajah, Zaman Lantra, Archan Misra

Research Collection School Of Computing and Information Systems

Understanding one's group context in indoor spaces is useful for many reasons - e.g., at a shopping mall, knowing a customer's group context can help in offering context-specific incentives, or estimating taxi demand for customers exiting the mall. Group detection and monitoring using WiFi-based indoor location traces fails when users are invisible (either because they don't carry smartphones, or because their WiFi is turned OFF) or when location tracking is inaccurate. In this paper, we propose a multi-modal group detection system that fuses two independent modes: video and WiFi, for detecting groups with low latency and high accuracy. We present …


Iccdetector: Icc-Based Malware Detection On Android, Xu Ke, Yingjiu Li, Robert H. Deng Jun 2016

Iccdetector: Icc-Based Malware Detection On Android, Xu Ke, Yingjiu Li, Robert H. Deng

Research Collection School Of Computing and Information Systems

Most existing mobile malware detection methods (e.g., Kirin and DroidMat) are designed based on the resources required by malwares (e.g., permissions, application programming interface (API) calls, and system calls). These methods capture the interactions between mobile apps and Android system, but ignore the communications among components within or cross application boundaries. As a consequence, the majority of the existing methods are less effective in identifying many typical malwares, which require a few or no suspicious resources, but leverage on inter-component communication (ICC) mechanism when launching stealthy attacks. To address this challenge, we propose a new malware detection method, named ICCDetector. …


Small Scale Deployment Of Seat Occupancy Detectors, Nguyen Huy Hoang Huy, Gihan Hettiarachchi, Youngki Lee, Rajesh Krishna Balan Jun 2016

Small Scale Deployment Of Seat Occupancy Detectors, Nguyen Huy Hoang Huy, Gihan Hettiarachchi, Youngki Lee, Rajesh Krishna Balan

Research Collection School Of Computing and Information Systems

In this paper, we present the results of a small-scale field deployment of our capacitance-based seat occupancy detector. We deployed our sensors to 36 seats in our university library and measured the performance of our system over a period of 8 weeks. As part of this deployment, we had to tackle numerous real-world deployment issues such as hardware failure, variations in signal quality, and interference caused by multiple objects in near proximity. We present our overall system design, along with the modifications we made to tackle various real-world problems. Finally, we present the results of our deployment which showed that …


Deduplication On Encrypted Big Data In Cloud, Zheng Yan, Wenxiu Ding, Xixun Yu, Haiqi Zhu, Deng, Robert H. Jun 2016

Deduplication On Encrypted Big Data In Cloud, Zheng Yan, Wenxiu Ding, Xixun Yu, Haiqi Zhu, Deng, Robert H.

Research Collection School Of Computing and Information Systems

Cloud computing offers a new way of service provision by re-arranging various resources over the Internet. The most important and popular cloud service is data storage. In order to preserve the privacy of data holders, data are often stored in cloud in an encrypted form. However, encrypted data introduce new challenges for cloud data deduplication, which becomes crucial for big data storage and processing in cloud. Traditional deduplication schemes cannot work on encrypted data. Existing solutions of encrypted data deduplication suffer from security weakness. They cannot flexibly support data access control and revocation. Therefore, few of them can be readily …


Finding The Shortest Path In Stochastic Vehicle Routing: A Cardinality Minimization Approach, Zhiguang Cao, Hongliang Guo, Jie Zhang, Dusit Niyato, Ulrich Fastenrath Fastenrath Jun 2016

Finding The Shortest Path In Stochastic Vehicle Routing: A Cardinality Minimization Approach, Zhiguang Cao, Hongliang Guo, Jie Zhang, Dusit Niyato, Ulrich Fastenrath Fastenrath

Research Collection School Of Computing and Information Systems

This paper aims at solving the stochastic shortest path problem in vehicle routing, the objective of which is to determine an optimal path that maximizes the probability of arriving at the destination before a given deadline. To solve this problem, we propose a data-driven approach, which directly explores the big data generated in traffic. Specifically, we first reformulate the original shortest path problem as a cardinality minimization problem directly based on samples of travel time on each road link, which can be obtained from the GPS trajectory of vehicles. Then, we apply an l(1)-norm minimization technique and its variants to …


Deepsense: A Gpu-Based Deep Convolutional Neural Network Framework On Commodity Mobile Devices, Huynh Nguyen Loc, Rajesh Krishna Balan, Youngki Lee Jun 2016

Deepsense: A Gpu-Based Deep Convolutional Neural Network Framework On Commodity Mobile Devices, Huynh Nguyen Loc, Rajesh Krishna Balan, Youngki Lee

Research Collection School Of Computing and Information Systems

Recently, a branch of machine learning algorithms called deep learning gained huge attention to boost up accuracy of a variety of sensing applications. However, execution of deep learning algorithm such as convolutional neural network on mobile processor is non-trivial due to intensive computational requirements. In this paper, we present our early design of DeepSense - a mobile GPU-based deep convolutional neural network (CNN) framework. For its design, we first explored the differences between server-class and mobile-class GPUs, and studied effectiveness of various optimization strategies such as branch divergence elimination and memory vectorization. Our results show that DeepSense is able to …


Livelabs: Building In-Situ Mobile Sensing And Behavioural Experimentation Testbeds, Kasthuri Jayarajah, Rajesh Krishna Balan, Meera Radhakrishnan, Archan Misra, Youngki Lee Jun 2016

Livelabs: Building In-Situ Mobile Sensing And Behavioural Experimentation Testbeds, Kasthuri Jayarajah, Rajesh Krishna Balan, Meera Radhakrishnan, Archan Misra, Youngki Lee

Research Collection School Of Computing and Information Systems

In this paper, we present LiveLabs, a first-of-its-kind testbed that isdeployed across a university campus, convention centre, and resortisland and collects real-time attributes such as location, group contextetc., from hundreds of opt-in participants. These venues, data,and participants are then made available for running rich humancentricbehavioural experiments that could test new mobile sensinginfrastructure, applications, analytics, or more social-sciencetype hypotheses that influence and then observe actual user behaviour.We share case studies of how researchers from aroundthe world have and are using LiveLabs, and our experiences andlessons learned from building, maintaining, and expanding LiveLabsover the last three years.


Poster: Android Whole-System Control Flow Analysis For Accurate Application Behavior Modeling, Huu Hoang Nguyen Jun 2016

Poster: Android Whole-System Control Flow Analysis For Accurate Application Behavior Modeling, Huu Hoang Nguyen

Research Collection School Of Computing and Information Systems

Android, the modern operating system for smartphones, together with its millions of apps, has become an important part of human life. There are many challenges to analyzing them. It is important to model the mobile systems in order to analyze the behaviors of apps accurately. These apps are built on top of interactions with Android systems. We aim to automatically build abstract models of the mobile systems and thus automate the analysis of mobile applications and detect potential issues (e.g., leaking private data, causing unexpected crashes, etc.). The expected results will be the accuracy models of actual various versions of …


Condensing Class Diagrams With Minimal Manual Labeling Cost, Xinli Yang, David Lo, Xin Xia, Jianling Sun Jun 2016

Condensing Class Diagrams With Minimal Manual Labeling Cost, Xinli Yang, David Lo, Xin Xia, Jianling Sun

Research Collection School Of Computing and Information Systems

Traditionally, to better understand the design of a project, developers can reconstruct a class diagram from source code using a reverse engineering technique. However, the raw diagram is often perplexing because there are too many classes in it. Condensing the reverse engineered class diagram into a compact class diagram which contains only the important classes would enhance the understandability of the corresponding project. A number of recent works have proposed several supervised machine learning solutions that can be used for condensing reverse engineered class diagrams given a set of classes that are manually labeled as important or not. However, a …


Efficient 3d Dental Identification Via Signed Feature Histogram And Learning Keypoint Detection, Zhiyuan Zhang, Sim Heng Ong, Xin Zhong, Kelvin W. C. Foong May 2016

Efficient 3d Dental Identification Via Signed Feature Histogram And Learning Keypoint Detection, Zhiyuan Zhang, Sim Heng Ong, Xin Zhong, Kelvin W. C. Foong

Research Collection School Of Computing and Information Systems

Current methods of dental identification are mainly based on 2D dental radiographs which suffer from speed and accuracy limitations. In this paper, we present an efficient dental identification approach based on 3D dental models. We propose a novel shape descriptor, the Signed Feature Histogram (SFH), which is highly discriminative and can be easily computed to describe the local surface. Based on the SFH, a learning keypoint detection method is adopted to accurately detect the desired keypoints on both antemortem (AM) and postmortem (PM) models. For a given PM model, the optimal initial alignment to the AM model to be matched …


Overcoming Open Source Project Entry Barriers With A Portal For Newcomers, Igor Steinmacher, Tayana U. Conte, Christoph Treude, Marco Aurélio Gerosa May 2016

Overcoming Open Source Project Entry Barriers With A Portal For Newcomers, Igor Steinmacher, Tayana U. Conte, Christoph Treude, Marco Aurélio Gerosa

Research Collection School Of Computing and Information Systems

Community-based Open Source Software (OSS) projects are usually self-organized and dynamic, receiving contributions from distributed volunteers. Newcomer are important to the survival, long-term success, and continuity of these communities. However, newcomers face many barriers when making their first contribution to an OSS project, leading in many cases to dropouts. Therefore, a major challenge for OSS projects is to provide ways to support newcomers during their first contribution. In this paper, we propose and evaluate FLOSScoach, a portal created to support newcomers to OSS projects. FLOSScoach was designed based on a conceptual model of barriers created in our previous work. To …


Augmenting Api Documentation With Insights From Stack Overflow, Christoph Treude, Martin P. Robillard May 2016

Augmenting Api Documentation With Insights From Stack Overflow, Christoph Treude, Martin P. Robillard

Research Collection School Of Computing and Information Systems

Software developers need access to different kinds of information which is often dispersed among different documentation sources, such as API documentation or Stack Overflow. We present an approach to automatically augment API documentation with “insight sentences” from Stack Overflow— sentences that are related to a particular API type and that provide insight not contained in the API documentation of that type. Based on a development set of 1,574 sentences, we compare the performance of two state-of-the-art summarization techniques as well as a pattern-based approach for insight sentence extraction. We then present SISE, a novel machine learning based approach that uses …


Modeling Human-Like Non-Rationality For Social Agents, Jaroslaw Kochanowicz, Ah-Hwee Tan, Daniel Thalmann May 2016

Modeling Human-Like Non-Rationality For Social Agents, Jaroslaw Kochanowicz, Ah-Hwee Tan, Daniel Thalmann

Research Collection School Of Computing and Information Systems

Humans are not rational beings. Deviations from rationality in human thinking are currently well documented [25] as non-reducible to rational pursuit of egoistic benefit or its occasional distortion with temporary emotional excitation, as it is often assumed. This occurs not only outside conceptual reasoning or rational goal realization but also subconsciously and often in certainty that they did not and could not take place ‘in my case’. Non-rationality can no longer be perceived as a rare affective abnormality in otherwise rational thinking, but as a systemic, permanent quality, ’a design feature’ of human cognition. While social psychology has systematically addressed …


Anonymous Identity-Based Broadcast Encryption With Chosen-Ciphertext Security, Kai He, Jian Weng, Jia-Nan Liu, Joseph K. Liu, Wei Liu, Deng, Robert H. May 2016

Anonymous Identity-Based Broadcast Encryption With Chosen-Ciphertext Security, Kai He, Jian Weng, Jia-Nan Liu, Joseph K. Liu, Wei Liu, Deng, Robert H.

Research Collection School Of Computing and Information Systems

In this paper, we propose the first identity-based broadcast encryption scheme, which can simultaneously achieves confidentiality and full anonymity against adaptive chosen-ciphertext attacks under a standard assumption. In addition, two further desirable features are also provided: one is fully-collusion resistant which means that even if all users outside of receivers S collude they cannot obtain any information about the plaintext. The other one is stateless which means that the users in the system do not need to update their private keys when the other users join or leave our system. In particular, our scheme is highly efficient, where the public …


Efficient Verifiable Computation Of Linear And Quadratic Functions Over Encrypted Data, Ngoc Hieu Tran, Hwee Hwa Pang, Robert H. Deng May 2016

Efficient Verifiable Computation Of Linear And Quadratic Functions Over Encrypted Data, Ngoc Hieu Tran, Hwee Hwa Pang, Robert H. Deng

Research Collection School Of Computing and Information Systems

In data outsourcing, a client stores a large amount of data on an untrusted server; subsequently, the client can request the server to compute a function on any subset of the data. This setting naturally leads to two security requirements: confidentiality of input data, and authenticity of computations. Existing approaches that satisfy both requirements simultaneously are built on fully homomorphic encryption, which involves expensive computation on the server and client and hence is impractical. In this paper, we propose two verifiable homomorphic encryption schemes that do not rely on fully homomorphic encryption. The first is a simple and efficient scheme …


Mining Social Ties Beyond Homophily, Hongwei Liang, Ke Wang, Feida Zhu May 2016

Mining Social Ties Beyond Homophily, Hongwei Liang, Ke Wang, Feida Zhu

Research Collection School Of Computing and Information Systems

Summarizing patterns of connections or social tiesin a social network, in terms of attributes information on nodesand edges, holds a key to the understanding of how the actorsinteract and form relationships. We formalize this problem asmining top-k group relationships (GRs), which captures strongsocial ties between groups of actors. While existing works focuson patterns that follow from the well known homophily principle,we are interested in social ties that do not follow from homophily,thus, provide new insights. Finding top-k GRs faces new challenges:it requires a novel ranking metric because traditionalmetrics favor patterns that are expected from the homophilyprinciple; it requires an innovative …


A Key-Insulated Cp-Abe With Key Exposure Accountability For Secure Data Sharing In The Cloud, Hanshu Hong, Zhixin Sun, Ximeng Liu May 2016

A Key-Insulated Cp-Abe With Key Exposure Accountability For Secure Data Sharing In The Cloud, Hanshu Hong, Zhixin Sun, Ximeng Liu

Research Collection School Of Computing and Information Systems

ABE has become an effective tool for data protection in cloud computing. However, since users possessing the same attributes share the same private keys, there exist some malicious users exposing their private keys deliberately for illegal data sharing without being detected, which will threaten the security of the cloud system. Such issues remain in many current ABE schemes since the private keys are rarely associated with any user specific identifiers. In order to achieve user accountability as well as provide key exposure protection, in this paper, we propose a key-insulated ciphertext policy attribute based encryption with key exposure accountability (KI-CPABE-KEA). …


Attacks And Defence On Android Free Floating Windows, Lingyun Ying, Yao Cheng, Yemian Lu, Yacong Gu, Purui Su, Dengguo Feng May 2016

Attacks And Defence On Android Free Floating Windows, Lingyun Ying, Yao Cheng, Yemian Lu, Yacong Gu, Purui Su, Dengguo Feng

Research Collection School Of Computing and Information Systems

Nowadays, the popular Android is so closely involved in people's daily lives that people rely on Android to perform critical operations and trust Android with sensitive information. It is of great importance to guarantee the usability and security of Android which, however, is such a huge system that a potential threat may arise from any part of it. In this paper, we focus on the Free Floating window (FF window) which is a category of windows that can appear freely above any other applications. It can share the screen space with other FF windows, dialogs, and activities. An FF window …


Approximating The Performance Of A "Last Mile" Transportation System, Hai Wang, Amedeo Odoni May 2016

Approximating The Performance Of A "Last Mile" Transportation System, Hai Wang, Amedeo Odoni

Research Collection School Of Computing and Information Systems

The Last Mile Problem (LMP) refers to the provision of travel service from the nearest public transportation node to a home or office. We study the supply side of this problem in a stochastic setting, with batch demands resulting from the arrival of groups of passengers who request last-mile service at urban rail stations or bus stops. Closedform approximations are derived for the performance of Last Mile Transportations Systems as a function of the fundamental design parameters of such systems. An initial set of results is obtained for the case in which a fleet of vehicles of unit capacity provides …


Approximate Inference Using Dc Programming For Collective Graphical Models, Duc Thien Nguyen, Akshat Kumar, Hoong Chuin Lau, Daniel Sheldon May 2016

Approximate Inference Using Dc Programming For Collective Graphical Models, Duc Thien Nguyen, Akshat Kumar, Hoong Chuin Lau, Daniel Sheldon

Research Collection School Of Computing and Information Systems

Collective graphical models (CGMs) provide a framework for reasoning about a population of independent and identically distributed individuals when only noisy and aggregate observations are given. Previous approaches for inference in CGMs work on a junction-tree representation, thereby highly limiting their scalability. To remedy this, we show how the Bethe entropy approximation naturally arises for the inference problem in CGMs. We reformulate the resulting optimization problem as a difference-of-convex functions program that can capture different types of CGM noise models. Using the concave-convex procedure, we then develop a scalable message-passing algorithm. Empirically, our approach is highly scalable and accurate for …


Domain-Specific Cross-Language Relevant Question Retrieval, Bowen Xu, Zhenchang Xing, Xin Xia, David Lo, Qingye Wang, Shanping Li May 2016

Domain-Specific Cross-Language Relevant Question Retrieval, Bowen Xu, Zhenchang Xing, Xin Xia, David Lo, Qingye Wang, Shanping Li

Research Collection School Of Computing and Information Systems

In software development process, developers often seek solutions to the technical problems they encounter by searching relevant questions on Q&A sites. When developers fail to find solutions on Q&A sites in their native language (e.g., Chinese), they could translate their query and search on the Q&A sites in another language (e.g., English). However, developers who are non-native English speakers often are not comfortable to ask or search questions in English, as they do not know the proper translation of the Chinese technical words into the English technical words. Furthermore, the process of manually formulating cross-language queries and determining the weight …


How Android App Developers Manage Power Consumption? An Empirical Study By Mining Power Management Commits, Lingfeng Bao, David Lo, Xin Xia, Xinyu Wang, Cong Tian May 2016

How Android App Developers Manage Power Consumption? An Empirical Study By Mining Power Management Commits, Lingfeng Bao, David Lo, Xin Xia, Xinyu Wang, Cong Tian

Research Collection School Of Computing and Information Systems

As Android platform becomes more and more popular, a large amount of Android applications have been developed. When developers design and implement Android applications, power consumption management is an important factor to consider since it affects the usability of the applications. Thus, it is important to help developers adopt proper strategies to manage power consumption. Interestingly, today, there is a large number of Android application repositories made publicly available in sites such as GitHub. These repositories can be mined to help crystalize common power management activities that developers do. These in turn can be used to help other developers to …


Deeper Look Into Bug Fixes: Patterns, Replacements, Deletions, And Additions, Mauricio Soto, Ferdian Thung, Chu-Pan Wong, Claire Le Goues, David Lo May 2016

Deeper Look Into Bug Fixes: Patterns, Replacements, Deletions, And Additions, Mauricio Soto, Ferdian Thung, Chu-Pan Wong, Claire Le Goues, David Lo

Research Collection School Of Computing and Information Systems

Many implementations of research techniques that automatically repair software bugs target programs written in C. Work that targets Java often begins from or compares to direct translations of such techniques to a Java context. However, Java and C are very different languages, and Java should be studied to inform the construction of repair approaches to target it. We conduct a large-scale study of bugfixing commits in Java projects, focusing on assumptions underlying common search-based repair approaches. We make observations that can be leveraged to guide high quality automatic software repair to target Java specifically, including common and uncommon statement modifications …


Robust Influence Maximization, Meghna Lowalekar, Pradeep Varakantham, Akshat Kumar May 2016

Robust Influence Maximization, Meghna Lowalekar, Pradeep Varakantham, Akshat Kumar

Research Collection School Of Computing and Information Systems

Influence Maximization is the problem of finding a fixed size set of nodes, which will maximize the expected number of influenced nodes in a social network. The number of influenced nodes is dependent on the influence strength of edges that can be very noisy. The noise in the influence strengths can be modeled using a random noise or adversarial noise model. It has been shown that all random processes that independently affect edges of the graph can be absorbed into the activation probabilities themselves and hence random noise can be captured within the independent cascade model. On the other hand, …


Efspredictor: Predicting Configuration Bugs With Ensemble Feature Selection, Bowen Xu, David Lo, Xin Xia, Ashish Sureka, Shanping Li May 2016

Efspredictor: Predicting Configuration Bugs With Ensemble Feature Selection, Bowen Xu, David Lo, Xin Xia, Ashish Sureka, Shanping Li

Research Collection School Of Computing and Information Systems

The configuration of a system determines the system behavior and wrong configuration settings can adversely impact system's availability, performance, and correctness. We refer to these wrong configuration settings as configuration bugs. The importance of configuration bugs has prompted many researchers to study it, and past studies can be grouped into three categories: detection, localization, and fixing of configuration bugs. In the work, we focus on the detection of configuration bugs, in particular, we follow the line-of-work that tries to predict if a bug report is caused by a wrong configuration setting. Automatically prediction of whether a bug is a configuration …


Online Passive-Aggressive Active Learning, Jing Lu, Peilin Zhao, Steven C. H. Hoi May 2016

Online Passive-Aggressive Active Learning, Jing Lu, Peilin Zhao, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

We investigate online active learning techniques for online classification tasks. Unlike traditional supervised learning approaches, either batch or online learning, which often require to request class labels of each incoming instance, online active learning queries only a subset of informative incoming instances to update the classification model, aiming to maximize classification performance with minimal human labelling effort during the entire online learning task. In this paper, we present a new family of online active learning algorithms called Passive-Aggressive Active (PAA) learning algorithms by adapting the Passive-Aggressive algorithms in online active learning settings. Unlike conventional Perceptron-based approaches that employ only the …


Stabilized Annotations For Mobile Remote Assistance, Omid Fakourfar, Kevin Ta, Richard Tang, Scott Bateman, Anthony Tang May 2016

Stabilized Annotations For Mobile Remote Assistance, Omid Fakourfar, Kevin Ta, Richard Tang, Scott Bateman, Anthony Tang

Research Collection School Of Computing and Information Systems

Recent mobile technology has provided new opportunities for creating remote assistance systems. However, mobile support systems present a particular challenge: both the camera and display are held by the user, leading to shaky video. When pointing or drawing annotations, this means that the desired target often moves, causing the gesture to lose its intended meaning. To address this problem, we investigate annotation stabilization techniques, which allow annotations to stick to their intended location. We studied two annotation systems, using three different forms of annotations, with both tablets and head-mounted displays. Our analysis suggests that stabilized annotations and head-mounted displays are …


Learning To Query: Focused Web Page Harvesting For Entity Aspects, Yuan Fang, Vincent W. Zheng, Kevin Chen-Chuan Chang May 2016

Learning To Query: Focused Web Page Harvesting For Entity Aspects, Yuan Fang, Vincent W. Zheng, Kevin Chen-Chuan Chang

Research Collection School Of Computing and Information Systems

As the Web hosts rich information about real-world entities, our information quests become increasingly entity centric. In this paper, we study the problem of focused harvesting of Web pages for entity aspects, to support downstream applications such as business analytics and building a vertical portal. Given that search engines are the de facto gateways to assess information on the Web, we recognize the essence of our problem as Learning to Query (L2Q) - to intelligently select queries so that we can harvest pages, via a search engine, focused on an entity aspect of interest. Thus, it is crucial to quantify …


Learning To Rank For Bug Report Assignee Recommendation, Yuan Tian, Withthige Dinusha Ruchira Wijedasa, David Lo, Claire Le Goues May 2016

Learning To Rank For Bug Report Assignee Recommendation, Yuan Tian, Withthige Dinusha Ruchira Wijedasa, David Lo, Claire Le Goues

Research Collection School Of Computing and Information Systems

Projects receive a large number of bug reports, and resolving these reports take considerable time and human resources. To aid developers in the resolution of bug reports, various automated techniques have been proposed to identify and recommend developers to address newly reported bugs. Two families of bug assignee recommendation techniques include those that recommend developers who have fixed similar bugs before (a.k.a. activity-based techniques) and those recommend suitable developers based on the location of the bug (a.k.a. location-based techniques). Previously, each of these techniques has been investigated separately. In this work, we propose a unified model that combines information from …


A Graph-Based Semantics Workbench For Concurrent Asynchronous Programs, Claudio Corrodi, Alexander Heußner, Christopher M. Poskitt Apr 2016

A Graph-Based Semantics Workbench For Concurrent Asynchronous Programs, Claudio Corrodi, Alexander Heußner, Christopher M. Poskitt

Research Collection School Of Computing and Information Systems

A number of novel programming languages and libraries have been proposed that offer simpler-to-use models of concurrency than threads. It is challenging, however, to devise execution models that successfully realise their abstractions without forfeiting performance or introducing unintended behaviours. This is exemplified by Scoop—a concurrent object-oriented message-passing language—which has seen multiple semantics proposed and implemented over its evolution. We propose a “semantics workbench” with fully and semi-automatic tools for Scoop, that can be used to analyse and compare programs with respect to different execution models. We demonstrate its use in checking the consistency of semantics by applying it to a …