Computer Aided Verification

Volume 5123 of the series Lecture Notes in Computer Science pp 149-161

Local Proofs for Linear-Time Properties of Concurrent Programs

  • Ariel CohenAffiliated withNew York University
  • , Kedar S. NamjoshiAffiliated withBell Labs, Alcatel-Lucent

* Final gross prices may vary according to local VAT.

Get Access


This paper develops a local reasoning method to check linear-time temporal properties of concurrent programs. In practice, it is often infeasible to model check over the product state space of a concurrent program. The method developed in this paper replaces such global reasoning with checks of (abstracted) individual processes. An automatic refinement step gradually exposes local state if necessary, ensuring that the method is complete. Experiments show that local reasoning can hold a significant advantage over global reasoning.