An efficient verification procedure supporting evolution of reactive system specifications

Authors:
Takenobu Aoshima;Kenji Sakuma;Naoki Yonezaki
Affiliations:
Tokyo Institute of Technology, Tokyo, Japan;Tokyo Institute of Technology, Tokyo, Japan;Tokyo Institute of Technology, Tokyo, Japan
Venue:
IWPSE '01 Proceedings of the 4th International Workshop on Principles of Software Evolution
Year:
2001

Citing 5
Cited 1

On the synthesis of a reactive module

POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Symbolic Boolean manipulation with ordered binary-decision diagrams

ACM Computing Surveys (CSUR)
The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Efficient Büchi Automata from LTL Formulae

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
A Decision Algorithm for Full Propositional Temporal Logic

CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification

SAT: Based bounded strong satisfiability checking of reactive system specifications

ICT-EurAsia'13 Proceedings of the 2013 international conference on Information and Communication Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

To evolve reactive system specifications, it is necessary to check properties of the specifications, such as satisfiability, stepwise satisfiability and strong satisfiability. We developed a verification method for checking these properties of specifications described in Linear Temporal Logic. The most significant problem of the verification is that it needs huge computational resources. To solve the problem, we introduce an efficient procedure for checking these properties based on a tableau method using combination of Binary Decision Diagrams representing sets of states and coarse graphs representing transitions.