Compile-Time Analysis and Specialization of Clocks in Concurrent Programs
Abstract elided by the publisher.
Related papers
- May-happen-in-parallel analysis with static vector clocks CGO 2018
- Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks CAV 2001
- GoFree: Reducing Garbage Collection via Compiler-Inserted Freeing CGO 2025
- Efficient Timed Reachability Analysis Using Clock Difference Diagrams CAV 1999
- Deterministic Concurrency: A Clock-Synchronised Shared Memory Approach ESOP 2018
- Cloaca: A Concurrent Hardware Garbage Collector for Non-strict Functional Languages Haskell 2024
- Specialization of CML message-passing primitives POPL 2007
- Clock Bound Repair for Timed Systems CAV 2019