Incrementalization across object abstraction
نویسندگان
چکیده
منابع مشابه
Communication Across Levels of Abstraction
ion, this results in an inherent asymmetry of upward vs. downward events. The properties of downward events described in the previous section do not hold for upward events; in fact the properties of upward events are essentially complementary to those of downward events: 1. Upward events need not be yielding. While the simple formulation of Handler in Section 2 does cause the lower level to yie...
متن کاملPreserving Consistency Across Abstraction Mappings
An abstraction mapping over clausal form theories in first-order predicate calculus is presented that involves the renaming of predicate symbols. This renaming is not 1-1, in the sense that several predicate symbols Ri,.. . , Rn from the original theory are all replaced by a single symbol R in the abstract theory. In order to preserve consistency, however, the clauses that distinguish the Rj's ...
متن کاملIncrementalization of Static Analyses
Modern development environments integrate various static analyses into the build process. Analyses that require the analysis of the whole project whenever the project changes are impractical in this context. Manual incrementalization is elaborate, in particular if the set of analyses is supposed to be extensible. We present an approach to automatic incrementalization of analyses that are specif...
متن کاملDynamic Programming via Static Incrementalization
Dynamic programming is an important algorithm design technique. It is used for solving problems whose solutions involve recursively solving subproblems that share subsubproblems. While a straightforward recursive program solves common subsubproblems repeatedly and often takes exponential time, a dynamic programming algorithm solves every subsubproblem just once, saves the result, reuses it when...
متن کاملIncrementalization: From Clarity to Efficiency
Incrementalization is at the core of a systematic program design method, especially for the design of algorithms and data structures. It takes a function and an input change operation and yields an incremental function that computes each new output by using the old output and additional values. It is the analogue of differentiation in continuous domains. This article gives an overview of a syst...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2005
ISSN: 0362-1340,1558-1160
DOI: 10.1145/1103845.1094848