2001
DOI: 10.1145/383876.383877
|View full text |Cite
|
Sign up to set email alerts
|

Automated deductive requirements analysis of critical systems

Abstract: We advocate the need for automated support to System Requirement Analysis in the development of time-and safety-critical computer-based systems. To this end we pursue an approach based on deductive analysis: high-level, real-world entities and notions, such as events, states, finite variability, cause-effect relations, are modeled through the temporal logic TRIO, and the resulting deductive system is implemented by means of the theorem prover PVS. Throughout the paper, the constructs and features of the deduct… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
40
0

Year Published

2002
2002
2018
2018

Publication Types

Select...
7
1

Relationship

4
4

Authors

Journals

citations
Cited by 42 publications
(40 citation statements)
references
References 48 publications
0
40
0
Order By: Relevance
“…Over the years a variety of methods and tools have been defined to support typical validation and verification activities in TRIO, as described in [6] and [2].…”
Section: Introductionmentioning
confidence: 99%
“…Over the years a variety of methods and tools have been defined to support typical validation and verification activities in TRIO, as described in [6] and [2].…”
Section: Introductionmentioning
confidence: 99%
“…Secondly, we will investigate verification techniques (to be supported by TRIDENT) to complement the modeling features presented in this paper. In this regard, the semantics of ArchiTRIO in terms of HOT suggests an encoding of ArchiTRIO classes into the higher-order logic of a theorem prover such as PVS, along the lines already followed for the TRIO language [5].…”
Section: Discussionmentioning
confidence: 99%
“…[7]. With ArchiTRIO one can express all of these properties and some more; for example, axiom dataRelay shown in Section 2, which defines neither a class invariant, nor a pre/post condition (nor a constraint) on an operation, but, rather, a dynamic relationship between two different operations, cannot be expressed as an OCL constraint 5 . In addition, OCL expressions are forbidden to "alter the state of the corresponding executing system" (i.e.…”
Section: Related Workmentioning
confidence: 99%
“…The axiomatic description of nonZenoness is immediate for a first order, metric temporal logic like MTL or TRIO, when it is applied to simple entities like predicates or variables ranging over finite domains. It can be more complicated when nonZenoness must be specified in the most general case of variables that are real-valued functions of time [Gargantini and Morzenti 2001].…”
Section: Dense Time Domains and The Nonzenoness Propertymentioning
confidence: 99%