Now showing items 238-245 of 245

    • Value-Driven Redundancy Elimination 

      Simpson, Loren Taylor (1996-04)
      Value-driven redundancy elimination is a combination of value numbering and code motion. Value numbering is an optimization that assigns numbers to values in such a way that two values are assigned the same number if the compiler can prove they are equal. When this optimization discovers two computations that produce the same value, it can (under ...
    • Variational Subdivision for Laplacian Splines 

      Warren, Joe; Weimer, Henrik (1997-10-03)
      The fundamental problem of geometric design is the representation of curved shapes. Traditionally such shapes are represented by parametric spline curves, e.g. NURBS, which are defined as the minimizers of variational problems. For example, cubic B-splines minimize the bending energy functional. More recently subdivision curves and surfaces emerged ...
    • Verification of Fair Transition Systems 

      Kupferman, Orna; Vardi, Moshe Y. (1997-08-27)
      In program verification we check that an implementation meets its specification. Both the specification and the implementation describe the possible behaviors of the program, though at different levels of abstraction. We distinguish between two approaches to implementation of specifications. The first approach is trace-based implementation, where we ...
    • Verification of Open Systems 

      Vardi, Moshe Y. (1998-04-04)
      In computer system design, we distinguish between closed and open systems. A closed system is a system whose behavior is completely determined by the state of the system. An open system is a system that interacts with its environment and whose behavior depends on this interaction. The ability of temporal logics to describe an ongoing interaction of ...
    • Well-Founded Touch Optimization for Futures 

      Felleisen, Matthias; Flanagan, Cormac (1994-10-01)
      The future annotations of MultiLisp provide a simple method for taming the implicit parallelism of functional programs, but require touch operations at all placeholder-strict positions of program operations to ensure proper synchronization between threads. These touch operations contribute substantially to a program's execution time. We use an ...
    • Why Is Modal Logic So Robustly Decidable? 

      Vardi, Moshe Y. (1997-04-12)
      In the last 20 years modal logic has been applied to numerous areas of computer science, including artificial intelligence, program verification, hardware verification, database theory, and distributed computing. There are two main computational problems associated with modal logic. The first problem is checking if a given formula is true in a given ...
    • Work-First and Help-First Scheduling Policies for Terminally Strict Parallel Programs 

      Barik, Rajkishore; Guo, Yi; Raman, Raghavan; Sarkar, Vivek (2008-11-13)
      Multiple programming models are emerging to address an increased need for dynamic task parallelism in applications for multicore processors and shared-address space parallel computing. Examples include OpenMP 3.0, Java Concurrency Utilities, Microsoft Task Parallel Library, Intel Thread Building Blocks, Cilk, X10, Chapel, and Fortress. Scheduling ...
    • λ group: Using Optics to Take Group Data Delivery in the Datacenter to the Next Degree 

      Bergman, Keren; Ng, T. S. Eugene; Sripanidkulchai, Kunwadee; Wang, Howard; Xia, Yiting (2014-02-17)
      The increasing number of datacenter applications with heavy one-to-many communications has raised the need for an efficient group data delivery solution. This paper presents an unconventional clean-slate architecture called λ group that uses optical networking technologies to enable ultra-fast, energy-efficient, low cost, and highly reliable group ...