Implementing verification of concurrent systems using Binary Decision Diagrams
Verification of programs through the use of formal methods have become popular as it can guarantee the programs correct. Concurrent programs have always been hard to test because of the nature of the program, as these programs are used in many branches of the software industry formal methods to prov...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
Uppsala universitet, Institutionen för informationsteknologi
2012
|
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-181783 |
| Summary: | Verification of programs through the use of formal methods have become popular as it can guarantee the programs correct. Concurrent programs have always been hard to test because of the nature of the program, as these programs are used in many branches of the software industry formal methods to prove these programs correct have been developed. In this report one of these methods are first described and then implemented using Binary Decision Diagrams to see if this would lead to an optimization of the current implementation of the method. |
|---|