Static extraction of sound hierarchical runtime object graphs

For many object-oriented systems, it is often useful to have a runtime architecture that shows networks of communicating objects. But it is hard to statically extract runtime object graphs that provide tural abstraction from existing programs written in general purpose languages, and that follow common design idioms. Previous approaches extract low-level non-hierarchical object graphs that do not provide architectural abstraction, change the language too radically for many existing implementations, or use a dynamic analysis. Static analysis, which takes all possible executions into account, is essential to extract a sound architecture, one that reveals all objects and relations that could possibly exist at runtime. Ownership domain type annotations specify in code architectural intent related to object encapsulation and communication. We propose a static analysis that leverages such types and extracts a hierarchical approximation of all possible runtime object graphs. The tation provi...

• Type: Conference
• Year: 2009
• Where: TLDI
• Authors: Marwan Abi-Antoun, Jonathan Aldrich
• Keywords: Formal Methods, Non-hierarchical Object Graphs, Possible Runtime Object, Runtime Object Graphs, TLDI 2009