• Title, Summary, Keyword: Model Checking

Search Result 492, Processing Time 0.041 seconds

Bounded Model Checking BIR Model (BIR 모델의 바운디드 모델 검증)

  • Cho, Min-Taek;Lee, Tae-Hoon;Kwon, Gi-Hwon
    • Journal of KIISE:Software and Applications
    • /
    • v.34 no.8
    • /
    • pp.743-751
    • /
    • 2007
  • Model checking has been successfully applied to hardware verification. Software is more subtle than hardware with respect to formal verification due to its infinite state space. Although there are many research activities in this area, bounded model checking is regarded as a promising technique. Bounded model checking uses an upper bound to unroll its model, which is the main advantage of bounded model checking compared to other model checking techniques. In this paper, we applied bounded model checking to verify BIR which is the input model for the model checking tool BOGOR. Some BIR examples are verified with our technique. Experimental results show that bounded model checking is better than explicit model checking provided by BOGOR. This paper presents the formalization of BIR and the encoding algorithm of BIR into CNF.

3-L Model: A Model for Checking the Integrity Constraints of Mobile Databases

  • Ibrahim, Hamidah;Dzolkhifli, Zarina;Affendey, Lilly Suriani;Madiraju, Praveen
    • Journal of Computing Science and Engineering
    • /
    • v.3 no.4
    • /
    • pp.260-277
    • /
    • 2009
  • In this paper we propose a model for checking integrity constraints of mobile databases called Three-Level (3-L) model, wherein the process of constraint checking to maintain the consistent state of mobile databases is realized at three different levels. Sufficient and complete tests proposed in the previous works together with the idea of caching relevant data items for checking the integrity constraints are adopted. This has improved the checking mechanism by preventing delays during the process of checking constraints and performing the update. Also, the 3-L model reduces the amount of data accessed given that much of the tasks are performed at the mobile host, and hence speeds up the checking process.

Improving Symbolic Model Checking Performance Withy Retiming (Retiming을 이용한 Symbolic Model Checking 성능 향상에 관한 연구)

  • Kang, Hyeong-Ju
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.10
    • /
    • pp.2310-2316
    • /
    • 2010
  • This paper presents an application of retiming to model checking, a branch of formal verification. Retiming can change the transition relation of a circuit without changing its input-output behaviour by relocating its registers. With the retiming, a given circuit can have a different structure more adequate for model checking. This paper proposes a cost function to reflect the number of registers and the characteristic of its transition relation and develops a heuristic annealing algorithm to search efficiently the circuit structures obtained by retiming. Experimental results show that the proposed method can improve the model checking performance.

Equivalence Checking of Finite State Machines with SMV (SMV를 이용한 유한 상태 기계의 동치 검사)

  • 권기현;엄태호
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.7_8
    • /
    • pp.642-648
    • /
    • 2003
  • In this paper, we are interested in checking equivalence of FSMs(finite state machines). Two FSMs are equivalent if and only if their responses are always equal with each other with respect to the same external stimuli. Equivalence checking FSMs makes complicated FSM be substituted for simpler one, if they are equivalent. We can also determine the system satisfies the requirements, if they are all written in FSMs. In this paper, we regard equivalence checking problem as model checking one. For doing so, we construct the product model $M ={M_A} {\beta}{M_B} from two FSMs ${M_A} and {M_B}$. And we also get the temporal logic formula ${\Phi}$ from the equivalence checking definition. Then, we can check with model checker whether if satisfies ${\Phi}$, written $M= {.\Phi}$. Two FSMs are equivalent, if $M= {.\Phi}$ Otherwise, it is not equivalent. In that case, model checker generates counterexamples which explain why FSMs are not equivalent. In summary, we solve the equivalence checking problem with model checking techniques. As a result of applying to several examples, we have many satisfiable results.

Mitigating the State Explosion Problem using Relay Model Checking (릴레이 모델 체킹을 이용한 상태 폭발 문제 해결)

  • 이태훈;권기현
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.11
    • /
    • pp.1560-1567
    • /
    • 2004
  • In temporal logic model checking, the number of states is exponentially increased by the size of a model. This is called the state explosion problem. Abstraction, partial order, symmetric, etc. are widely used to avoid the problem. They reduce a number of states by exploiting structural information in a model. Instead, this paper proposes the relay model checking that decomposes a temporal formula to be verified into several sub-formulas and then model checking them one by one. As a result, we solve complex games that can't handle with previous techniques.

