Synthesizing Iterators from Abstraction Functions
A technique for synthesizing iterators from declarative abstraction functions written in a relational logic specification language is described. The logic includes a transitive closure operator that makes it convenient for expressing reachability queries on linked data structures. Some optimizations...
Main Authors: | Rayside, Derek (Author), Motaghami, Vajihollah (Author), Leung, Francesca (Author), Yuen, Albert (Author), Xu, Kevin (Author), Jackson, Daniel (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Association for Computing Machinery (ACM),
2014-05-19T19:56:13Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Automating abstraction functions
by: Rayside, Derek F
Published: (2011) -
Equality and Hashing for (almost) Free: Generating Implementations from Abstraction Functions
by: Rayside, Derek, et al.
Published: (2010) -
Iterative Convergence with Banach Space Valued Functions in Abstract Fractional Calculus
by: Anastassiou George A., et al.
Published: (2017-12-01) -
Unifying Execution of Imperative and Declarative Code
by: Milicevic, Aleksandar, et al.
Published: (2012) -
Agile specifications
by: Rayside, Derek, et al.
Published: (2011)