Fine-Grain Conjunction Scheduling for Symbolic Reachability Analysis
Abstract elided by the publisher.
Related papers
- The Fine-Grained Complexity of CFL Reachability POPL 2023
- A Timed Petri-Net Model for Fine-Grain Loop Scheduling PLDI 1991
- Evaluating the Locality Benefits of Active Messages PPoPP 1995
- Caper - Automatic Verification for Fine-Grained Concurrency ESOP 2017
- Context-sensitive data-dependence analysis via linear conjunctive language reachability POPL 2017
- Atomic Heap Transactions and Fine-grain Interrupts ICFP 1999
- A scheduling framework for general-purpose parallel languages ICFP 2008
- Experience with CST: Programming and Implementation PLDI 1989