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

ID64
Articlenone
Back-endSilicon
LanguagePVL
FeaturesFutures, Statically-scoped locking, Statically-scoped parallelism
Sources
Path to example filefutures/counteradd_2.pvl
Date2017-06-19

Statistical information

Lines of code46 lines (comments not included)
Lines of specification13 lines (28.26% of the total)
Computation time27905 milliseconds

Example code

Note, verification may take a while and has a time-out of 20 seconds.