A toolchain on model checking SPIN via Kalman Decomposition for control system software

Tsukada, Kento; Sawada, Kenji; Shin, Seiichi

doi:10.1109/coase.2016.7743421

Cited by 5 publications

(2 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example in [227] the authors use state transition diagrams of PLC programs as a basis for formal model dispatched to NuSMV model checker, while expressing the security properties in LTL. Similarly, the authors of [252] utilized Petri Nets to develop software falsification detection by translating Petri Nets to Promela and dispatching it to the SPIN model checker, while modelling the falsification properties in LTL.…”

Section: Industrialmentioning

confidence: 99%

“…Model checkers. AVISPA (Automated Validation of Internet Security Protocols and Applications) [22], Alloy [85], CBMC (Bounded Model Checker for C and C++) [61], CWB-NC (Concurrency Workbench of New Century) [155], Cadence IFV (RTL block-level verifier) [114], FDR [106], GROOVE [105], jKind [102], NuSMV [68], OFMC (on-the-fly model checker) [37], PAT (Process Analysis Toolkit for CSP#) [241], PRISM (probabilistic model checker) [184], SATMC (SAT-based model checker for security protocols) [46], SPIN [252], TRUSTFOUND [30], UPPAAL [179], UVHM (formal analysis scheme for hypervisors) [256].…”

Section: Specification Languages and Associated Toolsmentioning

confidence: 99%

See 1 more Smart Citation

A Survey of Practical Formal Methods for Security

et al. 2022

View full text Add to dashboard Cite

In today’s world, critical infrastructure is often controlled by computing systems. This introduces new risks for cyber attacks, which can compromise the security and disrupt the functionality of these systems. It is therefore necessary to build such systems with strong guarantees of resiliency against cyber attacks. One way to achieve this level of assurance is using formal verification, which provides proofs of system compliance with desired cyber security properties. The use of Formal Methods (FM) in aspects of cyber security and safety-critical systems are reviewed in this article. We split FM into the three main classes: theorem proving, model checking and lightweight FM. To allow the different uses of FM to be compared, we define a common set of terms. We further develop categories based on the type of computing system FM are applied in. Solutions in each class and category are presented, discussed, compared and summarised. We describe historical highlights and developments and present a state-of-the-art review in the area of FM in cyber security. This review is presented from the point of view of FM practitioners and researchers, commenting on the trends in each of the classes and categories. This is achieved by considering all types of FM, several types of security and safety-critical systems and by structuring the taxonomy accordingly. The article hence provides a comprehensive overview of FM and techniques available to system designers of security-critical systems, simplifying the process of choosing the right tool for the task. The article concludes by summarising the discussion of the review, focusing on best practices, challenges, general future trends and directions of research within this field.

show abstract

Section: Industrialmentioning

confidence: 99%

Section: Specification Languages and Associated Toolsmentioning

confidence: 99%

A Survey of Practical Formal Methods for Security

et al. 2022

View full text Add to dashboard Cite

show abstract

On software update analysis via Kalman decomposition

Kishida

Sawada

Shin

2017

2017 11th Asian Control Conference (ASCC)

View full text Add to dashboard Cite

Reachability Analysis of Petri Nets

Murakami

2019

IEICE Fundamentals Review

View full text Add to dashboard Cite

Petri nets are one of the modeling languages of discrete event systems and concurrent systems. They were introduced by Dr. Carl Adam Petri in his Ph.D. thesis in 1962 and sice then, an enormous amount of theoretical and practical research has been carried our on them. The reachability problem is one of the fundamental problems in Petri nets. Although this problem is decidable, its computational complexity is exponential to the size of the Petri nets, making the analysis of various problems on Petri nets difficult. However, recent advances in computational capabilities and the development of various methods have enabled us to solve problems on Petri nets of a certain scale. This paper outlines the following recent methods used for the reachability problem: the symbolic state-space method, the unfolding method, the modular state-space method, and the method using model-checking tools.

show abstract

A toolchain on model checking SPIN via Kalman Decomposition for control system software

Cited by 5 publications

References 9 publications

A Survey of Practical Formal Methods for Security

A Survey of Practical Formal Methods for Security

On software update analysis via Kalman decomposition

Reachability Analysis of Petri Nets

Contact Info

Product

Resources

About