Using Disjoint Reachability for Parallelization
No abstract available.
Related papers
- Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests POPL 2015
- A wait-free NCAS library for parallel applications with timing constraints PPoPP 2011
- Achieving Scalability in Parallel Reachability Analysis of Very Large Circuits CAV 2000
- Competitive parallelism: getting your priorities right ICFP 2018
- Huron: hybrid false sharing detection and repair PLDI 2019
- Disjoint Polymorphism ESOP 2017
- Union Types with Disjoint Switches ECOOP 2022
- A Discipline for Program Verification Based on Backpointers and Its Use in Observational Disjointness ESOP 2013