salle A. Turing CE4
15 October 2014 - 14h00
Proof Spaces for Unbounded Parallelism
by Andreas Podelski from University of Freiburg
Abstract: We present a proof system which can be used to exploit sequential verification technology for proving the correctness of multi-threaded programs with unboundedly many threads. The corresponding verification method can leverage the techniques of well-structured transition systems. The proof system is complete relative to more traditional proof systems for multi-threaded programs which allow features like thread quantification and control predicates.
Joint work with Azadeh Farzan and Zachary Kincaid.
