Add to ORKGWe study the possibility of doing LTL model checking on CSP specifications in the context of refinement. We present evidence that the refinement-based approach to verification does not seem to be very well suited for verifying certain temporal properties. To remedy this problem, we show how to (and how not to) perform LTL model checking of CSP processes using refinement checking in general and the FDR tool in particular. We show how one can handle (potentially) deadlocking systems, discuss the validity of our approach for infinite state systems, and shed light on the relationship between "classical" model checking and refinement checking
Consistency between a process and its specification expressed in CSP is typically presented as a ref...
In model-driven software development, models and model refinements are used to create software. To a...
In this paper, we consider how refinements between state-based specifications (e.g., written in Z) c...
We show how to (and how not to) perform LTL model checking of CSP processes using refinement checkin...
We study the possibility of doing LTL model checking on CSP specifications in the context of refinem...
TheRaise SpecificationLanguage (RSL) is a modeling languagewhich supports various specification styl...
AbstractIn this paper we describe the internal structures of FDR, the refinement model checker for H...
We describe and report upon various substantial extensions of the CSP refinement checker FDR includi...
Effective temporal logic model checking algorithms exist that exploit symmetries arising from parall...
Since state-rich formalism [Figure not available: see fulltext.] is a combination of Z, CSP, refinem...
Abstract. FDR3 is a complete rewrite of the CSP refinement checker FDR2, incorporating a significant...
As software and hardware systems grow more complex and we begin to rely more on their correctness a...
The Raise Specification Language (RSL) is a broad spectrum modeling language which supports a wide r...
This paper investigates model checking Object-Z classes via their translation to the input notation ...
AbstractModel-checking is now widely accepted as an efficient method for analysing computer system p...
Consistency between a process and its specification expressed in CSP is typically presented as a ref...
In model-driven software development, models and model refinements are used to create software. To a...
In this paper, we consider how refinements between state-based specifications (e.g., written in Z) c...
We show how to (and how not to) perform LTL model checking of CSP processes using refinement checkin...
We study the possibility of doing LTL model checking on CSP specifications in the context of refinem...
TheRaise SpecificationLanguage (RSL) is a modeling languagewhich supports various specification styl...
AbstractIn this paper we describe the internal structures of FDR, the refinement model checker for H...
We describe and report upon various substantial extensions of the CSP refinement checker FDR includi...
Effective temporal logic model checking algorithms exist that exploit symmetries arising from parall...
Since state-rich formalism [Figure not available: see fulltext.] is a combination of Z, CSP, refinem...
Abstract. FDR3 is a complete rewrite of the CSP refinement checker FDR2, incorporating a significant...
As software and hardware systems grow more complex and we begin to rely more on their correctness a...
The Raise Specification Language (RSL) is a broad spectrum modeling language which supports a wide r...
This paper investigates model checking Object-Z classes via their translation to the input notation ...
AbstractModel-checking is now widely accepted as an efficient method for analysing computer system p...
Consistency between a process and its specification expressed in CSP is typically presented as a ref...
In model-driven software development, models and model refinements are used to create software. To a...
In this paper, we consider how refinements between state-based specifications (e.g., written in Z) c...