Implementing incrementalization across object abstraction

Authors:
Michael Gorbovitski;Tom Rothamel;Yanhong A. Liu;Scott D. Stoller
Affiliations:
State Univ. of New York at Stony Brook, Stony Brook, NY;State Univ. of New York at Stony Brook, Stony Brook, NY;State Univ. of New York at Stony Brook, Stony Brook, NY;State Univ. of New York at Stony Brook, Stony Brook, NY
Venue:
OOPSLA '05 Companion to the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Year:
2005

Citing 3
Cited 0

Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Transformational Derivation of an Improved Alias Analysis Algorithm

Higher-Order and Symbolic Computation
Incrementalization across object abstraction

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We have implemented an interpreter (InvTS) for a declarative rule language (InvTL) supporting invariant-driven transformations of object-oriented programs. Using a library of rules, it can perform incrementalization across object abstractions, allowing the programmer to write clear, straightforward code while relying on InvTS to generate sophisticated and efficient implementations.