Object Graph Programming
<|reference_start|>Object Graph Programming: We introduce Object Graph Programming (OGO), which enables reading and modifying an object graph (i.e., the entire state of the object heap) via declarative queries. OGO models the objects and their relations in the heap as an object graph thereby treating the heap as a graph database: each node in the graph is an object (e.g., an instance of a class or an instance of a metadata class) and each edge is a relation between objects (e.g., a field of one object references another object). We leverage Cypher, the most popular query language for graph databases, as OGO's query language. Unlike LINQ, which uses collections (e.g., List) as a source of data, OGO views the entire object graph as a single "collection". OGO is ideal for querying collections (just like LINQ), introspecting the runtime system state (e.g., finding all instances of a given class or accessing fields via reflection), and writing assertions that have access to the entire program state. We prototyped OGO for Java in two ways: (a) by translating an object graph into a Neo4j database on which we run Cypher queries, and (b) by implementing our own in-memory graph query engine that directly queries the object heap. We used OGO to rewrite hundreds of statements in large open-source projects into OGO queries. We report our experience and performance of our prototypes.<|reference_end|>
@article{thimmaiah2024object,
    title={Object Graph Programming},
    author={Aditya Thimmaiah, Leonidas Lampropoulos, Christopher J. Rossbach and
  Milos Gligoric},
    journal={arXiv preprint arXiv:2402.02642},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.02642},
    primaryClass={cs.SE cs.DB cs.PL}
}