Our system is currently under heavy load due to increased usage. We're actively working on upgrades to improve performance. Thank you for your patience.
2000
DOI: 10.1007/3-540-45499-3_8
|View full text |Cite
|
Sign up to set email alerts
|

Practical Application of Functional and Relational Methods for the Specification and Verification of Safety Critical Software

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2002
2002
2020
2020

Publication Types

Select...
3
3
1

Relationship

3
4

Authors

Journals

citations
Cited by 17 publications
(7 citation statements)
references
References 2 publications
0
7
0
Order By: Relevance
“…In particular, for each table that is syntactically valid, PVS automatically generates its associated healthiness conditions of completeness and disjointness as type correctness conditions (TCCs). Furthermore, we have expertise built from past experience in applying PVS to check requirements and designs in the nuclear domain [8] that gave us confidence in using the toolset. For modelling real-time behaviour, we reused parts of the PVS theories from [5,4] (see Sec.…”
Section: Tabular Expressionsmentioning
confidence: 99%
“…In particular, for each table that is syntactically valid, PVS automatically generates its associated healthiness conditions of completeness and disjointness as type correctness conditions (TCCs). Furthermore, we have expertise built from past experience in applying PVS to check requirements and designs in the nuclear domain [8] that gave us confidence in using the toolset. For modelling real-time behaviour, we reused parts of the PVS theories from [5,4] (see Sec.…”
Section: Tabular Expressionsmentioning
confidence: 99%
“…The syntactic constructs that we use the most are "if-then-else" predicates and tables, which we will explain as we use them. An example of using tabular expressions to specify and verify the Darlington Nuclear Shutdown System (SDS) in PVS can be found in [13]. PVS has a powerful interactive proof checker to perform sequent-style deductions.…”
Section: Preliminariesmentioning
confidence: 99%
“…Tabular expressions [20,21] are a way to document system requirement that have proven to be both practical and effective in industry [13,25]. PVS [18] is a non-commercial theorem prover, and provides an integrated environment with mechanized support for writing specifications using tabular expressions and (higher-order) predicates, and for (interactively) proving that implementations satisfy the tabular requirements using sequent-style deductions.…”
Section: Introductionmentioning
confidence: 99%
“…Tolerances were taken into account on the system inputs and outputs where necessary, effectively making the specifications relational. 5 With mathematical requirements in place, it becomes possible to formally verify that the system design meets the requirements as a part of the development process. Figure 2 shows the idealized development process together with the tools used in producing the documentation and software for the Darlington SDS Redesign.…”
Section: Overview Of the Darlington Redesign Projectmentioning
confidence: 99%