Comparing Verification Systems: Interactive Consistency in ACL2
IEEE Transactions on Software Engineering
Using TAME to prove invariants of automata models: Two case studies
FMSP '00 Proceedings of the third workshop on Formal methods in software practice
Deriving operational software specifications from system goals
Proceedings of the 10th ACM SIGSOFT symposium on Foundations of software engineering
Proving Invariants of I/O Automata with TAME
Automated Software Engineering
Deriving operational software specifications from system goals
ACM SIGSOFT Software Engineering Notes
Architectural support for mode-driven fault tolerance in distributed applications
WADS '05 Proceedings of the 2005 workshop on Architecting dependable systems
An abstract reachability approach by combining HOL induction and multiway decision graphs
Journal of Computer Science and Technology
Verifying mode consistency for on-board satellite software
SAFECOMP'10 Proceedings of the 29th international conference on Computer safety, reliability, and security
Developing mode-rich satellite software by refinement in event B
FMICS'10 Proceedings of the 15th international conference on Formal methods for industrial critical systems
Critical systems development methodology using formal techniques
Proceedings of the Third Symposium on Information and Communication Technology
Formal Specification of Medical Systems by Proof-Based Refinement
ACM Transactions on Embedded Computing Systems (TECS) - Special Issue on Modeling and Verification of Discrete Event Systems
Developing mode-rich satellite software by refinement in Event-B
Science of Computer Programming
| Hi-index | 0.00 |
This paper presents an introduction to capturing software requirements in the PVS formal language. The object of study is a simplified digital autopilot that was motivated in part by the mode control panel of NASA Langley''s Boeing 737 research aircraft. The paper first presents the requirements for this autopilot in English and then steps the reader through a translation of these requirements into formal mathematics. Along the way deficiencies in the English specification are noted and repaired. Once completed, the formal PVS requirement is analyzed using the PVS theorem prover and shown to maintain an invariant over its state space.