Model-based reasoning: concurrent counting

An example verification program with concurrent counting: two threads that concurrently decrement a shared counter. The verification uses model-based abstraction/reasoning.

General Information

  • Backend: Silicon
  • Language: PVL
  • Features: Futures, Statically-scoped locking, Statically-scoped parallelism
  • Path to Example File: futures/counteradd_2.pvl
  • Should Verify: Yes
  • Date: 2017-06-19
  • Lines of Code: 46 (comments not included)
  • Lines of Specification: 13 (28.3% of total)
  • Computation Time: 27.9 seconds