Software Specification Refinement and Verification Method with I-Mathic Studio
نویسنده
چکیده
A software design usually manifests a composition of software specifications. It consists of hierarchies of black box and white box specifications which are subject to refinement verification. Refinement verification is a modelchecking process that proves the correctness of software specifications using formal methods. Although this is a powerful tool for developing reliable and robust software, the applied mathematics causes a serious gap between academics and software engineers. I-Mathic comprehends a software specification refinement and verification method and a supporting toolset, which aims at eliminating the gap through hiding the applied mathematics by practical modelling concepts. The model-checker FDR is used for refinement verification and detecting deadlocks and livelocks in software specifications. We have improved the method by incorporating CSP programming concepts into the specification language. These concepts make the method suitable for a broader class of safety-critical concurrent systems. The improved I-Mathic is illustrated in this paper.
منابع مشابه
Combining B and Alloy
In this paper we propose to combine two software verification approaches, theorem proving and model checking. We focus on the B-method and a theorem proving tool associated with it, and the Alloy specification notation and its model checker “Alloy Constraint Analyser”. We consider how software development in B can be assisted using Alloy and how Alloy can be used for verifying refinement of abs...
متن کاملAbstract Software Specifications and Automatic Proof of Refinement
Software Specifications and Automatic Proof of Refinement ∗ Claire Dross and Yannick Moy AdaCore, 46 rue d’Amsterdam, F-75009 Paris (France) {dross, moy}@adacore.com Abstract. It is common practice in critical software development, and compulsory in railway software developed according to EN 50128 standard, to separate software specification from software implementation. Verification activities...
متن کاملThe refinement check of added dynamic diagrams based on pi-calculus
As the semi-formal modeling tool, UML has semantics defaults which may cause confusions or even mistakes in refinement of models. -calculus is a formal specification based on process algebra, which can give strict semantics description for system behaviors. We seek to clearly define the semantics of refinement to a model through calculus and thus we are able to propose a formal verification m...
متن کاملA Semantic Formalization of UML-RT Models with csp+t Processes Applicable to Real-time Systems Verification
When a semi-formal language (like UML-RT) and a formal specification language (like CSP+T) are combined to obtain a Real-Time System (RTS) software specification, it is important to ensure the possibility of verifying the derived system design. A formal semantics of CSP+T temporal operators in terms of CSP trace semantics is presented here, and also a compositional refinement of CSP+T process t...
متن کاملSoftware Component Search based on Behavioral Specification
In this paper, we report on an ongoing project to develop search engines for software components hosted by object request brokers (ORBs). Behavioral specification based on hidden algebra is used to allow search by functionalities rather than syntactic features. An algebraic specification language system CafeOBJ is used to support automation such as signature matching, refinement verification, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006