Analysing sanity of requirements for avionics systems
From MaRDI portal
(Redirected from Publication:282095)
Abstract: In the last decade it became a common practice to formalise software requirements to improve the clarity of users' expectations. In this work we build on the fact that functional requirements can be expressed in temporal logic and we propose new sanity checking techniques that automatically detect flaws and suggest improvements of given requirements. Specifically, we describe and experimentally evaluate approaches to consistency and redundancy checking that identify all inconsistencies and pinpoint their exact source (the smallest inconsistent set). We further report on the experience obtained from employing the consistency and redundancy checking in an industrial environment. To complete the sanity checking we also describe a semi-automatic completeness evaluation that can assess the coverage of user requirements and suggest missing properties the user might have wanted to formulate. The usefulness of our completeness evaluation is demonstrated in a case study of an aeroplane control system.
Recommendations
- Sanity Checks in Formal Verification
- Lightweight validation of natural language requirements
- Requirements specifications checking of embedded real time software
- High-automation proofs for properties of requirements models
- Verification of software requirements on program systems represented by attribute transition systems
Cites work
- scientific article; zbMATH DE number 1701778 (Why is no real title available?)
- scientific article; zbMATH DE number 177248 (Why is no real title available?)
- scientific article; zbMATH DE number 1487861 (Why is no real title available?)
- scientific article; zbMATH DE number 1487867 (Why is no real title available?)
- scientific article; zbMATH DE number 1796124 (Why is no real title available?)
- scientific article; zbMATH DE number 1796138 (Why is no real title available?)
- scientific article; zbMATH DE number 1903365 (Why is no real title available?)
- Algorithms for computing minimal unsatisfiable subsets of constraints
- Diagnostic Information for Realizability
- Efficient detection of vacuity in temporal model checking
- Sanity Checks in Formal Verification
- Towards a notion of unsatisfiable and unrealizable cores for LTL
Cited in
(5)- scientific article; zbMATH DE number 7577576 (Why is no real title available?)
- Finding boundary elements in ordered sets with application to safety and requirements analysis
- Timed automata relaxation for reachability
- Hashing-based approximate counting of minimal unsatisfiable subsets
- A weakness measure for GR(1) formulae
This page was built for publication: Analysing sanity of requirements for avionics systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q282095)