Sifting out the gold: delivering compact applications from an exploratory object-oriented programming environment

Authors:
Ole Agesen;David Ungar
Affiliations:
Computer Science Department, Stanford University, Stanford, CA;Sun Microsystems Laboratories, 2550 Garcia Ave, Mountain View, CA
Venue:
OOPSLA '94 Proceedings of the ninth annual conference on Object-oriented programming systems, language, and applications
Year:
1994

Citing 11
Cited 22

Self: The power of simplicity

OOPSLA '87 Conference proceedings on Object-oriented programming systems, languages and applications
Making pure object-oriented languages practical

OOPSLA '91 Conference proceedings on Object-oriented programming systems, languages, and applications
Multi-way versus one-way constraints in user interfaces: experience with the DeltaBlue algorithm

Software—Practice & Experience
Unreachable procedures in object-oriented programming

ACM Letters on Programming Languages and Systems (LOPLAS)
Building common Lisp applications with reasonable performance

LUV '93 Proceedings of the third international conference on Lisp users and vendors
Object-oriented type systems

Object-oriented type systems
Optimizing dynamically-dispatched calls with run-time type feedback

PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
A type declaration and inference system for smalltalk

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type Inference of SELF

ECOOP '93 Proceedings of the 7th European Conference on Object-Oriented Programming
Efficient implementation of the smalltalk-80 system

POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Incremental inference of concrete types

Incremental inference of concrete types

Type feedback vs. concrete type inference: a comparison of optimization techniques for object-oriented languages

Proceedings of the tenth annual conference on Object-oriented programming systems, languages, and applications
Slicing class hierarchies in C++

Proceedings of the 11th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Class hierarchy specialization

Proceedings of the 12th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
A study of dead data members in C++ applications

PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Reengineering class hierarchies using concept analysis

SIGSOFT '98/FSE-6 Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering
Practical experience with an application extractor for Java

Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Understanding class hierarchies using concept analysis

ACM Transactions on Programming Languages and Systems (TOPLAS)
Extracting library-based object-oriented applications

SIGSOFT '00/FSE-8 Proceedings of the 8th ACM SIGSOFT international symposium on Foundations of software engineering: twenty-first century applications
Combining Global Code and Data Compaction

OM '01 Proceedings of the 2001 ACM SIGPLAN workshop on Optimization of middleware and distributed systems
Sifting out the mud: low level C++ code reuse

OOPSLA '02 Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Practical extraction techniques for Java

ACM Transactions on Programming Languages and Systems (TOPLAS)
The Cartesian Product Algorithm: Simple and Precise Type Inference Of Parametric Polymorphism

ECOOP '95 Proceedings of the 9th European Conference on Object-Oriented Programming
Extracting library-based Java applications

Communications of the ACM - Program compaction
An introduction to fly: a smaller smalltalk

OOPSLA '03 Companion of the 18th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
From Polyvariant flow information to intersection and union types

Journal of Functional Programming
Link-time binary rewriting techniques for program compaction

ACM Transactions on Programming Languages and Systems (TOPLAS)
Constructing a metacircular Virtual machine in an exploratory programming environment

OOPSLA '05 Companion to the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Self

Proceedings of the third ACM SIGPLAN conference on History of programming languages
The when, why and why not of the BETA programming language

Proceedings of the third ACM SIGPLAN conference on History of programming languages
Parcels: A fast and feature-rich binary deployment technology

Computer Languages, Systems and Structures
Type harvesting: a practical approach to obtaining typing information in dynamic programming languages

Proceedings of the 2011 ACM Symposium on Applied Computing
Efficient construction of approximate call graphs for JavaScript IDE services

Proceedings of the 2013 International Conference on Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Integrated, dynamically-typed object-oriented programming environments offer many advantages, but have trouble producing small, self-contained applications. Recent advances in type inference have made it possible to build an application extractor for Self. The extractor was able to extract a medium-sized application in a few minutes. The extracted application runs in a tenth the space of the original environment. Except for extracting reflection and sends with computed selectors, the extractor runs without human intervention and fully preserves the behavior of the application.