Controlling a Traversal Strategy of Abstract Reachability Graph-based Software Model Checking (추상 도달가능성 그래프 기반 소프트웨어 모델체킹에서의 탐색전략 고려방법)

  • Lee, Nakwon;Baik, Jongmoon
    • Journal of KIISE
    • /
    • v.44 no.10
    • /
    • pp.1034-1044
    • /
    • 2017
  • Although traversal strategies are important for the performance of model checking, many studies have ignored the impact of traversal strategies in model checking with a block-encoded abstract reachability graph. Studies have considered traversal strategies only for an abstract reachability graph without block-encoding. Block encoding plays a crucial role in the model checking performance. This paper therefore describes Dual-traversal strategy, a simple and novel technique to control traversal strategies in a block-encoded abstract reachability graph. This method uses two traversal strategies for a model checking, one for effective block-encoding, and the other for traversal in an encoded abstract reachability graph. Dual-traversal strategy is very simple and can be implemented without overhead compared to the existing single-traversal strategy. We implemented the Dual-traversal strategy in an open source model checking tool and compare the performances of different traversal strategies. The results show that the model checking performance varies from the traversal strategies for the encoded abstract reachability graph.

A Study on the Rule Development for BIM-based Automatic Checking in a Duct System (덕트설비의 BIM 기반 자동검토를 위한 규칙개발에 관한 연구)

  • Song, Jong-Kwan;Cho, Geun-Ha;Ju, Ki-Beom
    • Korean Journal of Air-Conditioning and Refrigeration Engineering
    • /
    • v.25 no.11
    • /
    • pp.631-639
    • /
    • 2013
  • This study derives quality checking items in Building Mechanical Systems Design Criteria, and suggests quality criteria to review BIM models in the duct system of an air conditioning system for rule-based automatic checking. First, components for the duct system of an air conditioning system were reviewed, and the quality checking items were drawn from Building Mechanical Systems Design Criteria, through assessment according to object, attribute and relationship composing the BIM model. Second, quality checking types were derived, by analyzing the quality checking items and Rule set of the Solibri Model Checker. Finally, methods of algorithm functioning for checking the BIM models for mechanical systems in computers were drawn, and Elements to comprise the quality checking criteria (rule) were suggested. This study means that that checking items are derived from domestic criteria, and a way for the development process of determining quality checking criteria (rules) is suggested.

A Formal Specification and Checking Technique of Feature model using Z language (휘처 모델의 Z 정형 명세와 검사 기법)

  • Song, Chee-Yang;Cho, Eun-Sook;Kim, Chul-Jin
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.1
    • /
    • pp.123-136
    • /
    • 2013
  • The Feature model can not be guaranteed the syntactic accuracy of its model and be difficult the validation using automatic tool for its syntax, because this model is expressed by a graphical and informal structure in itself. Therefore, there is a need to formalize and check for the feature model, to precisely define syntax for construct of the model. This paper presents a Z formal specification and a model checking mechanism of the feature model to guarantee the correctness of the model. It first defines the translation rules between feature model and Z, and then converts the syntax of the feature model into the Z schema specification by applying these rules. Finally, the Z schema specification is checked syntax, type, and domain errors using the Z/Eves validation tool to assure the correctness of its specification, With the use of the proposed method, we may express more precisely the construct of the feature model. Moreover the domain analyst are able to usefully verify the errors of the generated feature model.

Computer Aided Drawing Check for CAD Systems A Method for the Checking of Dimensions in Mechanical Part Drawings (CAD시스템을 위한 컴퓨터원용 설계도면검도 -기계부품도의 치수검도방법 -)

  • 이성수
    • Korean Journal of Computational Design and Engineering
    • /
    • v.1 no.2
    • /
    • pp.97-106
    • /
    • 1996
  • Existing CAD systems do not provide advanced functions for automatic checking design and drafting errors in mechanical drawings. If the knowledge of checking in mechanical ddrsfting can be implemented into computers, CAD systems could automatically check for design and drafting errors. This paper describes a method for systematic checking of dimension errors. such as deficiency and/or redundancy of dimension input-errors in dimension figures and symbols, etc. The logic for finding dimensional errors is written by using a proccedural language. A geometric model and a topological-graph model are used in this method. Checking for deficiency and redundancy of dimensions is based upon graph Theory.

  • PDF

A Study on the Audit Framework for Web Contents and Design (웹 컨텐츠 및 디자인 중심의 감리모형 연구)

  • Kim, Dong-Soo;Baek, Hye-Jin;Kang, Jae-Hwa;Kim, Hee-Wan
    • Journal of Information Technology Services
    • /
    • v.8 no.4
    • /
    • pp.87-101
    • /
    • 2009
  • The current information system audit merely inspects a web based information system by focusing on checking items that are extracted from structured and information engineering model and object-oriented component model. As a result, the checking item of web contents and design is inadequate. This paper aims to extract audit framework in order to strengthen the audit of web contents and design during the development of the web based information system and to suggest checking items based on audit framework. For this, the web development process and web site evaluation model were studied, compared, and analyzed with the current information system development audit. From a result of the survey, it was found that the adequacy of the suggested audit framework and audit checking items is above the average value. It is believed that the suggested audit framework is helpful for the audit of web based information system.