« Two papers to read from SPIN 2005 | Main | Lecture notes. »
August 26, 2005
A quick run through symbolic representations
The lecture on 8/29 will consist of a quick run through the process of translating a program statement into a boolean formula. Then we will go over the process of translating a boolean formula that represents a transition into a BDD. This will help you finish your symbolic Bogor projects.
The reading for this lecture is in Model Checking by Clarke et al.
- section 2.2.2 (page 20)
- section 2.2.3 (page 22)
- section 2.3 (page 24) wouldn't hurt either.
- Chapter 5 (page 51)
Posted by jones at August 26, 2005 03:23 PM
Comments
Post a comment
Thanks for signing in, . Now you can comment. (sign out)
(If you haven't left a comment here before, you may need to be approved by the site owner before your comment will appear. Until then, it won't appear on the entry. Thanks for waiting.)