Checking subsystem safety properties in compositional reachability analysis

被引：12
|
作者：
Cheung, SC [1 ]
Kramer, J [1 ]
机构：
[1] HONG KONG UNIV SCI & TECHNOL,DEPT COMP SCI,HONG KONG,HONG KONG
来源：
PROCEEDINGS OF THE 18TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING | 1996年
关键词：
D O I：
10.1109/ICSE.1996.493410
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：144 / 154
页数：11
相关论文
共 50 条
  • [31] Efficient model checking of safety properties
    Latvala, Timo
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2003, 2648 : 74 - 88
  • [32] Efficient model checking of safety properties
    Latvala, T
    MODEL CHECKING SOFTWARE, 2003, 2648 : 74 - 88
  • [33] Scalable compositional reachability analysis of real-time concurrent systems
    Wang, F
    1996 IEEE REAL-TIME TECHNOLOGY AND APPLICATIONS SYMPOSIUM, PROCEEDINGS, 1996, : 182 - 191
  • [34] Symbolic and Compositional Reachability for Timed Automata
    Larsen, Kim Guldstrand
    REACHABILITY PROBLEMS, 2010, 6227 : 24 - 28
  • [35] Safety verification and reachability analysis for hybrid systems
    Gueguen, Herve
    Lefebvre, Marie-Anne
    Zaytoon, Janan
    Nasri, Othman
    ANNUAL REVIEWS IN CONTROL, 2009, 33 (01) : 25 - 36
  • [36] A Full Symbolic Compositional Reachability Analysis of Timed Automata Based on BDD
    Du, Junwei
    Zhang, Huiping
    Yu, Gang
    Wang, Xi
    2015 SEVENTH INTERNATIONAL CONFERENCE ON ADVANCED COMPUTATIONAL INTELLIGENCE (ICACI), 2015, : 218 - 222
  • [37] COMBINATION OF COMPOSITIONAL VERIFICATION AND MODEL CHECKING FOR SAFETY ASSESSMENT OF COMPLEX ENGINEERED SYSTEMS
    Mehrpouyan, Hoda
    Giannakopoulou, Dimitra
    Tumer, Irem Y.
    Hoyle, Chris
    Brat, Guillaume
    PROCEEDINGS OF THE ASME INTERNATIONAL DESIGN ENGINEERING TECHNICAL CONFERENCES AND COMPUTERS AND INFORMATION IN ENGINEERING CONFERENCE, 2014, VOL 1B, 2014,
  • [38] Checking Algebraic Reachability of Polynomial and Rational Systems
    Nemcova, Jana
    van Schuppen, Jan H.
    IFAC PAPERSONLINE, 2017, 50 (01): : 12119 - 12124
  • [39] Bounded model checking for repeated reachability and persistence properties in probabilistic reward temporal logic
    School of Computer Science and Telecommunication Engineering, Jiangsu University, Zhenjiang 212013, China
    J. Comput. Inf. Syst., 8 (3261-3269):
  • [40] Transition-by-transition FSM traversal for reachability analysis in bounded model checking
    Nguyen, MD
    Stoffel, D
    Wedler, M
    Kunz, W
    ICCAD-2005: INTERNATIONAL CONFERENCE ON COMPUTER AIDED DESIGN, DIGEST OF TECHNICAL PAPERS, 2005, : 1068 - 1075
12345