Computer Sciences Commons^™

Specifying Reusable Aspects, Neelam Soundarajan, Raffi Khatchadourian

Publications and Research

Aspect-Oriented Programming enables developers to manage, in a more modular fashion, implementations of crosscutting concerns that might be scattered or tangled if aspect-oriented techniques were not utilized. Our interest in this paper is in considering techniques for specifying precise properties of aspects. In particular, we are interested in specifying reusable aspects; i.e., aspects that correspond to crosscutting concerns that occur in many systems. These abstract aspects can be reused in various systems where a particular concern is applicable. Although there has been work on issues related to reasoning about aspects and the behaviors of aspect-oriented systems, specifying reusable abstract aspects …

Computer-Aided Reasoning About Knowledge And Justifications, Natalia Novak

Dissertations, Theses, and Capstone Projects

In the first Chapter we compare two well-known type-based computer frameworks for computer aided logical reasoning and verification: MetaPRL and Coq. In particular, we implement in MetaPRL the Calculus of Inductive Constructions which is the theoretical base for Coq. This work has shown the common points of MetaPRL and Coq, and revealed their principal methodological differences. A possible application of this work is a possibility to perform re-validation in MetaPRL of the existing library of Coq proofs which could help to build more trust in the latter.

Chapter 2 is the main contribution of the dissertation. It contains the description …

A Symbolic Sonification Of L-Systems, Adam James Wilson

Publications and Research

This paper describes a simple technique for the sonification of branching structures in plants. The example is intended to illustrate a qualitative definition of best practices for sonification aimed at the production of musical material. Visually manifest results of tree growth are modelled and subsequently mapped to pitch, time, and amplitude. Sample results are provided in symbolic music notation.

Quirky, Not Quacky: Quantum Computing For Librarians, Jill Cirasella

Publications and Research

This slideshow introduces librarians and non-scientists to the relatively young field of quantum computing.

An Analysis Of Entries In The First Tac Market Design Competition, Jinzhong Niu, Kai Cai, Peter Mcburney, Simon Parsons

Publications and Research

This paper presents an analysis of entries in the first TAC Market Design Competition final that compares the entries across several scenarios. The analysis complements previous work analyzing the 2007 competition, demonstrating some vulnerabilities of entries that placed highly in the competition. The paper also suggests a simple strategy that would have performed well.

On The Assessment Of Pointcut Design In Evolving Aspect-Oriented Software, Raffi Khatchadourian, Phil Greenwood, Awais Rashid

Publications and Research

No abstract provided.

Rejuvenate Pointcut: A Tool For Pointcut Expression Recovery In Evolving Aspect-Oriented Software, Raffi Khatchadourian, Awais Rashid

Publications and Research

Aspect-oriented programming (AOP) strives to localize the scattered and tangled implementations of crosscutting concerns (CCCs) by allowing developers to declare that certain actions (advice) should be taken at specific points (join points) during the execution of software where a CCC (an aspect) is applicable. However, it is non-trivial to construct optimal pointcut expressions (a collection of join points) that capture the true intentions of the programmer and, upon evolution, maintain these intentions. We demonstrate an AspectJ source-level inferencing tool called rejuvenate pointcut which helps developers maintain pointcut expressions over the lifetime of a software product. A key insight into the …

Keeping Abreast Of Quantum News: Quantum Computing On The Web And In The Literature, Jill Cirasella

Publications and Research

This appendix describes tools that can help you track developments in quantum computing.

Historical Bibliography Of Quantum Computing, Jill Cirasella

Publications and Research

This bibliographic essay reviews seminal papers in quantum computing. Although quantum computing is a young science, its researchers have already published thousands of noteworthy articles, far too many to list here. Therefore, this appendix is not a comprehensive chronicle of the emergence and evolution of the field but rather a guided tour of some of the papers that spurred, formalized, and furthered its study.

Pointcut Rejuvenation: Recovering Pointcut Expressions In Evolving Aspect-Oriented Software, Raffi Khatchadourian, Phil Greenwood, Awais Rashid, Guoqing 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 which 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, we first …

Characterizing Effective Auction Mechanisms: Insights From The 2007 Tac Mechanism Design Competition, Jinzhong Niu, Kai Cai, Simon Parsons, Enrico Gerding, Peter Mcburney

Publications and Research

This paper analyzes the entrants to the 2007 TAC Market Design competition. It presents a classification of the entries to the competition, and uses this classification to compare these entries. The paper also attempts to relate market dynamics to the auction rules adopted by these entries and their adaptive strategies via a set of post-tournament experiments. Based on this analysis, the paper speculates about the design of effective auction mechanisms, both in the setting of this competition and in the more general case.

