μ-Chart-based specification and refinement

Simple item page
dc.contributor.authorGoldson, Doug
dc.contributor.authorReeve, Greg
dc.contributor.authorReeves, Steve
dc.coverage.spatialConference held at Shanghai, Chinaen_NZ
dc.date.accessioned2008-12-04T21:57:30Z
dc.date.available2008-12-04T21:57:30Z
dc.date.issued2002
dc.description.abstractWe introduce two new notions of refinement for μ-charts and compare them with the existing notion due to Scholz. The two notions are interesting and important because one gives rise (via a logic) to a calculus for constructing refinements and the other gives rise (via model checking) to a way of checking that refinements hold. Thus we bring together the two competing worlds of model checking and proof.en_US
dc.identifier.citationGoldson, D., Reeve, G. & Reeves, S. (2002). μ-Chart-based specification and refinement. In C. George & H. Miao (Eds.), Proceedings of 4th International Conference on Formal Engineering Methods, ICFEM 2002 Shanghai, China, October 21–25, 2002. (pp. 323-334).en_US
dc.identifier.doi10.1007/3-540-36103-0_34en_US
dc.identifier.urihttps://hdl.handle.net/10289/1530
dc.language.isoen
dc.publisherSpringer, Berlinen_US
dc.relation.isPartOfFormal Methods and Software Engineering: 4th International Conference on Formal Engineering Methodsen_NZ
dc.relation.urihttp://www.springerlink.com/content/4a565her4xeq1r11/en_US
dc.sourceICFEM 2002en_NZ
dc.subjectcomputer scienceen_US
dc.subjectZen_US
dc.titleμ-Chart-based specification and refinementen_US
dc.typeConference Contributionen_US
pubs.begin-page323en_NZ
pubs.elements-id11994
pubs.end-page334en_NZ
pubs.finish-date2002-10-25en_NZ
pubs.place-of-publicationLondonen_NZ
pubs.start-date2002-10-21en_NZ
pubs.volumeLNCS 2495en_NZ
Files
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.79 KB
Format:
Item-specific license agreed upon to submission
Description:
Name: license.txt
Size: 1.79 KB
Kind: License
Collections
Computing and Mathematical Sciences Papers