Open Access. Powered by Scholars. Published by Universities.®
Programming Languages and Compilers Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Software Engineering (21)
- Engineering (9)
- Computer Engineering (8)
- Theory and Algorithms (5)
- Systems Architecture (4)
-
- Computer and Systems Architecture (3)
- Education (3)
- Teacher Education and Professional Development (3)
- Artificial Intelligence and Robotics (2)
- Databases and Information Systems (2)
- Educational Methods (2)
- Electrical and Computer Engineering (2)
- Hardware Systems (2)
- Junior High, Intermediate, Middle School Education and Teaching (2)
- OS and Networks (2)
- Science and Mathematics Education (2)
- Biomedical (1)
- Biostatistics (1)
- Computational Engineering (1)
- Computer-Aided Engineering and Design (1)
- Data Storage Systems (1)
- Digital Communications and Networking (1)
- Educational Assessment, Evaluation, and Research (1)
- Electrical and Electronics (1)
- Graphics and Human Computer Interfaces (1)
- Information Security (1)
- Library and Information Science (1)
- Institution
-
- Singapore Management University (18)
- Selected Works (6)
- SelectedWorks (4)
- Old Dominion University (3)
- Portland State University (3)
-
- Bryn Mawr College (1)
- COBRA (1)
- California Polytechnic State University, San Luis Obispo (1)
- City University of New York (CUNY) (1)
- Sacred Heart University (1)
- University of Nebraska - Lincoln (1)
- University of Nevada, Las Vegas (1)
- University of Tennessee, Knoxville (1)
- University of Texas at El Paso (1)
- Keyword
-
- Model Check (7)
- Programming (5)
- Articles (4)
- Label Transition System (3)
- Children (2)
-
- Computer Programming as a medium for Learning (2)
- Computers (2)
- FPGA (2)
- K12 (2)
- Learning (2)
- Linear Temporal Logic (2)
- Mathematics (2)
- Matlab (2)
- Operational Semantic (2)
- State Space Explosion (2)
- Time Automaton (2)
- ART based network (1)
- Active Object (1)
- Adaptive routing (Computer network management) (1)
- Adjacency terms relationship. (1)
- Agent (1)
- Agricultural applications (1)
- Albania (1)
- Algorithms (1)
- Android (1)
- Application framework (1)
- Aspect-oriented programming (1)
- Aspect-oriented software (1)
- AspectJ programs (1)
- Automotive-grade CMOS camera (1)
- Publication
-
- Research Collection School Of Computing and Information Systems (18)
- Mark L. Chang (4)
- Abhay B Joshi (2)
- Computer Science Faculty Publications and Presentations (2)
- Ram Gopal Raj (2)
-
- College of Engineering: Graduate Celebration Programs (1)
- Computational Modeling & Simulation Engineering Faculty Publications (1)
- Computational Modeling & Simulation Engineering Theses & Dissertations (1)
- Computer Science Faculty Research and Scholarship (1)
- Department of Computer Science and Engineering: Dissertations, Theses, and Student Research (1)
- Departmental Technical Reports (CS) (1)
- Dissertations and Theses (1)
- Doctoral Dissertations (1)
- Electrical & Computer Engineering Faculty Publications (1)
- Johns Hopkins University, Dept. of Biostatistics Working Papers (1)
- Master's Theses (1)
- Norman Danner (1)
- Publications and Research (1)
- School of Computer Science & Engineering Faculty Publications (1)
- Yasmeen Shorish (1)
- Publication Type
- File Type
Articles 1 - 30 of 43
Full-Text Articles in Programming Languages and Compilers
Data Curation Is For Everyone! The Case For Master's And Baccalaureate Institutional Engagement With Data Curation, Yasmeen Shorish
Data Curation Is For Everyone! The Case For Master's And Baccalaureate Institutional Engagement With Data Curation, Yasmeen Shorish
Yasmeen Shorish
This article describes the fundamental challenges to data curation, how these challenges may be compounded for smaller institutions, and how data management is an essential and manageable component of data curation. Data curation is often discussed within the confines of large, research universities. As a result, master’s and baccalaureate institutions may be left with the impression that they cannot engage with data curation. However, by proactively engaging with faculty, libraries of all sizes can build closer relationships and help educate faculty on data documentation and organization best practices. Experiences from one master’s comprehensive institution as it engages with data management …
Symbolic Model-Checking Of Stateful Timed Csp Using Bdd And Digitization, Truong Khanh Nguyen, Jun Sun, Yang Liu, Jin Song Dong
Symbolic Model-Checking Of Stateful Timed Csp Using Bdd And Digitization, Truong Khanh Nguyen, Jun Sun, Yang Liu, Jin Song Dong
Research Collection School Of Computing and Information Systems
Stateful Timed CSP has been recently proposed to model (and verify) hierarchical real-time systems. It is an expressive modeling language which combines data structure/operations, complicated control flows (modeled using compositional process operators adopted from Timed CSP), and real-time requirements like deadline and within. It has been shown that Stateful Timed CSP is equivalent to closed timed automata with silent transitions, which implies that the timing constraints of Stateful Timed CSP can be captured using explicit tick events, through digitization. In order to tackle the state space explosion problem, we develop a BDD-based symbolic model checking approach to verify Stateful Timed …
Parallel For Loops On Heterogeneous Resources, Frederick Edward Weber
Parallel For Loops On Heterogeneous Resources, Frederick Edward Weber
Doctoral Dissertations
In recent years, Graphics Processing Units (GPUs) have piqued the interest of researchers in scientific computing. Their immense floating point throughput and massive parallelism make them ideal for not just graphical applications, but many general algorithms as well. Load balancing applications and taking advantage of all computational resources in a machine is a difficult challenge, especially when the resources are heterogeneous. This dissertation presents the clUtil library, which vastly simplifies developing OpenCL applications for heterogeneous systems. The core focus of this dissertation lies in clUtil's ParallelFor construct and our novel PINA scheduler which can efficiently load balance work onto multiple …
Dependently Typed Programming With Singletons, Richard A. Eisenberg, Stephanie Weirich
Dependently Typed Programming With Singletons, Richard A. Eisenberg, Stephanie Weirich
Computer Science Faculty Research and Scholarship
Haskell programmers have been experimenting with dependent types for at least a decade, using clever encodings that push the limits of the Haskell type system. However, the cleverness of these encodings is also their main drawback. Although the ideas are in- spired by dependently typed programs, the code looks significantly different. As a result, GHC implementors have responded with ex- tensions to Haskell’s type system, such as GADTs, type families, and datatype promotion. However, there remains a significant dif- ference between programming in Haskell and in full-spectrum de- pendently typed languages. Haskell enforces a phase separation be- tween runtime values …
Dynamic Data Race Detection And Healing, Du Li
Dynamic Data Race Detection And Healing, Du Li
Department of Computer Science and Engineering: Dissertations, Theses, and Student Research
Perpetual availability is an important operational goal in today's computer systems. However, achieving this goal is challenging because modern software systems contain faults that can cause them to fail. For example, multi-threading is widely used in modern software to fully utilize the computing capability of multicore processors. However, employing multi-threading can lead to concurrency faults such as deadlock and data race that are notoriously difficult to to isolate, detect, and repair.Data races, which involves two concurrent accesses to the same data where at least one is a write, are the most common concurrency faults.
As our first step, we investigate …
Fame, Soft Flock Formation Control For Collective Behavior Studies And Rapid Games Development, Choon Sing Ho, Yew-Soon Ong, Xianshun Chen, Ah-Hwee Tan
Fame, Soft Flock Formation Control For Collective Behavior Studies And Rapid Games Development, Choon Sing Ho, Yew-Soon Ong, Xianshun Chen, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
We present FAME, a comprehensive C# software library package providing soft formation control for large flocks of agents. While many existing available libraries provide means to create flocks of agent equipped with simple steering behavior, none so far, to the best of our knowledge, provides an easy and hassle free approach to control the formation of the flock. Here, besides the basic flocking mechanisms, FAME provides an extensive range of advanced features that gives enhanced soft formation control over multiple flocks. These soft formation features include defining flocks in any user-defined formation, automated self-organizing agent within formation, manipulating formation shape …
Effective Computer Programming Instruction For Pre-University Albanian Students, Robert Mccloud, Ardiana Sula
Effective Computer Programming Instruction For Pre-University Albanian Students, Robert Mccloud, Ardiana Sula
School of Computer Science & Engineering Faculty Publications
The relationship between pre-university students and technology is frequently overrated. While we receive glowing reports about how young people are knowledgeable about computers, the truth is that their knowledge is typically about computer content and the manipulation of applications. Young students too often treat the actual programming and understanding of computers as a sort of magical mystery.
In this paper we look at a new Albanian initiative to identify and nurture the most talented of our pre-university students. In particular we look at contributions to the goal of making Albanians the most talented programmers in this area of Europe.
The …
More Anti-Chain Based Refinement Checking, Ting Wang, Songzheng Song, Jun Sun, Yang Liu, Jin Song Dong, Xinyu Wang, Shanping Li
More Anti-Chain Based Refinement Checking, Ting Wang, Songzheng Song, Jun Sun, Yang Liu, Jin Song Dong, Xinyu Wang, Shanping Li
Research Collection School Of Computing and Information Systems
Refinement checking plays an important role in system verification. It establishes properties of an implementation by showing a refinement relationship between the implementation and a specification. Recently, it has been shown that anti-chain based approaches increase the efficiency of trace refinement checking significantly. In this work, we study the problem of adopting anti-chain for stable failures refinement checking, failures-divergence refinement checking and probabilistic refine checking (i.e., a probabilistic implementation against a non-probabilistic specification). We show that the first two problems can be significantly improved, because the state space of the product model may be reduced dramatically. Though applying anti-chain for …
An Analytical And Experimental Comparison Of Csp Extensions And Tools, Ling Shi, Yang Liu, Jun Sun, Jin Song Dong, Gustavo Carvalho
An Analytical And Experimental Comparison Of Csp Extensions And Tools, Ling Shi, Yang Liu, Jun Sun, Jin Song Dong, Gustavo Carvalho
Research Collection School Of Computing and Information Systems
Communicating Sequential Processes (CSP) has been widely applied to modeling and analyzing concurrent systems. There have been considerable efforts on enhancing CSP by taking data and other system aspects into account. For instance, CSP M combines CSP with a functional programming language whereas CSP# integrates high-level CSP-like process operators with low-level procedure code. Little work has been done to systematically compare these CSP extensions, which may have subtle and substantial differences. In this paper, we compare CSP M and CSP# not only on their syntax, but also operational semantics as well as their supporting tools such as FDR, ProB, and …
Automatic Generation Of Provably Correct Embedded Systems, Shang-Wei Lin, Yang Liu, Pao-Ann Hsiung, Jun Sun, Jin Song Dong
Automatic Generation Of Provably Correct Embedded Systems, Shang-Wei Lin, Yang Liu, Pao-Ann Hsiung, Jun Sun, Jin Song Dong
Research Collection School Of Computing and Information Systems
With the demand for new and complicated features, embedded systems are becoming more and more difficult to design and verify. Even if the design of a system is verified, how to guarantee the consistency between the design and its implementation remains a big issue. As a solution, we propose a framework that can help a system designer to model his or her embedded system using a high-level modeling language, verify the design of the system, and automatically generate executable software codes whose behavior semantics are consistent with that of the high-level model. We use two case studies to demonstrate the …
Neural Modeling Of Episodic Memory: Encoding, Retrieval, And Forgetting, Wenwen Wang, Budhitama Subagdja, Ah-Hwee Tan, Janusz A. Starzyk
Neural Modeling Of Episodic Memory: Encoding, Retrieval, And Forgetting, Wenwen Wang, Budhitama Subagdja, Ah-Hwee Tan, Janusz A. Starzyk
Research Collection School Of Computing and Information Systems
This paper presents a neural model that learns episodic traces in response to a continuous stream of sensory input and feedback received from the environment. The proposed model, based on fusion Adaptive Resonance Theory (fusion ART) network, extracts key events and encodes spatio-temporal relations between events by creating cognitive nodes dynamically. The model further incorporates a novel memory search procedure, which performs parallel search of stored episodic traces continuously. Combined with a mechanism of gradual forgetting, the model is able to achieve a high level of memory performance and robustness, while controlling memory consumption over time. We present experimental studies, …
Scalable Content Authentication In H.264/Svc Videos Using Perceptual Hashing Based On Dempster-Shafer Theory, Dengpan Ye, Zhuo Wei, Xuhua Ding, Robert H. Deng
Scalable Content Authentication In H.264/Svc Videos Using Perceptual Hashing Based On Dempster-Shafer Theory, Dengpan Ye, Zhuo Wei, Xuhua Ding, Robert H. Deng
Research Collection School Of Computing and Information Systems
The content authenticity of the multimedia delivery is important issue with rapid development and widely used of multimedia technology. Till now many authentication solutions had been proposed, such as cryptology and watermarking based methods. However, in latest heterogeneous network the video stream transmission has b een coded in scalable way such as H.264/SVC, there is still no good authentication solution. In this paper, we firstly summarized related works and p roposed a scalable content authentication scheme using a ratio of different energy (RDE) based perceptual hashing in Q/S dimension, which is used Dempster-Shafer theory and combined with the latest scalable …
Defeating Sql Injection, Lwin Khin Shar, Hee Beng Kuan Tan
Defeating Sql Injection, Lwin Khin Shar, Hee Beng Kuan Tan
Research Collection School Of Computing and Information Systems
The best strategy for combating SQL injection, which has emerged as the most widespread website security risk, calls for integrating defensive coding practices with both vulnerability detection and runtime attack prevention methods.
Improved Bdd-Based Discrete Analysis Of Timed Systems, Truong Khanh Nguyen, Jun Sun, Yang Liu, Jin Song Dong, Yan Liu
Improved Bdd-Based Discrete Analysis Of Timed Systems, Truong Khanh Nguyen, Jun Sun, Yang Liu, Jin Song Dong, Yan Liu
Research Collection School Of Computing and Information Systems
Model checking timed systems through digitization is relatively easy, compared to zone-based approaches. The applicability of digitization, however, is limited mainly for two reasons, i.e., it is only sound for closed timed systems; and clock ticks cause state space explosion. The former is mild as many practical systems are subject to digitization. It has been shown that BDD-based techniques can be used to tackle the latter to some extent. In this work, we significantly improve the existing approaches by keeping the ticks simple in the BDD encoding. Taking advantage of the ‘simple’ nature of clock ticks, we fine-tune the encoding …
Automatic Compositional Verification Of Timed Systems, Shang-Wei Lin, Yang Liu, Jun Sun, Jin Song Dong, Étienne André
Automatic Compositional Verification Of Timed Systems, Shang-Wei Lin, Yang Liu, Jun Sun, Jin Song Dong, Étienne André
Research Collection School Of Computing and Information Systems
Specification and verification of real-time systems are important research topics with crucial applications; however, the so-called state space explosion problem often prevents model checking to be used in practice for large systems. In this work, we present a self-contained toolkit to analyze real-time systems specified using event-recording automata (ERAs), which supports system modeling, animated simulation, and fully automatic compositional verification based on learning techniques. Experimental results show that our tool outperforms the state-of-the-art timed model checker.
Analytic Programming With Fmri Data: A Quick-Start Guide For Statisticians Using R, Ani Eloyan, Shanshan Li, John Muschelli, Jim Pekar, Stewart Mostofsky, Brian S. Caffo
Analytic Programming With Fmri Data: A Quick-Start Guide For Statisticians Using R, Ani Eloyan, Shanshan Li, John Muschelli, Jim Pekar, Stewart Mostofsky, Brian S. Caffo
Johns Hopkins University, Dept. of Biostatistics Working Papers
Functional magnetic resonance imaging (fMRI) is a thriving field that plays an important role in medical imaging analysis, biological and neuroscience research and practice. This manuscript gives a didactic introduction to the statistical analysis of fMRI data using the R project along with the relevant R code. The goal is to give tatisticians who would like to pursue research in this area a quick start for programming with fMRI data along with the available data visualization tools.
A Parameterized Stereo Vision Core For Fpgas, Mark Chang, Stephen Longfield
A Parameterized Stereo Vision Core For Fpgas, Mark Chang, Stephen Longfield
Mark L. Chang
We present a parameterized stereo vision core suitable for a wide range of FPGA targets and stereo vision applications. By enabling easy tuning of algorithm parameters, our system allows for rapid exploration of the design space and simpler implementation of high-performance stereo vision systems. This implementation utilizes the census transform algorithm to calculate depth information from a pair of images delivered from a simulated stereo camera pair. This work advances our previous work through implementation improvements, a stereo camera pair simulation framework, and a scalable stereo vision core.
Precis: A Design-Time Precision Analysis Tool, Mark L. Chang, Scott Hauck
Precis: A Design-Time Precision Analysis Tool, Mark L. Chang, Scott Hauck
Mark L. Chang
Currently, few tools exist to aid the FPGA developer in translating an algorithm designed for a general-purpose-processor into one that is precision-optimized for FPGAs. This task requires extensive knowledge of both the algorithm and the target hardware. We present a design-time tool, Precis, which assists the developer in analyzing the precision requirements of algorithms specified in MATLAB. Through the combined use of simulation, user input, and program analysis, we demonstrate a methodology for precision analysis that can aid the developer in focusing their manual precision optimization efforts.
Precis: A Usercentric Word-Length Optimization Tool, Mark Chang, Scott Hauck
Precis: A Usercentric Word-Length Optimization Tool, Mark Chang, Scott Hauck
Mark L. Chang
Translating an algorithm designed for a general-purpose processor into an algorithm optimized for custom logic requires extensive knowledge of the algorithm and the target hardware. Precis lets designers analyze the precision requirements of algorithms specified in Matlab. The design time tool combines simulation, user input, and program analysis to help designers focus their manual precision optimization efforts.
Low-Cost Stereo Vision On An Fpga, Chris A. Murphy, Daniel Lindquist, Ann Marie Rynning, Thomas Cecil, Sarah Leavitt, Mark L. Chang
Low-Cost Stereo Vision On An Fpga, Chris A. Murphy, Daniel Lindquist, Ann Marie Rynning, Thomas Cecil, Sarah Leavitt, Mark L. Chang
Mark L. Chang
We present a low-cost stereo vision implementation suitable for use in autonomous vehicle applications and designed with agricultural applications in mind. This implementation utilizes the Census transform algorithm to calculate depth maps from a stereo pair of automotive-grade CMOS cameras. The final prototype utilizes commodity hardware, including a Xilinx Spartan-3 FPGA, to process 320times240 pixel images at greater than 150 frames per second and deliver them via a USB 2.0 interface.
Using Monterey Phoenix To Formalize And Verify System Architectures, Jiexin Zhang, Yang Liu, Mikhail Auguston, Jun Sun, Jin Song Dong
Using Monterey Phoenix To Formalize And Verify System Architectures, Jiexin Zhang, Yang Liu, Mikhail Auguston, Jun Sun, Jin Song Dong
Research Collection School Of Computing and Information Systems
Modeling and analyzing software architectures are useful for helping to understand the system structures and facilitate proper implementation of user requirements. Despite its importance in the software engineering practice, the lack of formal description and verification support hinders the development of quality architectural models. In this work, we develop an approach for modeling and verifying software architectures specified using Monterey Phoenix (MP) architecture description language. Firstly, we formalize the syntax and operational semantics for MP. This language is capable of modeling system and environment behaviors based on event traces, as well as supporting different architecture composition operations and views. Secondly, …
Probabilistic Model Checking Multi-Agent Behaviors In Dispersion Games Using Counter Abstraction, Jianye Hao, Songzheng Song, Yang Liu, Jun Sun, Lin Gui, Jin Song Dong, Ho-Fung Leung
Probabilistic Model Checking Multi-Agent Behaviors In Dispersion Games Using Counter Abstraction, Jianye Hao, Songzheng Song, Yang Liu, Jun Sun, Lin Gui, Jin Song Dong, Ho-Fung Leung
Research Collection School Of Computing and Information Systems
Accurate analysis of the stochastic dynamics of multi-agent system is important but challenging. Probabilistic model checking, a formal technique for analysing a system which exhibits stochastic behaviors, can be a natural solution to analyse multi-agent systems. In this paper, we investigate this problem in the context of dispersion games focusing on two strategies: basic simple strategy (BSS) and extended simple strategies (ESS). We model the system using discrete-time Markov chain (DTMC) and reduce the state space of the models by applying counter abstraction technique. Two important properties of the system are considered: convergence and convergence rate. We show that these …
A Model Checker For Hierarchical Probabilistic Real-Time Systems, Songzheng Song, Jun Sun, Yang Liu, Jin Song Dong
A Model Checker For Hierarchical Probabilistic Real-Time Systems, Songzheng Song, Jun Sun, Yang Liu, Jin Song Dong
Research Collection School Of Computing and Information Systems
Real-life systems are usually hard to control, due to their complicated structures, quantitative time factors and even stochastic behaviors. In this work, we present a model checker to analyze hierarchical probabilistic real-time systems. A modeling language called PRTS is used to specify such systems, and automatic zone-abstraction approach, which is probability preserving, is used to generate finite state MDP. We have implemented PRTS in model checking framework PAT so that friendly user interface can be used to edit, simulate and verify PRTS models. Some experiments are conducted to show our tool’s efficiency.
Translating Pddl Into Csp# - The Pat Approach, Yi Li, Jing Sun, Jin Song Dong, Yang Liu, Jun Sun
Translating Pddl Into Csp# - The Pat Approach, Yi Li, Jing Sun, Jin Song Dong, Yang Liu, Jun Sun
Research Collection School Of Computing and Information Systems
Model checking provides a way to automatically verify hardware and software systems, whereas the goal of planning is to produce a sequence of actions that leads from the initial state to the desired goal state. Recently research indicates that there is a strong connection between model checking and planning problem solving. In this paper, we investigate the feasibility of using a newly developed model checking framework, Process Analysis Toolkit (PAT), to serve as a planning solution provider for upper layer applications. We first carried out a number of experiments on different planning tools in order to compare their performance and …
Cuda Web Api Remote Execution Of Cuda Kernels Using Web Services, Massimo J. Becker
Cuda Web Api Remote Execution Of Cuda Kernels Using Web Services, Massimo J. Becker
Master's Theses
Massively parallel programming is an increasingly growing field with the recent introduction of general purpose GPU computing. Modern graphics processors from NVIDIA and AMD have massively parallel architectures that can be used for such applications as 3D rendering, financial analysis, physics simulations, and biomedical analysis. These massively parallel systems are exposed to programmers through in- terfaces such as NVIDIAs CUDA, OpenCL, and Microsofts C++ AMP. These frame- works expose functionality using primarily either C or C++. In order to use these massively parallel frameworks, programs being implemented must be run on machines equipped with massively parallel hardware. These requirements limit …
Aligning Images In The Wild, Wen-Yan Lin, Linlin Liu, Yasuyuki Matsushita, Kok-Lim Low, Siying Liu
Aligning Images In The Wild, Wen-Yan Lin, Linlin Liu, Yasuyuki Matsushita, Kok-Lim Low, Siying Liu
Research Collection School Of Computing and Information Systems
Aligning image pairs with significant appearance change is a long standing computer vision challenge. Much of this problem stems from the local patch descriptors’ instability to appearance variation. In this paper we suggest this instability is due less to descriptor corruption and more the difficulty in utilizing local information to canonically define the orientation (scale and rotation) at which a patch’s descriptor should be computed. We address this issue by jointly estimating correspondence and relative patch orientation, within a hierarchical algorithm that utilizes a smoothly varying parameterization of geometric transformations. By collectively estimating the correspondence and orientation of all the …
Complexity Of The Soundness Problem Of Bounded Workflow Nets, Guan Jun Liu, Jun Sun, Yang Liu, Jin Song Dong
Complexity Of The Soundness Problem Of Bounded Workflow Nets, Guan Jun Liu, Jun Sun, Yang Liu, Jin Song Dong
Research Collection School Of Computing and Information Systems
Classical workflow nets (WF-nets) are an important class of Petri nets that are widely used to model and analyze workflow systems. Soundness is a crucial property that guarantees these systems are deadlock-free and bounded. Aalst et al. proved that the soundness problem is decidable, and proposed (but not proved) that the soundness problem is EXPSPACE-hard. In this paper, we show that the satisfiability problem of Boolean expression is polynomial time reducible to the liveness problem of bounded WF-nets, and soundness and liveness are equivalent for bounded WF-nets. As a result, the soundness problem of bounded WF-nets is co-NP-hard.Workflow nets with …
Pointcut Rejuvenation: Recovering Pointcut Expressions In Evolving Aspect-Oriented Software, Raffi T. Khatchadourian, Phil Greenwood, Awais Rashid, Harry Xu
Pointcut Rejuvenation: Recovering Pointcut Expressions In Evolving Aspect-Oriented Software, Raffi T. Khatchadourian, Phil Greenwood, Awais Rashid, Harry Xu
Publications and Research
Pointcut fragility is a well-documented problem in Aspect-Oriented Programming; changes to the base code can lead to join points incorrectly falling in or out of the scope of pointcuts. In this paper, we present an automated approach that limits fragility problems by providing mechanical assistance in pointcut maintenance. The approach is based on harnessing arbitrarily deep structural commonalities between program elements corresponding to join points selected by a pointcut. The extracted patterns are then applied to later versions to offer suggestions of new join points that may require inclusion. To illustrate that the motivation behind our proposal is well founded, …
Node Filtering And Face Routing For Sensor Network, Umang Amatya
Node Filtering And Face Routing For Sensor Network, Umang Amatya
College of Engineering: Graduate Celebration Programs
Main Contributions
•Efficient Algorithms for identifying Redundant Sensor Nodes
•New Technique for Filtering Redundant Nodes in Sensor Network
•Reliable Algorithm for Message Routing - Forwarding
•User Friendly Prototype Implementation in Java
•Results of Experimental Investigation
Extending Java For Android Programming, Yoonsik Cheon
Extending Java For Android Programming, Yoonsik Cheon
Departmental Technical Reports (CS)
Android is one of the most popular platforms for developing mobile applications. However, its framework relies on programming conventions and styles to implement framework-specific concepts like activities and intents, causing problems such as reliability, readability, understandability, and maintainability. We propose to extend Java to support Android framework concepts explicitly as built-in language features. Our extension called Android Java will allow Android programmers to express these concepts in a more reliable, natural, and succinct way.