Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.authorRahman, Fahrurrozi
dc.contributor.authorBowles, Juliana Kuster Filipe
dc.contributor.editorPolikarpova, Nadia
dc.contributor.editorSchneider, Steve
dc.date.accessioned2017-09-19T11:30:11Z
dc.date.available2017-09-19T11:30:11Z
dc.date.issued2017
dc.identifier.citationRahman , F & Bowles , J K F 2017 , Formal verification of CNL health recommendations . in N Polikarpova & S Schneider (eds) , Integrated Formal Methods : 13th International Conference, IFM 2017, Turin, Italy, September 20-22, 2017, Proceedings . Lecture Notes in Computer Science (Programming and Software Engineering) , vol. 10510 , Springer , Cham , pp. 357-371 , 13th International Conference on integrated Formal Methods (iFM 2017) , Torino , Italy , 18/09/17 . https://doi.org/10.1007/978-3-319-66845-1_24en
dc.identifier.citationconferenceen
dc.identifier.isbn9783319668444
dc.identifier.isbn9783319668451
dc.identifier.issn0302-9743
dc.identifier.otherPURE: 250186679
dc.identifier.otherPURE UUID: 6d453495-8bfd-4d7c-be67-28463ff834ca
dc.identifier.otherScopus: 85030177657
dc.identifier.otherORCID: /0000-0002-5918-9114/work/58055307
dc.identifier.urihttp://hdl.handle.net/10023/11693
dc.descriptionThis research is partially supported by EPSRC grant EP/M014290/1.en
dc.description.abstractClinical texts, such as therapy algorithms, are often described in natural language and may include hidden inconsistencies, gaps and potential deadlocks. In this paper, we propose an approach to identify such problems with formal verification. From each sentence in the therapy algorithm we automatically generate a parse tree and derive case frames. From the case frames we construct a state-based representation (in our case a timed automaton) and use a model checker (here UPPAAL) to verify the model. Throughout the paper we use an example of the algorithm for blood glucose lowering therapy in adults with type 2 diabetes to illustrate our approach.
dc.format.extent15
dc.language.isoeng
dc.publisherSpringer
dc.relation.ispartofIntegrated Formal Methodsen
dc.relation.ispartofseriesLecture Notes in Computer Science (Programming and Software Engineering)en
dc.rights© 2017, Springer International Publishing AG. This work has been made available online in accordance with the publisher’s policies. This is the author created, accepted version manuscript following peer review and may differ slightly from the final published version. The final published version of this work is available at link.springer.com / https://doi.org/10.1007/978-3-319-66845-1_24en
dc.subjectFormal verificationen
dc.subjectControlled natural languageen
dc.subjectTimed automataen
dc.subjectHealth recommendationsen
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subjectRC Internal medicineen
dc.subjectT-NDASen
dc.subject.lccQA75en
dc.subject.lccRCen
dc.titleFormal verification of CNL health recommendationsen
dc.typeConference itemen
dc.description.versionPostprinten
dc.contributor.institutionUniversity of St Andrews.School of Computer Scienceen
dc.identifier.doihttps://doi.org/10.1007/978-3-319-66845-1_24
dc.date.embargoedUntil2017-08-27


This item appears in the following Collection(s)

Show simple item record