Feature-Based Decomposition of Inductive Proofs Applied to Real-Time Avionics Software: An Experience Report

  • Authors:
  • Vu Ha;Murali Rangarajan;Darren Cofer;Harald Rues;Bruno Dutertre

  • Affiliations:
  • Honeywell International;Honeywell International;Honeywell International;SRI International;SRI International

  • Venue:
  • Proceedings of the 26th International Conference on Software Engineering
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

The hardware and software in modern aircraft controlsystems are good candidates for verification using formalmethods: they are complex, safety-critical, and challengethe capabilities of test-based verification strategies. Wehave previously reported on our use of model checking toverify the time partitioning property of the Deos驴 real-timeoperating system for embedded avionics. The size and complexityof this system have limited us to analyzing only oneconfiguration at a time. To overcome this limit and generalizeour analysis to arbitrary configurations we have turnedto theorem proving.This paper describes our use of the PVS theorem proverto analyze the Deos scheduler. In addition to our inductiveproof of the time partitioning invariant, we present afeature-based technique for modeling state-transition systemsand formulating inductive invariants. This techniquefacilitates an incremental approach to theorem proving thatscales well to models of increasing complexity, and has thepotential to be applicable to a wide range of problems.