Procedures and invariants in the refinement calculus
| dc.contributor.author | Vickers, Trevor | en_US |
| dc.contributor.author | Morgan, Carroll | en_US |
| dc.date.accessioned | 2003-07-10 | en_US |
| dc.date.accessioned | 2004-05-19T12:54:57Z | en_US |
| dc.date.accessioned | 2011-01-05T08:37:29Z | |
| dc.date.available | 2004-05-19T12:54:57Z | en_US |
| dc.date.available | 2011-01-05T08:37:29Z | |
| dc.date.created | 1994 | en_US |
| dc.date.issued | 1994 | en_US |
| dc.description.abstract | Invariants allow a rigorous treatment of types as sets in the refinement calculus, a method for developing imperative programs. The interaction of procedures and invariants is explored, resulting in a practical formalisation of existing programming practice. | en_US |
| dc.format.extent | 177006 bytes | en_US |
| dc.format.extent | 356 bytes | en_US |
| dc.format.mimetype | application/pdf | en_US |
| dc.format.mimetype | application/octet-stream | en_US |
| dc.identifier.uri | http://hdl.handle.net/1885/40782 | en_US |
| dc.identifier.uri | http://digitalcollections.anu.edu.au/handle/1885/40782 | |
| dc.language.iso | en_AU | en_US |
| dc.subject | refinement calculus | en_US |
| dc.subject | imperative programs | en_US |
| dc.subject | invariant semantics | en_US |
| dc.subject | environment semantics | en_US |
| dc.title | Procedures and invariants in the refinement calculus | en_US |
| dc.type | Working/Technical Paper | en_US |
| local.citation | TR-CS-94-04 | en_US |
| local.contributor.affiliation | Department of Computer Science, FEIT | en_US |
| local.contributor.affiliation | ANU | en_US |
| local.description.refereed | no | en_US |
| local.identifier.citationmonth | may | en_US |
| local.identifier.citationyear | 1994 | en_US |
| local.identifier.eprintid | 1625 | en_US |
| local.rights.ispublished | yes | en_US |
Downloads
Original bundle
1 - 1 of 1