Efficiently Generating Structurally Complex Inputs with Thousands of Objects
Abstract elided by the publisher.
Related papers
- SPEED: precise and efficient static estimation of program computational complexity POPL 2009
- Fast algorithm for creating space efficient dispatching tables with application to multi-dispatching OOPSLA 2002
- Traversals of object structures: Specification and Efficient Implementation TOPLAS 2004
- How Many Quantum Circuit Identities Are Needed to Generate All Others? CAV 2026
- Efficient dynamic dispatching with type slicing TOPLAS 2007
- Data Specialization PLDI 1996
- pC++/streams: a Library for I/O on Complex Distributed Data Structures PPoPP 1995
- Chain of Grounded Objectives: Concise Goal-Oriented Prompting for Code Generation ECOOP 2025