An Incremental Algorithm for Satisfying Hierarchies of Multi-way, Dataflow Constraints (1995)
| Venue: | ACM Transactions on Programming Languages and Systems |
| Citations: | 44 - 1 self |
BibTeX
@ARTICLE{Zanden95anincremental,
author = {Brad Vander Zanden},
title = {An Incremental Algorithm for Satisfying Hierarchies of Multi-way, Dataflow Constraints},
journal = {ACM Transactions on Programming Languages and Systems},
year = {1995},
volume = {18},
pages = {30--72}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
One-way dataflow constraints have gained popularity in many types of interactive systems because of their simplicity, efficiency, and manageability. Although it is widely acknowledged that multi-way dataflow constraints could make it easier to specify certain relationships in these applications, concerns about their predictability and efficiency have impeded their acceptance. Constraint hierarchies have been developed to address the predictability problem and incremental algorithms have been developed to address the efficiency problem. However, existing incremental algorithms for satisfying constraint hierarchies encounter two difficulties: (1) they are incapable of guaranteeing an acyclic solution if a constraint hierarchy has one or more cyclic solutions, and (2) they require worst-case exponential time to satisfy systems of multi-output constraints. This paper surmounts these difficulties by presenting an 2 incremental algorithm called QuickPlan that satisfies in worst case O(N ) ...
