Programming with enumerable sets of structures
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...
Main Authors: | Kuraj, Ivan (Contributor), Kuncak, Viktor (Author), Jackson, Daniel (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Association for Computing Machinery,
2018-06-06T13:49:31Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Exploring the role of sequential computation in distributed systems: motivating a programming paradigm shift
by: Kuraj, Ivan, et al.
Published: (2018) -
A Verified Program for the Enumeration of All Maximal Independent Sets
by: Merten, Samuel A.
Published: (2016) -
Modular data structure verification
by: Kuncak, Viktor (Viktor Jaroslav), 1977-
Published: (2007) -
Enumerating digitally convex sets in graphs
by: Carr, MacKenzie
Published: (2020) -
Decomposition and enumeration in partially ordered sets
by: Hersh, Patricia (Patricia Lynn), 1973-
Published: (2014)