SAT: Based bounded strong satisfiability checking of reactive system specifications

Authors:
Masaya Shimakawa;Shigeki Hagihara;Naoki Yonezaki
Affiliations:
Department of Computer Science, Graduate School of Information Science and Engineering, Tokyo Institute of Technology, Tokyo, Japan;Department of Computer Science, Graduate School of Information Science and Engineering, Tokyo Institute of Technology, Tokyo, Japan;Department of Computer Science, Graduate School of Information Science and Engineering, Tokyo Institute of Technology, Tokyo, Japan
Venue:
ICT-EurAsia'13 Proceedings of the 2013 international conference on Information and Communication Technology
Year:
2013

Citing 12
Cited 0

On the synthesis of a reactive module

POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An efficient verification procedure supporting evolution of reactive system specifications

IWPSE '01 Proceedings of the 4th International Workshop on Principles of Software Evolution
Realizable and Unrealizable Specifications of Reactive Systems

ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Checking Safety Properties Using Induction and a SAT-Solver

FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
Symbolic Model Checking without BDDs

TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Derivation of the Input Conditional Formula from a Reactive System Specifictaion in Temporal Logic

ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
NuSMV 2: An OpenSource Tool for Symbolic Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Software Abstractions: Logic, Language, and Analysis

Software Abstractions: Logic, Language, and Analysis
Optimizations for LTL Synthesis

FMCAD '06 Proceedings of the Formal Methods in Computer Aided Design
Bounded Model Checking with SNF, Alternating Automata, and Büchi Automata

Electronic Notes in Theoretical Computer Science (ENTCS)
Bounded synthesis

ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Bounded model checking for weak alternating büchi automata

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many fatal accidents involving safety-critical reactive systems have occurred in unexpected situations that were not considered during the design and test phases of the systems. To prevent these accidents, reactive systems should be designed to respond appropriately to any request from an environment at any time. Verifying this property during the specification phase reduces development reworking. This property of a specification is commonly known as realizability. Realizability checking for reactive system specifications involves complex and intricate analysis. For the purpose of detecting simple and typical defects in specifications, we introduce the notion of bounded strong satisfiability (a necessary condition for realizability), and present a method for checking this property. Bounded strong satisfiability is the property that for all input patterns represented by loop structures of a given size k, there is a response that satisfies a given specification. We present a checking method based on a satisfiability solver, and report experimental results.