7,482 papers · page 325 of 375
Jens Palsberg, Michael I. Schwartzbach
We present a new approach to inferring types in untyped object-oriented programs with inheritance, assignments, and late binding.It guarantees that all messages are understood, annotates the program with type information, allows polymorphic methods, and can be used as the basis o…
David R. Reed, Marty Cagan, Theodore C. Goldstein, Barbara Moo
article Free Access Share on Issues in moving from C to C++ Authors: David R. Reed Saber Software Inc., Saber Software Inc.,View Profile , Marty Cagan Interactive Development Environments Interactive Development EnvironmentsView Profile , Ted Goldstein Sun Laboratories Sun Labora…
Ravi Sharma, Mary Lou Soffa
Sergui S. Simmel, Ivan Godard
Kala is an untyped persistent store for practical object-based systems, such as OODBMS, OMS, and object-oriented languages with persistence.Baskets are dynamic groupings of immutable data elements managed by Kala.Baskets synthesize transaction, configuration management, and acces…
Alan Snyder
No abstract available.
Michael R. Wilk
This paper presents a constraint-solving method that obeys the principle of object encapsulation.Under this method, constraints are translated into procedures for achieving constraint satisfaction.Neither the constraints nor their procedural translations refer directly to an obje…
Rahim Yaseen, Stanley Y. W. Su, Herman Lam
David Bernstein, Michael Rodeh
To improve the utilization of machine resources in superscalar processors, the instructions have to be carefully scheduled by the compiler.As internal parallelism and pipelining increases, it becomes evident that scheduling should be done beyond the basic block level.A scheme for…
Yves Bertot
We describe formal manipulations of programming language semantics that permit execution animation for interpreters. We first study the use of occurrences in the -calculus and we describe an implementation of the notion of residuals. We then describe applications in the developme…
Hans-Juergen Boehm, Alan J. Demers, Scott Shenker
We present a method for adapting garbage collectors designed to run sequentially with the client, so that they may run concurrently with it.We rely on virtual memory hardware to provide information about pages that have been updated or "dirtied" during a given period of time.This…
David G. Bradlee, Robert R. Henry, Susan J. Eggers
article Free Access Share on The Marion system for retargetable instruction scheduling Authors: David G. Bradlee Department of Computer Science and Engineering, FR-35, University of Washington, Seattle, Washington Department of Computer Science and Engineering, FR-35, University …
Mark Bromley, Steven Heller, Timothy S. McNerney, Guy L. Steele Jr.
We have implemented a prototype of a specialized compiler module and associated run-time support that allows a Fortran user to achieve sustained floatingpoint performance of over 10 gigaflops on the Connection Machine Model CM-2.This improves substantially over the previous recor…
David Callahan, Brian D. Koblenz
We present a graph coloring register allocator de-signed to minimize the number of dynamic memory references. We cover the program with sets of blocks called tiles and group these tiles into a tree reflecting the program’s hierarchical control structure. Registers are allocated f…
Robert Cartwright, Mike Fagan
of programs than ML.We have also developed an algorithm for frugally inserting run-time checks in programs that do not type check.
Siddhartha Chatterjee, Guy E. Blelloch, Allan L. Fisher
Abstract: "Data-parallel programming languages have many desirable features, such as single-thread semantics and the ability to express fine-grained parallelism. However, it is challenging to implement such languages efficiently on conventional MIMD multiprocessors, because these…
Charles Consel, Siau-Cheng Khoo
article Free Access Share on Parameterized partial evaluation Authors: Charles Consel Yale University, Department of Computer Science, New Haven, CT Yale University, Department of Computer Science, New Haven, CTView Profile , Siau Cheng Khoo Yale University, Department of Compute…
Timothy S. Freeman, Frank Pfenning
T$'e describe a refinement of ML's type system allowing the specification of recursively defined subtypes of user-defined datatypes.The resulting system of rejirzemeni f,ypes preserves desirable properties of ML such as decidability of type inference, while at the same time allow…
Peter Fritzson, Tibor Gyimóthy, Mariam Kamkar, Nahid Shahmehri
This paper presents a method for semi-automatic bug localization, generalized algorithmic debugging, which has been integrated with the category partition method for functional testing. In this way the efficiency of the algorithmic debugging method for bug localization can be imp…
Guang R. Gao, Yue-Bong Wong, Qi Ning
article Free Access Share on A timed Petri-net model for fine-grain loop scheduling Authors: Guang R. Gao School of Computer Science, McGill University, 3480 University, Montréal, Québec H3A 2A7 School of Computer Science, McGill University, 3480 University, Montréal, Québec H3A …
Gina Goff, Ken Kennedy, Chau-Wen Tseng
Precise and efficient dependence tests are essential to theeffectivermss ofaparallelizing compiler. This paper proposes a dependence testing scheme based on classi-fyingpairs ofsubscripted variable references. Exact yet fast dependence tests are presented for certain classes ofar…