Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Design and validation of computer protocols
Design and validation of computer protocols
Handbook of theoretical computer science (vol. B)
Symbolic model checking: an approach to the state explosion problem
Symbolic model checking: an approach to the state explosion problem
Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS
IEEE Transactions on Software Engineering
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Specifying the mode logic of a flight guidance system in CoRE and SCR
FMSP '98 Proceedings of the second workshop on Formal methods in software practice
The Murphi Verification System
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Formal Specification of a Flight Guidance System
Formal Specification of a Flight Guidance System
Flight Guidance System Validation using SPIN
Flight Guidance System Validation using SPIN
Detecting Mode Confusion Through Formal Modeling and Analysis
Detecting Mode Confusion Through Formal Modeling and Analysis
Formal Methods Diffusion: Past Lessons and Future Prospects
SAFECOMP '00 Proceedings of the 19th International Conference on Computer Safety, Reliability and Security
A Rigorous View of Mode Confusion
SAFECOMP '02 Proceedings of the 21st International Conference on Computer Safety, Reliability and Security
Analyzing Interaction Orderings with Model Checking
Proceedings of the 19th IEEE international conference on Automated software engineering
| Hi-index | 0.00 |
Mode confusion is a serious problem in aviation safety. Today's complex avionics systems make it difficult for pilots to maintain awareness of the actual states, or modes, of the flight deck automation. NASA explores how formal methods, especially theorem proving, can be used to discover mode confusion. The present paper investigates whether state-exploration techniques, e.g., model checking, are better able to achieve this task than theorem proving and also to compare the verification tools MurΦ, SMV, and Spin for the specific application. While all tools can handle the task well, their strengths are complementary.