Stephen Magill, Michael Hicks, Suriya Subramaniam, and Kathryn S. McKinley
Dynamic software updating (DSU) systems eliminate costly downtime by dynamically ﬁxing bugs and adding features to executing programs. Given a static code patch, most DSU systems construct runtime code changes automatically. However, a dynamic update must also specify how to change the running program’s execution state, e.g., the stack and heap, to make it compatible with the new code. Constructing such state transformations correctly and automatically remains an open problem. This paper presents a solution called Targeted Object Synthesis (TOS). TOS ﬁrst executes the same tests on the old and new program versions separately, observing the program heap state at a few corresponding points. Given two corresponding heap states, TOS matches objects in the two versions using key ﬁelds that uniquely identify objects and correlate old and new-version objects. Given example object pairs, TOS then synthesizes the simplest possible function that transforms an old-version object to its new-version counterpart. We show that TOS is effective on updates to four open-source server programs for which it generates non-trivial transformation functions that use conditionals, operate on collections, and ﬁx memory leaks. These transformations help programmers understand their changes and apply dynamic software updates.
Publisher ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA)