Probabilistic model checking #8
Open
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
…to a hardcoded csv file
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Overview
Implemented probabilistic model checking in harmony. It allows assertions in harmony code to check the probability of reaching a label from the beginning of execution.
Changes Made
--probabilisticflag enables probability assertionshyper_assert(<label>) <comparison op> <expr>statements added to assert/print reachability of label.hpofiles for harmony files if specified as an output, which shows all the probabilities of each assertion statement in the program.Test Coverage
Tested on an implementation of Knuth-Yao algorithm and several simulations of the Ben-Or algorithm, and verified the results.