Decomposing Non-redundant Sharing by Complementation
No abstract available.
Related papers
- Complementation in Abstract Interpretation TOPLAS 1997
- Annotations for Distributed Programming in Logic POPL 1986
- Kofola 1.0: A Modular Approach to ømega-Regular Complementation and Inclusion Checking CAV 2026
- Class hierarchy complementation: soundly completing a partial type graph OOPSLA 2013
- Set-Sharing is Redundant for Pair-Sharing SAS 1997
- Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints TACAS 2009
- SemCache++: semantics-aware caching for efficient multi-GPU offloading PPoPP 2015
- Eliminating Redundancy: Ultra-compact Code Generation for Programmable Dataflow Accelerators CGO 2026