Unifying theories of programming that distinguish nontermination and abort

Hdl Handle:
http://hdl.handle.net/10149/125145
Title:
Unifying theories of programming that distinguish nontermination and abort
Book Title:
Mathematics of programme construction
Authors:
Hayes, I. J. (Ian); Dunne, S. E. (Steve); Meinicke, L. (Larissa)
Editors:
Bolduc, C. (Claude); Desharnais, J. (Jules); Ktari, B. (Béchir)
Affiliation:
University of Teesside. School of Computing.
Citation:
Hayes, I. J., Dunne, S. E. and Meinicke, L. (2010) 'Unifying theories of programming that distinguish nontermination and abort', Mathematics of Program Construction 10th International Conference, MPC 2010, Québec City, Canada, June 21-23, 2010, in Bolduc, C., Desharnais, J. and Ktari, B. (eds) Mathematics of programme construction. Berlin: Springer-Verlag, pp.178-194.
Publisher:
Springer-Verlag
Conference:
Mathematics of Program Construction 10th International Conference, MPC 2010, Québec City, Canada, June 21-23, 2010
Issue Date:
2010
URI:
http://hdl.handle.net/10149/125145
DOI:
10.1007/978-3-642-13321-3
Additional Links:
http://www.springerlink.com/content/978-3-642-13320-6/#section=723890&page=1&locus=3
Type:
Meetings and Proceedings; Book Chapter
Language:
en
Keywords:
specification models; unifying thories of programming; Hoare and He; programme termination; nontermination; enabling conditions
Series/Report no.:
Lecture note in computer science; 6120
ISBN:
9783642133206
Rights:
Author can archive post-print (ie final draft post-refereeing). For full details see http://www.sherpa.ac.uk/romeo/ [Accessed 21/03/2011]
Citation Count:
1 [Web of Science, 21/03/2011]

Full metadata record

DC FieldValue Language
dc.contributor.authorHayes, I. J. (Ian)en
dc.contributor.authorDunne, S. E. (Steve)en
dc.contributor.authorMeinicke, L. (Larissa)en
dc.contributor.editorBolduc, C. (Claude)en
dc.contributor.editorDesharnais, J. (Jules)en
dc.contributor.editorKtari, B. (Béchir)en
dc.date.accessioned2011-03-21T09:26:09Z-
dc.date.available2011-03-21T09:26:09Z-
dc.date.issued2010-
dc.identifier.isbn9783642133206-
dc.identifier.doi10.1007/978-3-642-13321-3-
dc.identifier.urihttp://hdl.handle.net/10149/125145-
dc.language.isoenen
dc.publisherSpringer-Verlagen
dc.relation.ispartofseriesLecture note in computer scienceen
dc.relation.ispartofseries6120en
dc.relation.urlhttp://www.springerlink.com/content/978-3-642-13320-6/#section=723890&page=1&locus=3en
dc.rightsAuthor can archive post-print (ie final draft post-refereeing). For full details see http://www.sherpa.ac.uk/romeo/ [Accessed 21/03/2011]en
dc.subjectspecification modelsen
dc.subjectunifying thories of programmingen
dc.subjectHoare and Heen
dc.subjectprogramme terminationen
dc.subjectnonterminationen
dc.subjectenabling conditionsen
dc.titleUnifying theories of programming that distinguish nontermination and aborten
dc.typeMeetings and Proceedingsen
dc.typeBook Chapteren
dc.contributor.departmentUniversity of Teesside. School of Computing.en
dc.title.bookMathematics of programme constructionen
dc.identifier.conferenceMathematics of Program Construction 10th International Conference, MPC 2010, Québec City, Canada, June 21-23, 2010en
ref.citationcount1 [Web of Science, 21/03/2011]en
or.citation.harvardHayes, I. J., Dunne, S. E. and Meinicke, L. (2010) 'Unifying theories of programming that distinguish nontermination and abort', Mathematics of Program Construction 10th International Conference, MPC 2010, Québec City, Canada, June 21-23, 2010, in Bolduc, C., Desharnais, J. and Ktari, B. (eds) Mathematics of programme construction. Berlin: Springer-Verlag, pp.178-194.-
prism.startingPage178-
prism.endingPage194-
All Items in TeesRep are protected by copyright, with all rights reserved, unless otherwise indicated.