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

Programming Languages and Compilers Commons

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

993 Full-Text Articles 1,456 Authors 492,140 Downloads 135 Institutions

All Articles in Programming Languages and Compilers

Faceted Search

993 full-text articles. Page 34 of 38.

Automatic Compositional Verification Of Timed Systems, Shang-Wei LIN, Yang LIU, Jun SUN, Jin Song DONG, Étienne ANDRÉ 2012 Singapore Management University

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 2012 Johns Hopkins Bloomberg School of Public Health

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 2012 Franklin W. Olin College of Engineering

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 2012 Franklin W. Olin College of Engineering

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 2012 Franklin W. Olin College of Engineering

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 2012 Franklin W. Olin College of Engineering

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 2012 Singapore Management University

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 2012 Singapore Management University

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 2012 Singapore Management University

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 2012 Singapore Management University

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 2012 California Polytechnic State University, San Luis Obispo

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 2012 Singapore Management University

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 2012 Singapore Management University

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 2012 CUNY Hunter College

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 2012 University of Nevada, Las Vegas

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 2012 The University of Texas at El Paso

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.


Health Nexus: A Serious Game Prototype For Prevention And Treatment Of Obesity And Diabetes, Joseph C. Miller 2012 Old Dominion University

Health Nexus: A Serious Game Prototype For Prevention And Treatment Of Obesity And Diabetes, Joseph C. Miller

Computational Modeling & Simulation Engineering Theses & Dissertations

Electronic games are a prevalent phenomenon of American culture and entertainment. Serious games are video games that take advantage of games' intrinsic entertaining and challenging characteristics for serious purposes, such as education, training, advertisement, and political campaigns. A significant number of serious games have been developed for a variety of diverse purposes. The last few years have witnessed the inception and growth of motion sensing technologies for games, including Nintendo Wii, Sony PlayStation Move, and Microsoft Kinect. These motion sensing technologies usually require game players' physical body movement in order to perform and achieve in the games, such as playing …


Logo Programming (Part 1) - A Creative And Fun Way To Learn Mathematics And Problem-Solving, Abhay B. Joshi, Sandesh R. Gaikwad 2012 SPARK Institute

Logo Programming (Part 1) - A Creative And Fun Way To Learn Mathematics And Problem-Solving, Abhay B. Joshi, Sandesh R. Gaikwad

Abhay B Joshi

Programming means tapping into the computerʹs immense power by talking with it directly. Through programming, children use the computerʹs terrific power to draw graphics, design animation, solve mathematical or word puzzles, and even build robots. This idea was first proposed in the famous book ʺMindstormsʺ by Seymour Papert and has subsequently been appreciated and praised by educators and parents all over the world.

Through programming, students discover that the computer is a powerful and flexible tool. Using interesting ideas embedded in programming environments, students solve problems in their favorite subjects, and also develop interest in ʺdifficultʺ subjects like Math and …


Logo Programming (Part 2) - A Creative And Fun Way To Learn Mathematics And Problem-Solving, Abhay B. Joshi, Sandesh R. Gaikwad 2012 SPARK Institute

Logo Programming (Part 2) - A Creative And Fun Way To Learn Mathematics And Problem-Solving, Abhay B. Joshi, Sandesh R. Gaikwad

Abhay B Joshi

Programming means tapping into the computerʹs immense power by talking with it directly. Through programming, children use the computerʹs terrific power to draw graphics, design animation, solve mathematical or word puzzles, and even build robots. This idea was first proposed in the famous book ʺMindstormsʺ by Seymour Papert and has subsequently been appreciated and praised by educators and parents all over the world.

Through programming, students discover that the computer is a powerful and flexible tool. Using interesting ideas embedded in programming environments, students solve problems in their favorite subjects, and also develop interest in ʺdifficultʺ subjects like Math and …


Formal Modeling And Validation Of Stateflow Diagrams, Chunqing CHEN, Jun SUN, Yang LIU, Jin Song DONG, Manchun ZHENG 2012 Singapore Management University

Formal Modeling And Validation Of Stateflow Diagrams, Chunqing Chen, Jun Sun, Yang Liu, Jin Song Dong, Manchun Zheng

Research Collection School Of Computing and Information Systems

Stateflow is an industrial tool for modeling and simulating control systems in model-based development. In this paper, we present our latest work on automatic verification of Stateflow using model-checking techniques. We propose an approach to systematically translate Stateflow diagrams to a formal modeling language called CSP# by precisely following Stateflow’s execution semantics, which is described by examples. A translator is developed inside the Process Analysis Toolkit (PAT) model checker to automate this process with the support of various Stateflow advanced modeling features. Formal analysis can be conducted on the transformed CSP# with PAT’s simulation and model-checking power. Using our approach, …


Digital Commons powered by bepress