Finite-state concurrent programs can be expressed pairwise


We present a pairwise normal form for finite-state shared memory concurrent programs: all variables are shared between exactly two processes, and the guards on transitions are conjunctions of conditions over this pairwise shared state. This representation has been used to efficiently (in polynomial time) synthesize and model-check correctness properties of… (More)


1 Figure or Table

Slides referencing similar topics