II. Partial Orders

Computer-Aided Verification

Volume 531 of the series Lecture Notes in Computer Science pp 176-185


Using partial orders to improve automatic verification methods

  • Patrice GodefroidAffiliated withInstitut Montefiore, Université de Liège

* Final gross prices may vary according to local VAT.

Get Access


In this paper, we present a verification method for concurrent finite-state systems that attempts to avoid the part of the combinatorial explosion due to the modeling of concurrency by interleavings. The behavior of a system is described in terms of partial orders (more precisely in terms of Mazurkiewicz's traces) rather than in terms of interleavings. We introduce the notion of “trace automation” which generates only one linearization per partial order. Then we show how to use trace automata to prove program correctness.