Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Formal methods
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===Binary decision diagrams=== {{Main|Binary decision diagram}} A binary decision diagram is a data structure that represents a [[Boolean function]].<ref>{{cite book|last=Bryant|first=Randal E.|chapter=Binary Decision Diagrams|title=Handbook of Model Checking|date=2018|editor1-last=Clarke|editor1-first=Edmund M.|editor2-last=Henzinger|editor2-first=Thomas A.|editor3-last=Veith|editor3-first=Helmut|editor4-last=Bloem|editor4-first=Roderick|page=191}}</ref> If a Boolean formula <math>\mathcal{P}</math> expresses that an execution of a program conforms to the specification, a binary decision diagram can be used to determine if <math>\mathcal{P}</math> is a tautology; that is, it always evaluates to TRUE. If this is the case, then the program always conforms to the specification.<ref>{{cite book|last1=Chaki|first1=Sagar|last2=Gurfinkel|first2=Arie|chapter=BDD-Based Symbolic Model Checking|title=Handbook of Model Checking|date=2018|editor1-last=Clarke|editor1-first=Edmund M.|editor2-last=Henzinger|editor2-first=Thomas A.|editor3-last=Veith|editor3-first=Helmut|editor4-last=Bloem|editor4-first=Roderick|page=191}}</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)