Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
The effects of skill development and feedback on action slips
HCI'92 Proceedings of the conference on People and computers VII
Multiway Decision Graphs for Automated Hardware Verification
Formal Methods in System Design
Formal verification of undesired behaviours in the CERD case study
Proceedings of the IFIP TC2/WG2.7 Working Conference on Engineering for Human-Computer Interaction
Human-Computer Interaction
Improving hardware designs whilst simplifying their proof
DCC'96 Proceedings of the 3rd international conference on Designing Correct Circuits
From a Formal User Model to Design Rules
DSV-IS '02 Proceedings of the 9th International Workshop on Interactive Systems. Design, Specification, and Verification
Models of interactive systems: a case study on programmable user modelling
International Journal of Human-Computer Studies
User interface design with matrix algebra
ACM Transactions on Computer-Human Interaction (TOCHI)
Providing a formal linkage between MDG and HOL
Formal Methods in System Design
Detecting Cognitive Causes of Confidentiality Leaks
Electronic Notes in Theoretical Computer Science (ENTCS)
Formal Modelling of Salience and Cognitive Load
Electronic Notes in Theoretical Computer Science (ENTCS)
Combining Human Error Verification and Timing Analysis
Engineering Interactive Systems
Formal modelling of cognitive interpretation
DSVIS'06 Proceedings of the 13th international conference on Interactive systems: Design, specification, and verification
| Hi-index | 0.00 |
Systematic user errors commonly occur in the use of interactive systems. We describe a formal reusable user model implemented in higher-order logic that can be used for machine-assisted reasoning about user errors. The core of this model is a series of non-deterministic guarded temporal rules. We consider how this approach allows errors of various specific kinds to be detected and so avoided by proving a single theorem about an interactive system. We illustrate the approach using a simple case study.