Proving safety properties of an aircraft landing protocol using i/o automata and the PVS theorem prover: a case study

Authors:
Shinya Umeno;Nancy Lynch
Affiliations:
Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA;Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA
Venue:
FM'06 Proceedings of the 14th international conference on Formal Methods
Year:
2006

Citing 2
Cited 6

Distributed Algorithms

Distributed Algorithms
PVS: A Prototype Verification System

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction

True-concurrency probabilistic models: Markov nets and a law of large numbers

Theoretical Computer Science
Machine-Assisted Parameter Synthesis of the Biphase Mark Protocol Using Event Order Abstraction

FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Formal Verification of Curved Flight Collision Avoidance Maneuvers: A Case Study

FM '09 Proceedings of the 2nd World Congress on Formal Methods
Safety verification of an aircraft landing protocol: a refinement approach

HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Parametrized Verification of Distributed Cyber-Physical Systems: An Aircraft Landing Protocol Case Study

ICCPS '12 Proceedings of the 2012 IEEE/ACM Third International Conference on Cyber-Physical Systems
Formal verification of distributed aircraft controllers

Proceedings of the 16th international conference on Hybrid systems: computation and control

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an assertional-style verification of the aircraft landing protocol of NASA's SATS (Small Aircraft Transportation System) concept [1] using the I/O automata framework and the PVS theorem prover. We reconstructed the mathematical model of the landing protocol presented in [2] as an I/O automaton. In addition, we translated the I/O automaton into a corresponding PVS specification, and conducted a verification of the safety properties of the protocol using the assertional proof technique and the PVS theorem prover.