Relational interprocedural verification of concurrent programs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Relational interprocedural verification of concurrent programs

Abstract

We propose a general analysis method for recursive, concurrent programs that tracks effectively procedure calls and returns in a concurrent context, even in the presence of unbounded recursion and infinite-state variables like integers. This method generalizes the relational interprocedural analysis of sequential programs to the concurrent case. We implemented it for programs with scalar variables, and we experimented several classical synchronisation protocols in order to illustrate the precision of our technique, but also to analyze the approximations it performs.
No file

Dates and versions

hal-00786350 , version 1 (08-02-2013)

Identifiers

Cite

Bertrand Jeannet. Relational interprocedural verification of concurrent programs. Software Engineering and Formal Methods, SEFM'09, Nov 2009, Hanoi, Vietnam. ⟨10.1109/SEFM.2009.29⟩. ⟨hal-00786350⟩
62 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More