Automated deductive requirements analysis of critical systems

被引:25
作者
Gargantini, A [1 ]
Morzenti, A [1 ]
机构
[1] Politecn Milan, Dipartimento Elettr & Informat, I-20133 Milan, Italy
关键词
design; reliability; verification; temporal logic; theorem proving; state-transition systems; finite variability; hybrid systems;
D O I
10.1145/383876.383877
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
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 deductive system are illustrated and validated by applying them to the well-known example of the Generalized Railway Crossing.
引用
收藏
页码:255 / 307
页数:53
相关论文
共 56 条
[1]   AN OLD-FASHIONED RECIPE FOR REAL-TIME [J].
ABADI, M ;
LAMPORT, L .
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1994, 16 (05) :1543-1571
[2]  
Alborghetti A, 1997, LECT NOTES COMPUT SC, V1301, P211, DOI 10.1145/267896.267912
[3]   The validation of rapid methods in food microbiology [J].
Archer, DL .
FOOD CONTROL, 1996, 7 (01) :3-4
[4]  
ARCHER M, 2000, P 3 ACM WORKSH FORM
[5]  
ARCHER M, 1997, SPRINGER LECT NOTES, P33
[6]  
BASSO M, 1998, IMPROVING SOFTWARE P, P79
[7]   SYNCHRONOUS PROGRAMMING WITH EVENTS AND RELATIONS - THE SIGNAL LANGUAGE AND ITS SEMANTICS [J].
BENVENISTE, A ;
LEGUERNIC, P ;
JACQUEMOT, C .
SCIENCE OF COMPUTER PROGRAMMING, 1991, 16 (02) :103-149
[8]  
CAPOBIANCHI R, 2000, ACM COMPUT SURV, V32
[9]   A FUNCTIONAL-MODEL FOR DESCRIBING AND REASONING ABOUT TIME BEHAVIOR OF COMPUTING SYSTEMS [J].
CASPI, P ;
HALBWACHS, N .
ACTA INFORMATICA, 1986, 22 (06) :595-627
[10]  
*CENELEC, 2001, 50129 CENELEC PREN E