Browse by Subject "computer science"

  • Cook, Damon J.; Biehl, Jacob T.; Metcalf, Heather E.; Bailey, Brian P. (2005-08)
    A key technique for evaluating early design ideas is the use of low-fidelity prototypes. Low-fidelity prototypes allow for rapid iterations that significantly improve the interface design with minimal investment of time ...
    untranslated PDF (157KB)
  • Garrido, Alejandra; Meseguer, Jose; Johnson, Ralph (2006-02)
    Refactoring has become a popular technique for the development and maintenance of object-oriented systems. We have been working on the refactoring of C programs, including the C preprocessor (Cpp), and we have built ...
    untranslated PDF (201KB)
  • Meseguer, Jose; Palomino, Miguel; Marti-Oliet, Narciso (2007-08)
    A fruitful approach to the study of state-based systems consists in their mathematical formalization by means of models like Kripke structures. They allow verification of their associated properties using simulations that ...
    untranslated PDF (490KB)
  • Roşu, Grigore; Bensalem, Saddek (2006-01)
    The relationship between two well established formalisms for temporal reasoning is first investigated, namely between Allen's interval algebra (or Allen's temporal logic, abbreviated \ATL) and linear temporal logic (\LTL). ...
    untranslated PDF (298KB)
  • Li, Man-Lap; Sasanka, Ruchira; Adve, Sarita V.; Chen, Yen-Kuang; Debes, Eric (2005-07)
    Multimedia applications are becoming increasingly important for a large class of general-purpose processors. Contemporary media applications are highly complex and demand high performance. A distinctive feature of these ...
    untranslated PDF (119KB)
  • Zhou, Pin (2006-09)
    As Moore's law has been continuously improving the microprocessor's speed, performance is no longer the only focus. Software robustness has become one of the increasingly important issues. However, recent impressive advances ...
    untranslated PDF (920KB)
  • Swarup, Samarth (2007-09)
    This dissertation studies the impact of a dynamical interaction network on the distributed learning of a common language. In recent years there has been much interest is developing algorithms for enabling populations of ...
    untranslated PDF (6MB)
  • Tirumala, Ajay Sudarshan (2006-09)
    Critical systems in areas ranging from avionics to consumer car control systems are being built by integrated commercial-off-the-shelf (COTS) components. Software components used in these systems need to satisfy many ...
    untranslated PDF (1MB)
  • Nguyen, Hoang; Nahrstedt, Klara (2006-10)
    We propose a hierarchical cooperative response framework for containment of value-changing attacks in large- scale hierarchical critical infrastructures. We define a notion of attack container, which is a logical entity ...
    untranslated PDF (403KB)
  • Dig, Danny; Comertoglu, Can; Marinov, Darko; Johnson, Ralph (2005-12)
    One of the costs of reusing software components is migrating applications to use the new version of the components. Migrating an application can be error-prone, tedious, and disruptive of the development process. Our ...
    untranslated PDF (329KB)
  • Daniel, Brett; Dig, Danny; Garcia, Kely; Marinov, Darko (2007-03)
    Refactorings are behavior-preserving program transformations that improve the design of a program. Refactoring engines are tools that automate the application of refactorings: first the user chooses a refactoring to apply, ...
    untranslated PDF (151KB)
  • d'Amorim, Marcelo; Hills, Mark; Chen, Feng; Rosu, Grigore (2005-12)
    The loss of NASA's Mars climate orbiter is evidence of the importance of units of measurement as a safety policy for software in general and for scientific applications in particular. In this paper we present a static ...
    untranslated PDF (244KB)
  • Wei, Mingliang; Snir, Marc; Torrellas, Josep; Tremaine, R. Brett (2005-02)
    The Near Memory Processor (NMP) is a multithreaded vector processor integrated with the memory controller. The NMP works subordinately upon requests from the main processors. The NMP is complementary to the conventional ...
    untranslated PDF (108KB)
  • Xin, Dong; Shao, Zheng; Han, Jiawei; Liu, Hongyan (2005-10)
    It is well recognized that data cubing often produces huge outputs. Two popular efforts devoted to this problem are (1) iceberg cube, where only significant cells are kept, and (2)closed cube, where a group of cells which ...
    untranslated PDF (209KB)
  • Strauss, Karin (2007-08)
    Design complexity and limited power budget are causing the number of cores on the same chip to grow very rapidly. The wide availability of Chip Multiprocessors (CMPs) is enabling the design of inexpensive, shared-memory ...
    untranslated PDF (620KB)
  • Farzan, Azadeh; Madhusudan, P. (2007-01)
    We define a novel formulation of dataflow analysis for concurrent programs, where the flow of facts is along the causal dependencies of events. We capture the control flow of concurrent programs using a Petri net (called ...
    untranslated PDF (2MB)
  • Lucanu, Dorel; Rosu, Grigore (2009-02)
    Coinductive proofs of behavioral equivalence often require human ingenuity, in that one is expected to provide a "good" relation extending one's goal with additional lemmas, making automation of coinduction a challenging ...
    untranslated PDF (260KB)
  • Rosu, Grigore; Lucanu, Dorel (2009-02)
    Several algorithmic variants of circular coinduction have been proposed and implemented during the last decade, but a proof theoretical foundation of circular coinduction in its full generality is still missing. This paper ...
    untranslated PDF (223KB)
  • Wolf, Michael M.; Heath, Michael T. (2009-02)
    It has been shown that combinatorial optimization of matrix-vector multiplication can lead to faster evaluation of finite element stiffness matrices. Based on a graph model characterizing relationships between rows, an ...
    untranslated PDF (310KB)
  • Hendrix, Joe; Ohsaki, Hitoshi (2008-02)
    In this paper, we study combining equational tree automata in two different senses: (1) whether decidability results about equational tree automata over disjoint theories imply similar decidability results in the combined ...
    untranslated PDF (463KB)