1 citations · 3 across the 7 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2018
Fine-Grained Complexity of Safety Verification
Peter Chini, Roland Meyer, Prakash Saivasan
We study the fine-grained complexity of Leader Contributor Reachability (LCR) and Bounded-Stage Reachability (BSR), two variants of the safety verification problem for shared memor…
cs.LO2012
Model checking Branching-Time Properties of Multi-Pushdown Systems is Hard
Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar +1
We address the model checking problem for shared memory concurrent programs modeled as multi-pushdown systems. We consider here boolean programs with a finite number of threads and…