Towards Concurrent Hoare Logic
| dc.contributor.author | Candy, Robin | |
| dc.date.accessioned | 2017-12-05T03:04:06Z | |
| dc.date.available | 2017-12-05T03:04:06Z | |
| dc.date.issued | 2012 | en |
| dc.description.abstract | How can we rigorously prove that an algorithm does what we think it does? Logically verifying programs is very important to industry. Floyd-Hoare Logic (or Hoare Logic for short) is a set of rules that describe a type of valid reasoning for sequential program verification. Many different attempts have been made to extend Hoare Logic for concurrent program verification. We combine ideas from a few of these extensions to formalise a verification framework for specific classes of parallel programs. A new proof rule to deal with the semantics of mesh algorithms is proposed within the verification framework. We use the framework and mesh proof rule to verify the correctness of Sung Bae’s parallel algorithm for the maximum subarray problem. | en |
| dc.identifier.uri | http://hdl.handle.net/10092/14861 | |
| dc.identifier.uri | http://dx.doi.org/10.26021/2265 | |
| dc.language | English | |
| dc.language.iso | en | |
| dc.publisher | University of Canterbury | en |
| dc.rights | All Right Reserved | en |
| dc.rights.uri | https://canterbury.libguides.com/rights/theses | en |
| dc.title | Towards Concurrent Hoare Logic | en |
| dc.type | Theses / Dissertations | en |
| thesis.degree.grantor | University of Canterbury | en |
| thesis.degree.level | Doctoral | en |
| thesis.degree.name | Other | en |
| uc.college | Faculty of Engineering | en |