Jcat: A Platform For The Tac Market Design Competition, Jinzhong Niu, Kai Cai, Simon Parsons, Enrico Gerding, Peter Mcburney, Thierry Moyaux, Steve Phelps, David Shield

Publications and Research

No abstract provided.

Enforcing Behavioral Constraints In Evolving Aspect-Oriented Programs, Raffi Khatchadourian, Johan Dovland, Neelam Soundarajan

Publications and Research

Reasoning, specification, and verification of Aspect-Oriented (AO) programs presents unique challenges especially as such programs evolve over time. Components, base-code and aspects alike, may be easily added, removed, interchanged, or presently unavailable at unpredictable frequencies. Consequently, modular reasoning of such programs is highly attractive as it enables tractable evolution, otherwise necessitating that the entire program be reexamined each time a component is changed. It is well known, however, that modular reasoning about AO programs is difficult. In this paper, we present our ongoing work in constructing a rely-guarantee style reasoning system for the Aspect-Oriented Programming (AOP) paradigm, adopting a trace-based …

Tr-2008007: Degeneration Of Structured Integer Matrices Modulo An Integer, Victor Y. Pan, Xinmao Wang

Computer Science Technical Reports

No abstract provided.

Tr-2008008: Schur Aggregation For Linear Systems And Determinants, V. Y. Pan, D. Grady, B. Murphy, G. Qian, R. E. Rosholt, A. D. Ruslanov

Computer Science Technical Reports

No abstract provided.

Tr-2008015: An Efficient Heuristic For The Tree Alignment Problem, Andrés Varón, Ward Wheeler, Amotz Bar-Noy

Computer Science Technical Reports

No abstract provided.

Tr-2008013: Content-Based 3d Mosaics For Large-Scale Dynamic Urban Scenes, Hao Tang, Zhigang Zhu

Computer Science Technical Reports

No abstract provided.

Tr-2008012: Product-Free Lambek Calculus Is Np-Complete, Yury Savateev

Computer Science Technical Reports

No abstract provided.

Tr-2008011: Contrast Transfer Function Correction In Electron Microscopy, Joanna Klukowska

Computer Science Technical Reports

No abstract provided.

Tr-2008002: On Image Reconstruction From A Small Number Of Projections, G. T. Herman, R. Davidi

Computer Science Technical Reports

No abstract provided.

Tr-2008001: Public And Private Communication Are Different: Results On Relative Expressivity, Bryan Renne

Computer Science Technical Reports

No abstract provided.

Tr-2008003: Unified Nearly Optimal Algorithms For Structured Integer Matrices And Polynomials, Victor Y. Pan, Brian Murphy, Rhys E. Rosholt

Computer Science Technical Reports

No abstract provided.

Tr-2008004: Additive Preconditioning For Matrix Computations, Victor Y. Pan, Dmitriy Ivolgin, Brian Murphy, Rhys Eric Rosholt, Yuqing Tang, Xiaodong Yan

Computer Science Technical Reports

No abstract provided.

Tr-2008005: Weakly Random Additive Preconditioning For Matrix Computations, Victor Y. Pan, Dmitriy Ivolgin, Brian Murphy, Rhys Eric Rosholt, Yuqing Tang, Xiaodong Yan

Computer Science Technical Reports

No abstract provided.

Tr-2008016: An Analysis Of Entries In The First Tac Market Design Competition, Jinzhong Niu, Kai Cai, Simon Parsons, Peter Mcburney

Computer Science Technical Reports

No abstract provided.

Topological And Categorical Properties Of Binary Trees, Homeira Pajoohesh

Publications and Research

Binary trees are very useful tools in computer science for estimating the running time of so-called comparison based algorithms, algorithms in which every action is ultimately based on a prior comparison between two elements. For two given algorithms A and B where the decision tree of A is more balanced than that of B, it is known that the average and worst case times of A will be better than those of B, i.e., ₸A(n) ≤₸B(n) and TWA (n)≤TWB (n). Thus the most balanced and the most imbalanced binary trees play a main role. Here we consider them as semilattices …

Tr-2008006: Additive Preconditioning, Eigenspaces, And The Inverse Iteration, Victor Y. Pan, Xiaodong Yan

Computer Science Technical Reports

No abstract provided.

Tr-2008009: Solving Homogeneous Linear Systems With Weakly Randomized Additive Preprocessing, Victor Y. Pan, Guoliang Qian

Computer Science Technical Reports

No abstract provided.

Tr-2008010: The Logic Of Justification, Sergei Artemov

Computer Science Technical Reports

No abstract provided.

Tr-2008014: Why Do We Need Justification Logic?, Sergei Artemov

Computer Science Technical Reports

No abstract provided.