Model-based reasoning: unequal counting

A variant on the verification example of concurrent counting: two threads that concurrently decrement a shared value, but with unequal amounts.

General Information

  • Backend: Silicon
  • Language: PVL
  • Features: Fork/join concurrency, Statically-scoped locking, Statically-scoped parallelism
  • Path to Example File: futures/unequalcounting.pvl
  • Should Verify: Yes
  • Date: 2017-06-19
  • Lines of Code: 52 (comments not included)
  • Lines of Specification: 19 (36.5% of total)
  • Computation Time: 19.9 seconds