Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Databases and Information Systems (239)
- Programming Languages and Compilers (198)
- Artificial Intelligence and Robotics (142)
- Engineering (142)
- Computer Engineering (126)
-
- Information Security (109)
- OS and Networks (80)
- Graphics and Human Computer Interfaces (78)
- Social and Behavioral Sciences (76)
- Numerical Analysis and Scientific Computing (59)
- Theory and Algorithms (46)
- Business (43)
- Computer and Systems Architecture (39)
- Digital Communications and Networking (39)
- Medicine and Health Sciences (33)
- Communication (30)
- Education (28)
- Systems Architecture (21)
- Health Information Technology (20)
- Sociology (18)
- Finance and Financial Management (15)
- Gerontology (15)
- Public Affairs, Public Policy and Public Administration (15)
- Higher Education (13)
- Social Media (13)
- Transportation (12)
- Technology and Innovation (11)
- Keyword
-
- Deep learning (54)
- Software engineering (49)
- Empirical study (43)
- Machine learning (35)
- Software (30)
-
- Android (29)
- Model Check (29)
- Collaboration (26)
- Deep Learning (24)
- GitHub (22)
- Stack Overflow (22)
- Fuzzing (21)
- Security (21)
- Testing (20)
- Data mining (19)
- Large language models (18)
- Programming (18)
- Software Engineering (18)
- Code search (17)
- Computer bugs (17)
- Codes (16)
- Empirical Study (16)
- Information retrieval (16)
- Large Language Models (16)
- Large language model (16)
- Software testing (15)
- Large Language Model (14)
- Linear Temporal Logic (14)
- Software maintenance (14)
- Vulnerability detection (14)
- Publication Year
- Publication
- Publication Type
Articles 1951 - 1980 of 2211
Full-Text Articles in Software Engineering
Sandcanvas: New Possibilities In Sand Animation, Rubaiat Habib Kazi, Kien-Chuan Chua, Shengdong Zhao, Richard Christopher Davis, Kok-Lim Low
Sandcanvas: New Possibilities In Sand Animation, Rubaiat Habib Kazi, Kien-Chuan Chua, Shengdong Zhao, Richard Christopher Davis, Kok-Lim Low
Research Collection School Of Computing and Information Systems
Sand animation is a performance art technique in which an artist tells stories by creating animated images with sand. This video demonstrates the creative possibilities of SandCanvas, a new multi-touch digital artistic medium inspired by sand animation that simplifies the creation of sand animations. SandCanvas’s color and texture features enable faster, more dramatic transitions, while its mixed media and gesture recording features make it possible to create entirely new experiences. Session recording and frame capture complement these capabilities by simplifying postproduction of sand animation performances.
Interactivity-Constrained Server Provisioning In Large-Scale Distributed Virtual Environments, Nguyen Binh Duong Ta, Thang Nguyen, Suiping Zhou, Xueyan Tang, Wentong Cai, Rassul Ayani
Interactivity-Constrained Server Provisioning In Large-Scale Distributed Virtual Environments, Nguyen Binh Duong Ta, Thang Nguyen, Suiping Zhou, Xueyan Tang, Wentong Cai, Rassul Ayani
Research Collection School Of Computing and Information Systems
Maintaining interactivity is one of the key challenges in distributed virtual environments (DVE), e.g., online games, distributed simulations, etc., due to the large, heterogeneous Internet latencies; and the fact that clients in a DVE are usually geographically separated. In this paper, we consider a new problem, termed the interactivity-constrained server provisioning problem, whose goal is to minimize the number of distributed servers needed to achieve a pre-determined level of interactivity. We identify and formulate two variants of this new problem and show that they are both NP-hard via reductions to the set covering problem. We then propose several computationally efficient …
Abstracting Events For Data Mining, David Lo, Ganesan Ramalingam, Venkatesh-Prasad Ranganath, Kapil Vaswani
Abstracting Events For Data Mining, David Lo, Ganesan Ramalingam, Venkatesh-Prasad Ranganath, Kapil Vaswani
Research Collection School Of Computing and Information Systems
An event is described herein as being representable by a quantified abstraction of the event. The event includes at least one predicate, and the at least one predicate has at least one constant symbol corresponding thereto. An instance of the constant symbol corresponding to the event is identified, and the instance of the constant symbol is replaced by a free variable to obtain an abstracted predicate. Thus, a quantified abstraction of the event is composed as a pair: the abstracted predicate and a mapping between the free variable and an instance of the constant symbol that corresponds to the predicate. …
A High-Throughput Routing Metric For Reliable Multicast In Multi-Rate Wireless Mesh Networks, Xin Zhao, Jun Guo, Chun Tung Chou, Archan Misra, Sanjay Jha
A High-Throughput Routing Metric For Reliable Multicast In Multi-Rate Wireless Mesh Networks, Xin Zhao, Jun Guo, Chun Tung Chou, Archan Misra, Sanjay Jha
Research Collection School Of Computing and Information Systems
We propose a routing metric for enabling highthroughput reliable multicast in multi-rate wireless mesh networks. This new multicast routing metric, called expected multicast transmission time (EMTT), captures the combined effects of 1) MAC-layer retransmission-based reliability, 2) transmission rate diversity, 3) wireless broadcast advantage, and 4) link quality awareness. The EMTT of one-hop transmission of a multicast packet minimizes the amount of expected transmission time (including that required for retransmissions). This is achieved by allowing the sender to adapt its bit-rate for each ongoing transmission/retransmission, optimized exclusively for its nexthop receivers that have not yet received the multicast packet. We model …
Peercast: Improving Link Layer Multicast Through Cooperative Relaying, Jie Xiong, Romit Roy Choudhury
Peercast: Improving Link Layer Multicast Through Cooperative Relaying, Jie Xiong, Romit Roy Choudhury
Research Collection School Of Computing and Information Systems
Wireless multicast applications, such as MobiTV, web telecast, and multimedia classrooms, are gaining rapid popularity. The broadcast nature of the wireless channel is amenable to such multicasts because a single packet transmission can be received by all clients. Unfortunately, the rate of this transmission is bottlenecked by data rate of the weakest client, degrading system performance. Attempts to increase the data rate results in lower reliability and higher unfairness. This paper presents PeerCast, a wireless multicast protocol that engages clients in cooperative relaying. The main idea is simple. Instead of multicasting at the bottleneck rate, the access point transmits at …
A Virtualization-Based Approach For Zone Migration In Distributed Virtual Environments, Nguyen Binh Duong Ta, Thang Nguyen, Tran Nguyen, Do Nguyen, Xueyan Tang, Wentong Cai, Suiping Zhou
A Virtualization-Based Approach For Zone Migration In Distributed Virtual Environments, Nguyen Binh Duong Ta, Thang Nguyen, Tran Nguyen, Do Nguyen, Xueyan Tang, Wentong Cai, Suiping Zhou
Research Collection School Of Computing and Information Systems
This paper deals with the zone migration problem in large-scale distributed virtual environments (DVEs), e.g., massively multi-player online games, distributed military simulations, etc. To support real-time interactions among thousands of concurrent, geographically separated clients, a distributed server architecture is generally needed. In such architecture, the large virtual world can be partitioned into multiple smaller zones, enabling load distributions or zone-to-server mappings to improve interactivity. For example, a zone might be mapped (assigned) to a server location near most of its clients to reduce network latency. In this paper, we consider the problem of live zone migration over wide area networks …
An Energy Efficient Quality Adaptive Multi-Modal Sensor Framework For Context Recognition, Nirmalya Roy, Archan Misra, Christine Julien, Sajal K. Das, Jit Biswas
An Energy Efficient Quality Adaptive Multi-Modal Sensor Framework For Context Recognition, Nirmalya Roy, Archan Misra, Christine Julien, Sajal K. Das, Jit Biswas
Research Collection School Of Computing and Information Systems
Proliferation of mobile applications in unpredictable and changing environments requires applications to sense and act on changing operational contexts. In such environments, understanding the context of an entity is essential for adaptability of the application behavior to changing situations. In our view, context is a high-level representation of a user or entity’s state and can capture activities, relationships, capabilities, etc. Inherently, however, these high-level context measures are difficult to sense directly and instead must be inferred through the combination of many data sources. In pervasive computing environments where this context is of significant importance, a multitude of sensors is already …
Adnext: A Visit-Pattern-Aware Mobile Advertising System For Urban Commercial Complexes, Byoungjip Kim, Jin-Young Ha, Sangjeong Lee, Seungwoo Kang, Youngki Lee, Yunseok Rhee, Lama Nachman, Junehwa Song
Adnext: A Visit-Pattern-Aware Mobile Advertising System For Urban Commercial Complexes, Byoungjip Kim, Jin-Young Ha, Sangjeong Lee, Seungwoo Kang, Youngki Lee, Yunseok Rhee, Lama Nachman, Junehwa Song
Research Collection School Of Computing and Information Systems
As smartphones have become prevalent, mobile advertising is getting significant attention as being not only a killer application in future mobile commerce, but also as an important business model of emerging mobile applications to monetize them. In this paper, we present AdNext, a visit-pattern-aware mobile advertising system for urban commercial complexes. AdNext can provide highly relevant ads to users by predicting places that the users will next visit. AdNext predicts the next visit place by learning the sequential visit patterns of commercial complex users in a collective manner. As one of the key enabling techniques for AdNext, we develop a …
Evolution Of Developer Collaboration On The Jazz Platform: A Study Of A Large Scale Agile Project, Subhajit Datta, Renuka Sindhgatta, Bikram Sengupta
Evolution Of Developer Collaboration On The Jazz Platform: A Study Of A Large Scale Agile Project, Subhajit Datta, Renuka Sindhgatta, Bikram Sengupta
Research Collection School Of Computing and Information Systems
Collaboration is a key aspect of the agile philosophy of software development. As a software system matures over iterations, trends of developer collaboration can offer valuable insights into project dynamics. In this paper, we study evolution of developer collaboration for a large scale agile project on the Jazz platform. We construct networks of collaboration based on developer affiliations across comments on work items and file changes; and then compare parameters of such networks with established results from networks of scientific collaborations. The comparisons illuminate interesting facets of developer collaboration on the Jazz platform. Such perception helps deeper understanding of the …
Mining Iterative Generators And Representative Rules For Software Specification Discovery, David Lo, Jinyan Li, Limsoon Wong, Siau-Cheng Khoo
Mining Iterative Generators And Representative Rules For Software Specification Discovery, David Lo, Jinyan Li, Limsoon Wong, Siau-Cheng Khoo
Research Collection School Of Computing and Information Systems
Billions of dollars are spent annually on software-related cost. It is estimated that up to 45 percent of software cost is due to the difficulty in understanding existing systems when performing maintenance tasks (i.e., adding features, removing bugs, etc.). One of the root causes is that software products often come with poor, incomplete, or even without any documented specifications. In an effort to improve program understanding, Lo et al. have proposed iterative pattern mining which outputs patterns that are repeated frequently within a program trace, or across multiple traces, or both. Frequent iterative patterns reflect frequent program behaviors that likely …
Solving The Teacher Assignment Problem By Two Metaheuristics, Aldy Gunawan, Kien Ming Ng
Solving The Teacher Assignment Problem By Two Metaheuristics, Aldy Gunawan, Kien Ming Ng
Research Collection School Of Computing and Information Systems
The timetabling problem arising from a university in Indonesia is addressed in this paper.It involves the assignment of teachers to the courses and course sections. We formulate theproblem as a mathematical programming model. Two different algorithms, mainly basedon simulated annealing (SA) and tabu search (TS) algorithms, are proposed for solving theproblem. The proposed algorithms consist of two phases. The first phase involves allocatingthe teachers to the courses and determining the number of courses to be assigned to eachteacher. The second phase involves assigning the teachers to the course sections in order tobalance the teachers’ load. The performance of the proposed …
Solving The Quadratic Assignment Problem By A Hybrid Algorithm, Aldy Gunawan, Kien Ming Ng, Kim Leng Poh
Solving The Quadratic Assignment Problem By A Hybrid Algorithm, Aldy Gunawan, Kien Ming Ng, Kim Leng Poh
Research Collection School Of Computing and Information Systems
This paper presents a hybrid algorithm to solve the Quadratic Assignment Problem (QAP). The proposed algorithminvolves using the Greedy Randomized Adaptive Search Procedure (GRASP) to obtain an initial solution, and then using a combinedSimulated Annealing (SA) and Tabu Search (TS) algorithm to improve the solution. Experimental results indicate that the hybridalgorithm is able to obtain good quality solutions for QAPLIB test problems within reasonable computation time.
Workshop Report From Web2se 2011: 2nd International Workshop On Web 2.0 For Software Engineering, Christoph Treude, Margaret-Anne Storey, Arie Van Deursen, Andrew Begel, Sue Black
Workshop Report From Web2se 2011: 2nd International Workshop On Web 2.0 For Software Engineering, Christoph Treude, Margaret-Anne Storey, Arie Van Deursen, Andrew Begel, Sue Black
Research Collection School Of Computing and Information Systems
Web 2.0 technologies, such as wikis, blogs, tags and feeds, have been adopted and adapted by software engineers. With the annual Web2SE workshop, we provide a venue for research on Web 2.0 for software engineering by highlighting state-of-the-art work, identifying current research areas, discussing implications of Web 2.0 on software engineering, and outlining the risks and challenges for researchers. This report highlights the paper and tool presentations, and the discussions among participants at Web2SE 2011 in Honolulu, as well as future directions of the Web2SE workshop community.
Instance-Based Parameter Tuning Via Search Trajectory Similarity Clustering, Linda Lindawati, Hoong Chuin Lau, David Lo
Instance-Based Parameter Tuning Via Search Trajectory Similarity Clustering, Linda Lindawati, Hoong Chuin Lau, David Lo
Research Collection School Of Computing and Information Systems
This paper is concerned with automated tuning of parameters in local-search based meta-heuristics. Several generic approaches have been introduced in the literature that returns a ”one-size-fits-all” parameter configuration for all instances. This is unsatisfactory since different instances may require the algorithm to use very different parameter configurations in order to find good solutions. There have been approaches that perform instance-based automated tuning, but they are usually problem-specific. In this paper, we propose CluPaTra, a generic (problem-independent) approach to perform parameter tuning, based on CLUstering instances with similar PAtterns according to their search TRAjectories. We propose representing a search trajectory as …
Fine-Tuning Algorithm Parameters Using The Design Of Experiments Approach, Aldy Gunawan, Hoong Chuin Lau, Linda Lindawati
Fine-Tuning Algorithm Parameters Using The Design Of Experiments Approach, Aldy Gunawan, Hoong Chuin Lau, Linda Lindawati
Research Collection School Of Computing and Information Systems
Optimizing parameter settings is an important task in algorithm design. Several automated parameter tuning procedures/configurators have been proposed in the literature, most of which work effectively when given a good initial range for the parameter values. In the Design of Experiments (DOE), a good initial range is known to lead to an optimum parameter setting. In this paper, we present a framework based on DOE to find a good initial range of parameter values for automated tuning. We use a factorial experiment design to first screen and rank all the parameters thereby allowing us to then focus on the parameter …
Opportunistic Routing In Wireless Sensor Networks Powered By Ambient Energy Harvesting, Zhi Ang Eu, Hwee-Pink Tan, Winston K. G. Seah
Opportunistic Routing In Wireless Sensor Networks Powered By Ambient Energy Harvesting, Zhi Ang Eu, Hwee-Pink Tan, Winston K. G. Seah
Research Collection School Of Computing and Information Systems
Energy consumption is an important issue in the design of wireless sensor networks (WSNs) which typically rely on portable energy sources like batteries for power. Recent advances in ambient energy harvesting technologies have made it possible for sensor nodes to be powered by ambient energy entirely without the use of batteries. However, since the energy harvesting process is stochastic, exact sleep-and-wakeup schedules cannot be determined in WSNs Powered solely using Ambient Energy Harvesters (WSN–HEAP). Therefore, many existing WSN routing protocols cannot be used in WSN–HEAP. In this paper, we design an opportunistic routing protocol (EHOR) for multi-hop WSN–HEAP. Unlike traditional …
Model Checking Hierarchical Probabilistic Systems, Jun Sun, Songzheng Song, Yang Liu
Model Checking Hierarchical Probabilistic Systems, Jun Sun, Songzheng Song, Yang Liu
Research Collection School Of Computing and Information Systems
Probabilistic modeling is important for random distributed algorithms, bio-systems or decision processes. Probabilistic model checking is a systematic way of analyzing finite-state probabilistic models. Existing probabilistic model checkers have been designed for simple systems without hierarchy. In this paper, we extend the PAT toolkit to support probabilistic model checking of hierarchical complex systems. We propose to use PCSP#, a combination of Hoare’s CSP with data and probability, to model such systems. In addition to temporal logic, we allow complex safety properties to be specified by non-probabilistic PCSP# model. Validity of the properties (with probability) is established by refinement checking. Furthermore, …
The Impact Of Social Media On Software Engineering Practices And Tools, Margaret-Anne Storey, Christoph Treude, Arie Van Deursen, Li-Te Cheng
The Impact Of Social Media On Software Engineering Practices And Tools, Margaret-Anne Storey, Christoph Treude, Arie Van Deursen, Li-Te Cheng
Research Collection School Of Computing and Information Systems
Today's generation of software developers frequently make use of social media, either as an adjunct or integrated into a wide range of tools ranging from code editors and issue trackers, to IDEs and web-based portals. The role of social media usage in software engineering is not well understood, and yet the use of these mechanisms influences software development practices. In this position paper, we advocate for research that strives to understand the benefits, risks and limitations of using social media in software development at the team, project and community levels. Guided by the implications of current tools and social media …
Arivu: Power-Aware Middleware For Multiplayer Mobile Games, Bhojan Anand, Karthik Thirugnanam, Thanh Long Le, Duc-Dung Pham, Akhihebbal L. Ananda, Rajesh Krishna Balan, Mun Choon Chan
Arivu: Power-Aware Middleware For Multiplayer Mobile Games, Bhojan Anand, Karthik Thirugnanam, Thanh Long Le, Duc-Dung Pham, Akhihebbal L. Ananda, Rajesh Krishna Balan, Mun Choon Chan
Research Collection School Of Computing and Information Systems
With the improved processing power, graphic quality and high-speed wireless connection in recent generations of mobile phone, it looks more attractive than ever to introduce networked games on these devices. While device features and application resource requirements are rapidly growing, the battery technologies are not growing at the same pace. Networked Mobile games are a class of application, which consume higher levels of energy, as they are naturally more computationally intensive and use hardware components including audio, display and network to their fullest capacities. Therefore, the main concern is the limitation of the battery power of such portable devices to …
Evolution Of A Bluetooth Test Application Product Line: A Case Study, Narayanasamy Ramasubbu, Rajesh Krishna Balan
Evolution Of A Bluetooth Test Application Product Line: A Case Study, Narayanasamy Ramasubbu, Rajesh Krishna Balan
Research Collection School Of Computing and Information Systems
In this paper, we study the decision making process involved in the five year lifecycle of a Bluetooth software product produced by a large, multi-national test and measurement firm. In this environment, customer change requests either have to be added as a standard feature in the product, or developed as a special customized version of the product. We first discuss the influential factors, such as evolving standards, market share, installed-base, and complexity, which collectively determined how the firm responded to product change requests. We then develop a predictive decision model to test the collective impact of these factors on determining …
Model Checking A Model Checker: A Code Contract Combined Approach, Jun Sun, Yang Liu, Bin Cheng
Model Checking A Model Checker: A Code Contract Combined Approach, Jun Sun, Yang Liu, Bin Cheng
Research Collection School Of Computing and Information Systems
Model checkers, like any complex software, are subject to bugs. Unlike ordinary software, model checkers are often used to verify safety critical systems. Their correctness is thus vital. Verifying model checkers is extremely challenging because they are always complicated in logic and highly optimized. In this work, we propose a code contract combined approach for checking model checkers and apply it to a home-grown model checker PAT. In this approach, we firstly embed programming contracts (i.e., pre/post-conditions and invariants) into its source code, which can capture correctness of model checking algorithms, underlying data structures, consistency between different model checking parameters, …
Wireless Sensing Without Sensors: An Experimental Study Of Motion/Intrusion Detection Using Rf Irregularity, Wei Qi Lee, Winston K. G. Seah, Hwee-Pink Tan, Zexi Yao
Wireless Sensing Without Sensors: An Experimental Study Of Motion/Intrusion Detection Using Rf Irregularity, Wei Qi Lee, Winston K. G. Seah, Hwee-Pink Tan, Zexi Yao
Research Collection School Of Computing and Information Systems
Motion and intrusion detection are often cited as wireless sensor network (WSN) applications with typical configurations comprising clusters of wireless nodes equipped with motion sensors to detect human motion. Currently, WSN performance is subjected to several constraints, namely radio irregularity and finite on-board computation/energy resources. Radio irregularity in radio frequency (RF) propagation rises to a higher level in the presence of human activity due to the absorption effect of the human body. In this paper, we investigate the feasibility of monitoring RF transmission for the purpose of intrusion detection through experimentation. With empirical data obtained from the Crossbow TelosB platform …
Mining Collaboration Patterns From A Large Developer Network, Didi Surian, David Lo, Ee Peng Lim
Mining Collaboration Patterns From A Large Developer Network, Didi Surian, David Lo, Ee Peng Lim
Research Collection School Of Computing and Information Systems
In this study, we extract patterns from a large developer collaborations network extracted from Source Forge. Net at high and low level of details. At the high level of details, we extract various network-level statistics from the network. At the low level of details, we extract topological sub-graph patterns that are frequently seen among collaborating developers. Extracting sub graph patterns from large graphs is a hard NP-complete problem. To address this challenge, we employ a novel combination of graph mining and graph matching by leveraging network-level properties of a developer network. With the approach, we successfully analyze a snapshot of …
Attracting The Community's Many Eyes: An Exploration Of User Involvement In Issue Tracking, Lars Grammel, Holger Schackmann, Adrian Schröter, Christoph Treude, Margaret-Anne Storey
Attracting The Community's Many Eyes: An Exploration Of User Involvement In Issue Tracking, Lars Grammel, Holger Schackmann, Adrian Schröter, Christoph Treude, Margaret-Anne Storey
Research Collection School Of Computing and Information Systems
A community of users who report bugs and request features provides valuable feedback that can be used in product development. We compare the community involvement in issue tracker usage between the open source project Eclipse and the closed source project IBM Jazz to evaluate if publicly accessible issue trackers work as well in closed source projects. We find that IBM Jazz successfully receives user feedback through this channel. We then explore the differences in work item processing in IBM Jazz between team members, project members and externals. We conclude that making public issue trackers available in closed source projects is …
Secureangle: Improving Wireless Security Using Angle-Of-Arrival Information, Jie Xiong, Kyle Jamieson
Secureangle: Improving Wireless Security Using Angle-Of-Arrival Information, Jie Xiong, Kyle Jamieson
Research Collection School Of Computing and Information Systems
Wireless networks play an important role in our everyday lives, at the workplace and at home. However, they are also relatively vulnerable: physically located off site, attackers can circumvent wireless security protocols such as WEP, WPA, and even to some extent WPA2, presenting a security risk to the entire network. To address this problem, we propose SecureAngle, a system designed to operate alongside existing wireless security protocols, adding defense in depth. SecureAngle leverages multi-antenna APs to profile the directions at which a client's signal arrives, using this angle-of-arrival (AoA) information to construct signatures that uniquely identify each client. We identify …
Secureangle: Improving Wireless Security Using Angle-Of-Arrival Information, Jie Xiong, Kyle Jamieson
Secureangle: Improving Wireless Security Using Angle-Of-Arrival Information, Jie Xiong, Kyle Jamieson
Research Collection School Of Computing and Information Systems
Wireless networks play an important role in our everyday lives, at the workplace and at home. However, they are also relatively vulnerable: physically located off site, attackers can circumvent wireless security protocols such as WEP, WPA, and even to some extent WPA2, presenting a security risk to the entire network. To address this problem, we propose SecureAngle, a system designed to operate alongside existing wireless security protocols, adding defense in depth. SecureAngle leverages multi-antenna APs to profile the directions at which a client's signal arrives, using this angle-of-arrival (AoA) information to construct signatures that uniquely identify each client. We identify …
Scenario-Based And Value-Based Specification Mining: Better Together, David Lo, Shahar Maoz
Scenario-Based And Value-Based Specification Mining: Better Together, David Lo, Shahar Maoz
Research Collection School Of Computing and Information Systems
Specification mining takes execution traces as input and extracts likely program invariants, which can be used for comprehension, verification, and evolution related tasks. In this work we integrate scenario-based specification mining, which uses data-mining algorithms to suggest ordering constraints in the form of live sequence charts, an inter-object, visual, modal, scenario-based specification language, with mining of value-based invariants, which detects likely invariants holding at specific program points. The key to the integration is a technique we call scenario-based slicing, running on top of the mining algorithms to distinguish the scenario-specific invariants from the general ones. The resulting suggested specifications are …
Matching Dependence-Related Queries In The System Dependence Graph., Xiaoyin Wang, David Lo, Jiefeng Cheng, Lu Zhang, Hong Mei, Jeffrey Xu Yu
Matching Dependence-Related Queries In The System Dependence Graph., Xiaoyin Wang, David Lo, Jiefeng Cheng, Lu Zhang, Hong Mei, Jeffrey Xu Yu
Research Collection School Of Computing and Information Systems
In software maintenance and evolution, it is common that developers want to apply a change to a number of similar places. Due to the size and complexity of the code base, it is challenging for developers to locate all the places that need the change. A main challenge in locating the places that need the change is that, these places share certain common dependence conditions but existing code searching techniques can hardly handle dependence relations satisfactorily. In this paper, we propose a technique that enables developers to make queries involving dependence conditions and textual conditions on the system dependence graph …
Comprehensive Evaluation Of Association Measures For Fault Localization, Lucia Lucia, David Lo, Lingxiao Jiang, Aditya Budi
Comprehensive Evaluation Of Association Measures For Fault Localization, Lucia Lucia, David Lo, Lingxiao Jiang, Aditya Budi
Research Collection School Of Computing and Information Systems
In statistics and data mining communities, there have been many measures proposed to gauge the strength of association between two variables of interest, such as odds ratio, confidence, Yule-Y, Yule-Q, Kappa, and gini index. These association measures have been used in various domains, for example, to evaluate whether a particular medical practice is associated positively to a cure of a disease or whether a particular marketing strategy is associated positively to an increase in revenue, etc. This paper models the problem of locating faults as association between the execution or non-execution of particular program elements with failures. There have been …
An Automated Approach For Finding Variable-Constant Pairing Bugs, Julia Lawall, David Lo
An Automated Approach For Finding Variable-Constant Pairing Bugs, Julia Lawall, David Lo
Research Collection School Of Computing and Information Systems
Named constants are used heavily in operating systems code, both as internal flags and in interactions with devices. Decision making within an operating system thus critically depends on the correct usage of these values. Nevertheless, compilers for the languages typically used in implementing operating systems provide little support for checking the usage of named constants. This affects correctness, when a constant is used in a context where its value is meaningless, and software maintenance, when a constant has the right value for its usage context but the wrong name. We propose a hybrid program-analysis and data-mining based approach to identify …