Programming with enumerable sets of structures
Name
Programming with Enumerable Sets of Structures.pdf
Size
683.11 KB
Format
Adobe PDF
Checksum (MD5)
db2d6b7380d8282507810cd1ed266825
Author(s)
Kuraj, Ivan
Kuncak, Viktor
Jackson, Daniel
Date Issued
October 2015
Journal
Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications - OOPSLA 2015
Publisher
Association for Computing Machinery
Citation
Kuraj, Ivan, Viktor Kuncak, and Daniel Jackson. "Programming with Enumerable Sets of Structures." OOPSLA 2015 Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, 25-30 October, 2015, Pittsburgh, Pennsylvania, ACM Press, 2015, pp. 37–56.
Version
Author's final manuscript
Abstract
We present an efficient, modular, and feature-rich framework for automated generation and validation of complex structures, suitable for tasks that explore a large space of structured values. Our framework is capable of exhaustive, incremental, parallel, and memoized enumeration from not only finite but also infinite domains, while providing fine-grained control over the process. Furthermore, the framework efficiently supports the inverse of enumeration (checking whether a structure can be generated and fast-forwarding to this structure to continue the enumeration) and lazy enumeration (achieving exhaustive testing without generating all structures). The foundation of efficient enumeration lies in both direct access to encoded structures, achieved with well-known and new pairing functions, and dependent enumeration, which embeds constraints into the enumeration to avoid backtracking. Our framework defines an algebra of enumerators, with combinators for their composition that preserve exhaustiveness and efficiency. We have implemented our framework as a domain-specific language in Scala. Our experiments demonstrate better performance and shorter specifications by up to a few orders of magnitude compared to existing approaches.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/2814270.2814323
