Status of Object-Oriented COBOL (Panel)
No abstract available.
7,482 papers · page 315 of 375
IRIS Inventor, A 3D Graphics Toolkit
IRIS@ InventorTM is an object-oriented toolkit for developers of applications that incorporate interactive, threedimensional graphics.Encapsulation of data and methods in high-level graphical objects allows Inventor to provide a significant improvement in usability to developers,…
Ada 9X: From Abstraction-Oriented to Object-Oriented
article Ada 9X: from abstraction-oriented to object-oriented Share on Author: S. Tucker Taft View Profile Authors Info & Claims ACM SIGPLAN NoticesVolume 28Issue 10Oct. 1, 1993 pp 127–136https://doi.org/10.1145/167962.165877Online:01 October 1993Publication History 15citation278D…
A Discussion of "On the Purpose of Object-Oriented Analysis" (Panel)
Article Free Access Share on A discussion of On the Purpose of Object-Oriented Analysis Authors: Dave Thomas Object Technology International Object Technology InternationalView Profile , Adele Goldberg ParcPlace Systems ParcPlace SystemsView Profile , James Coplien Bell Labs Bell…
Integrating Object-Oriented Technolgy and Security Technology: A Panel Discussion
No abstract available.
Modeling Security Requirements for Applications (Panel)
No abstract available.
First-Class Data-Type Representations in SchemeXerox
In most programming language implementations, the compiler has detailed knowledge of the representations of and operations on primitive data typed and data-type constructors. In SCHEMEXEROX, this knowledge is almost entirely external to the compiler, in ordinary, procedural user …
Detection and Recovery of Endangered Variables Caused by Instruction Scheduling
Instruction scheduling re-orders and interleaves instruction sequences from different source statements. This impacts the task of a symbolic debugger, which attempts to present the user a picture of program execution that matches the source program. At a breakpoint B, if the valu…
Communication Optimization and Code Generation for Distributed Memory Machines
This paper presents several algorithms to solve code generation and optimization problems specific to machines with distributed address spaces. Given a description of how the computation is to be partitioned across the processors in a machine, our algorithms produce an SPMD (sing…
Global Optimizations for Parallelism and Locality on Scalable Parallel Machines
Data locality is critical to achieving high performance on large-scale parallel machines. Non-local data accesses result in communication that can greatly impact performance. Thus the mapping, or decomposition, of the computation and data onto the processors of a scalable paralle…
Branch Prediction For Free
Many compilers rely on branch prediction to improve program performance by identifying frequently executed regions and by aiding in scheduling instructions.Profile-based predictors require a time-consuming and inconvenient compile-profile-compile cycle in order to make prediction…
Using Lifetime Predictors to Improve Memory Allocation Performance
Dynamic storage allocation is used heavily in many application areas including interpreters, simulators, optimizers, and translators. We describe research that can improve all aspects of the performance of dynamic storage allocation by predicting the lifetimes of short-lived obje…
Space Efficient Conservative Garbage Collection
We call a garbage collector conservative if it has only partial information about the location of pointers, and is thus forced to treat arbitrary bit patterns as though they might be pointers, in at least some cases. We show that some very inexpensive, but previously unused techn…
Abstract Debugging of Higher-Order Imperative Languages
Abstract interpretation is a formal method that enables the static determination (i.e. at compile-time) of the dynamic properties (i.e. at run-time) of programs. We present an abstract interpretation-based method, called abstract debugging, which enables the static and formal deb…
Isolation and Analysis of Optimization Errors
This paper describes two related tools developed to support the isolation and analysis of optimization errors in the vpo optimizer.Both tools rely on vpo identifying sequences of changes, referred to as transformations, that result in semantically equivalent (and usuaUy improved)…
Efficient Accomodation of May-Alias Information in SSA Form
We present an algorithm for incrementally including may-alias information into Static Single Assignment form by computing a sequence of increasingly precise (and correspondingly larger) partial SSA forms. Our experiments show significant speedup of our method over exhaustive use …
A Practical Data Flow Framework for Array Reference Analysis and its Use in Optimizations
Data flow analysis techniques have traditionally been restricted to the analysis of scalar variables. This retriction, however, imposes a limitation on the kinds of optimizations that can be performed in loops containing array references. We present a data flow framework for arra…
Guardians in a Generation-Based Garbage Collector
This paper describes a new language feature that allows dynamically allocated objects to be saved from deallocation by an automatic storage management system so that clean-up or other actions can be performed using the data stored within the objects. The program has full control …
The Essence of Compiling with Continuations
In order to simplify the compilation process, many compilers for higher-order languages use the continuation-passing style (CPS) transformation in a first phase to generate an intermediate representation of the source program. The salient aspect of this intermediate form is that …
Orchestrating Interactions Among Parallel Computations
Many parallel programs contain multiple sub-computations, each with distinct communication and load balancing requirements. The traditional approach to compiling such programs is to impose a processor synchronization barrier between sub-computations, optimizing each as a separate…