Deductive Reasoning versus Model Checking: Two Formal Approaches for System Development
نویسندگان
چکیده
We compare and contrast two formal approaches for system development: state-based notation with veriication by deductive reasoning, exempli-ed here by action systems; and event-based notation with veriication by model checking, here using CSP/FDR. Our purpose is to identify spe-ciic similarities and diierences, and strengths and weaknesses of the two approaches by direct comparison on the same application. We examine a small case study of a store-and-forward network speciied and reened using the two notations. Our work illustrates that diierent approaches lead to diierent developmental strategies and can reveal complementary aspects of a system, indicating that uniied techniques may be eeective.
منابع مشابه
A short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملLCF-style for Secure Verification Platform based on Multiway Decision Graphs
Formal verification of digital systems is achieved, today, using one of two main approaches: states exploration (mainly model checking and equivalence checking) or deductive reasoning (theorem proving). Indeed, the combination of the two approaches, states exploration and deductive reasoning promises to overcome the limitation and to enhance the capabilities of each. A comparison between both c...
متن کاملAn Update on STeP: Deductive-Algorithmic Verification of Reactive Systems
The Stanford Temporal Prover, STeP, is a tool for the computer-aided formal verification of reactive systems, including real-time and hybrid systems, based on their temporal specification. STeP integrates methods for deductive and algorithmic verification, including model checking, theorem proving, automatic invariant generation, abstraction and modular reasoning. We describe the most recent ve...
متن کاملA Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness
Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...
متن کاملFormal Validation of Behavioral Model using State Based and Event Based Approaches
A number of formal methods are available in literature for analysis and design of software as well as hardware systems. To choose a particular specification method, it depends on the character of the desired product. As the complexity of software increases, the need for reasoning about correct behaviour becomes more prominent. Formal methods are a set of techniques for analysis, verification, a...
متن کامل