A Fresh Look at PRE as a Maximum Flow Problem
No abstract available.
Related papers
- Structural Information Flow: A Fresh Look at Types for Non-interference OOPSLA 2025
- A Fresh Look at Optimizing Array Bound Checking PLDI 1990
- A Fresh Look at Commutativity: Free Algebraic Structures via Fresh Lists APLAS 2023
- Objects - A Fresh Look ECOOP 1989
- Feature-Oriented Programming: A Fresh Look at Objects ECOOP 1997
- A Fresh Look at Separation Algebras and Share Accounting APLAS 2009
- A fresh look at programming with names and binders ICFP 2010
- A Fresh Look at Combinator Graph Reduction PLDI 1989