Proof Spaces for Unbounded Parallelism

8 years 1 days ago

Download www.cs.toronto.edu

In this paper, we present a new approach to automatically verify multi-threaded programs which are executed by an unbounded number of threads running in parallel. The starting point for our work is the problem of how we can leverage existing automated veriﬁcation technology for sequential (abstract interpretation, Craig interpolation, constraint solving, etc.) for multi-threaded programs. Suppose that we are given a correctness proof for a trace of a program (or for some other program fragment). We observe that the proof can always be decomposed into a ﬁnite set of Hoare triples, and we ask what can be proved from the ﬁnite set of Hoare triples using only simple combinatorial inference rules (without access to a theorem prover and without the possibility to infer genuinely new Hoare triples)? We introduce a proof system where one proves the correctness of a multi-threaded program by showing that for each trace of the program, there exists a correctness proof in the space of proo...

Azadeh Farzan, Zachary Kincaid, Andreas Podelski

Real-time Traffic