State-rich model checking

Abstract

In this paper we survey the area of formal verification techniques, with emphasis on model checking due to its wide acceptance by both academia and industry. The major approaches and their characteristics are presented, together with the main problems faced while trying to apply them. With the increased complexity of systems, as well as interest in software correctness, the demand for more powerful automatic techniques is pushing the theories and tools towards integration. We discuss the state of the art in combining formal methods tools, mainly model checking with theorem proving and abstract interpretation. In particular, we present our own recent contribution on an approach to integrate model checking and theorem proving to handle staterich systems specified using a combination of Z and CSP.Keywords Model checking · Theorem proving · Abstract interpretation · Formal method tools Formal verification methodsThe growing complexity of new hardware technologies and software systems inevitably increases the complexity in the functionality of these artifacts. When more complex functionality becomes necessary, the likelihood of subtle errors increases, pushing the demand for development techniques that foster reliability and safety [19].The role of formal methods in computer science is analogous to the role of mathematical models and calculation in traditional engineering; see Table 1, which is based on information from [19]. Calculation can be used to predict the behaviour of a design while interacting with its environment. These calculations can be carried out in a series of steps towards the final implementation, guaranteeing the implementation of the original desired properties. This method

State Visibility and Communication in Unifying Theories of Programming

“…In addition to the work done on state-rich reactive processes in UTP [11], [2] there has been attention paid to this issue by others. The implementors of occam [12] had to deal with the integration of state with its concurrency aspects, those being derived from CSP.…”

FDR Explorer

“…More details on refinement model checking can be found in [Ros94,FWC06]. When we mention the comparison of two LTSs for mutually reachable paths, this is an abstraction of the actual corresponding operation on B-trees.…”

FDR Explorer

“…The granularity on the chosen model (m) enables the verification of different aspects of systems, such as safety properties on the traces model (T ), nondeterminism on the failures model (F), and divergent (or catastrophic/unpredictable) behaviour on the failures-divergences model (FD). More details on (refinement) model checking can be found in [14,6].…”