CTL model checking based on forward state traversal

Iwashita, Hidetoshi; Nakata, Tsuneo; Hirose, Fumiyasu

doi:10.1109/iccad.1996.569084

Cited by 29 publications

(29 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We start from the ImProviso algorithm of Lerda et al [4] for computing reachable states, which combines POR and symbolic verification. We merge it with the FwdUntil method of Iwashita et al [5] that supports verification of a subset of CTL. Our algorithm has been implemented in a prototype that is applicable to action-based models and logics such as LOTOS [6] and ACTL [7].…”

Section: Introductionmentioning

confidence: 99%

Efficient Symbolic Model Checking for Process Algebras

Meulen

Pecheur

2009

Formal Methods for Industrial Critical Systems

View full text Add to dashboard Cite

Abstract. Different approaches have been developed to mitigate the state space explosion of model checking techniques. Among them, symbolic verification techniques use efficient representations such as BDDs to reason over sets of states rather than over individual states. Unfortunately, past experience has shown that these techniques do not work well for loosely-synchronized models. This paper presents a new algorithm and a new tool that combines BDD-based model checking with partial order reduction (POR) to allow the verification of models featuring asynchronous processes, with significant performance improvements over currently available tools. We start from the ImProviso algorithm (Lerda et al.) for computing reachable states, which combines POR and symbolic verification. We merge it with the FwdUntil method (Iwashita et al.) that supports verification of a subset of CTL. Our algorithm has been implemented in a prototype that is applicable to action-based models and logics such as process algebras and ACTL. Experimental results on a model of an industrial application show that our method can verify properties of a large industrial model which cannot be handled by conventional model checkers.

show abstract

Section: Introductionmentioning

confidence: 99%

Efficient Symbolic Model Checking for Process Algebras

Meulen

Pecheur

2009

Formal Methods for Industrial Critical Systems

View full text Add to dashboard Cite

show abstract

“…In practice, forward traversal usually is much faster [17,54,57,58]. The reason may be that unreachable states do not have to be visited and BDDs behave much better.…”

Section: Model Checkingmentioning

confidence: 99%

A survey of recent advances in SAT-based formal verification

Prasad

Biere

Gupta³

2005

Int J Softw Tools Technol Transfer

200

120

View full text Add to dashboard Cite

Abstract. Dramatic improvements in SAT solver technology over the last decade and the growing need for more efficient and scalable verification solutions have fueled research in verification methods based on SAT solvers. This paper presents a survey of the latest developments in SAT-based formal verification, including incomplete methods such as bounded model checking and complete methods for model checking. We focus on how the surveyed techniques formulate the verification problem as a SAT problem and how they exploit crucial aspects of a SAT solver, such as application-specific heuristics and conflict-driven learning. Finally, we summarize the noteworthy achievements in this area so far and note the major challenges in making this technology more pervasive in industrial design verification flows.

show abstract

“…But, even so, as shown in the column ªforwardº in Table 3, it was at least an order of magnitude slower than backward traversals. Nevertheless, the verification of many hardware systems tends to benefit, rather than suffer, from forward traversals [21], [22]. Partly inspired by [23], we believe that the inefficiency is mainly due to the complicated invariants of TCAS II and the EPD system, which are maintained by forward but not backward traversals.…”

Section: Performance Difference Between Forward and Backward Traversalsmentioning

confidence: 99%

Optimizing symbolic model checking for statecharts

Chan

Anderson

Beame

et al. 2001

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

AbstractÐSymbolic model checking based on binary decision diagrams is a powerful formal verification technique for reactive systems. In this paper, we present various optimizations for improving the time and space efficiency of symbolic model checking for systems specified as statecharts. We used these techniques in our analyses of the models of a collision avoidance system and a faulttolerant electrical power distribution (EPD) system, both used on commercial aircraft. The techniques together reduce the time and space requirements by orders of magnitude, making feasible some analysis that was previously intractable. We also elaborate on the results of verifying the EPD model. The analysis disclosed subtle modeling and logical flaws not found by simulation.

show abstract

CTL model checking based on forward state traversal

Abstract: We

Cited by 29 publications

References 10 publications

Efficient Symbolic Model Checking for Process Algebras

Efficient Symbolic Model Checking for Process Algebras

A survey of recent advances in SAT-based formal verification

Optimizing symbolic model checking for statecharts

Contact Info

Product

Resources

About