Filters








690 Hits in 6.0 sec

An Analytical and Experimental Comparison of CSP Extensions and Tools [chapter]

Ling Shi, Yang Liu, Jun Sun, Jin Song Dong, Gustavo Carvalho
2012 Lecture Notes in Computer Science  
We believe that the comparison is useful for the following reasons. Firstly, our comparison may guide users to select an appropriate modeling language.  ...  For instance, CSPM combines CSP with a functional programming language whereas CSP# integrates high-level CSP-like process operators with low-level procedure code.  ...  Acknowledgment The authors would like to thank Bill Roscoe for the review and suggestions on benchmarks for FDR, Michael Leuschel for the help on using ProB, and Augusto Sampaio, Alexandre Mota and Tarciana  ... 
doi:10.1007/978-3-642-34281-3_27 fatcat:plle7hcumfc6pogznq5h7p3anq

Model-checking CSP-Z [chapter]

Alexandre Mota, Augusto Sampaio
1998 Lecture Notes in Computer Science  
Finally, we present a subset of a CSP-Z formal specification of a real Brazilian artificial microsatellite, and use FDR to check that the specification is deadlock-free. Definition 10.  ...  Another increasingly research area is formal language integration where the capabilities of each language are used to capture precisely some aspects of a system.  ...  We also thank Clemens Fischer and Paulo Borba for discussions about CSP-Z and FDR, and for suggestions and criticisms which helped us to improve our approach to model-checking CSP-Z.  ... 
doi:10.1007/bfb0053592 fatcat:le7i7fosdrhspdeiqxf7a3ukky

Model Checking LTL Formulae in RAISE with FDR [chapter]

Abigail Parisaca Vargas, Ana G. Garis, S. Lizeth Tapia Tarifa, Chris George
2009 Lecture Notes in Computer Science  
To apply model checking to RSL concurrent descriptions, we translate RSL specifications into the input language CSPM of FDR. FDR is the model checker for the process algebra CSP.  ...  Second, RSL uses Linear Temporal Logic (LTL) to specify desired properties, but FDR does not support LTL. LTL formulas may be translated to CSP test processes in order to check them with FDR.  ...  In this paper, we describe the steps we followed in order to model check Raise Specification Language (RSL) descriptions using the CSP model checker FDR [10] .  ... 
doi:10.1007/978-3-642-00255-7_16 fatcat:e5k5r5q3wre7fbms6h7ir3t3du

Checking process-oriented operating system behaviour using CSP and refinement

Frederick R. M. Barnes, Carl G. Ritson
2009 Proceedings of the Fifth Workshop on Programming Languages and Operating Systems - PLOS '09  
The work described in this paper relates to the automatic model generation and verification of systems developed in processoriented languages.  ...  Process orientation is an approach to concurrency that uses concepts of processes and message-passing communication, with whole systems constructed from layered and dynamically evolving networks of communicating  ...  For this we use the FDR tool, whose input is a CSPM script. MODEL CHECKING OS COMPONENTS We have modified the occam-π compiler to generate a CSP-like representation of a program's behaviour.  ... 
doi:10.1145/1745438.1745440 dblp:conf/sosp/BarnesR09 fatcat:5pa6wqrjw5gn3kfbrsg4nqwjze

Checking process-oriented operating system behaviour using CSP and refinement

Frederick R.M. Barnes, Carl G. Ritson
2010 ACM SIGOPS Operating Systems Review  
The work described in this paper relates to the automatic model generation and verification of systems developed in processoriented languages.  ...  Process orientation is an approach to concurrency that uses concepts of processes and message-passing communication, with whole systems constructed from layered and dynamically evolving networks of communicating  ...  For this we use the FDR tool, whose input is a CSPM script. MODEL CHECKING OS COMPONENTS We have modified the occam-π compiler to generate a CSP-like representation of a program's behaviour.  ... 
doi:10.1145/1713254.1713265 fatcat:mg2ooulc5jc7do3bofoykux2y4

FDR Explorer

Leo Freitas, Jim Woodcock
2008 Formal Aspects of Computing  
In this paper we describe the internal structures of FDR, the refinement model checker for Hoare's Communicating Sequential Processes (CSP), as well as an Application Programming Interface (API) allowing  ...  With such information it is possible to create optimised CSP code to perform refinement checks that are more space/time efficient, hence enabling the analysis of more complex and data intensive specifications  ...  It has also been used by other people in test case generation using CSP and FDR, and Java code generation tools for this new concurrent language.  ... 
doi:10.1007/s00165-008-0074-7 fatcat:5y7zqdpmevg5rnsaxnh2eu52yq

FDR Explorer

Leo Freitas, Jim Woodcock
2007 Electronical Notes in Theoretical Computer Science  
In this paper we describe the internal structures of FDR, the refinement model checker for Hoare's Communicating Sequential Processes (CSP), as well as an Application Programming Interface (API) allowing  ...  With such information it is possible to create optimised CSP code to perform refinement checks that are more space/time efficient, hence enabling the analysis of more complex and data intensive specifications  ...  It has also been used by other people in test case generation using CSP and FDR, and Java code generation tools for this new concurrent language.  ... 
doi:10.1016/j.entcs.2006.08.042 fatcat:prnpthq7sfan3g5lgridpwl52a

Offline Runtime Verification of Safety Requirements using CSP [article]

Matt Luckcuck
2021 arXiv   pre-print
Using the workflow we manually derive a Communicating Sequential Processes (CSP) model from natural-language safety requirements documents, which Varanus uses as the monitor oracle.  ...  This reuse of the model means that the monitor oracle does not have to be developed separately, risking inconsistencies between it and the model for static verification.  ...  Again, we use FDR to check that the model of the system implements HMM 2.  ... 
arXiv:2007.03522v3 fatcat:ap3stj3tszfhrobleirx73hvba

A framework for verifying deadlock and nondeterminism in UML activity diagrams based on CSP [article]

Lucas Lima, Amaury Tavares, Sidney C. Nogueira
2019 arXiv   pre-print
It introduces a compositional CSP semantics for activity diagrams that is used to automatically generate CSP specifications from UML models.  ...  The tool keeps the traceability between a diagram and its CSP specification. It parses the FDR results to highlight the diagram paths that lead to a deadlock or a nondeterministic behavior.  ...  Moreover, FDR is a mature CSP model checker that provides deadlock and determinism checking. Finally, we can use FDR for checking refinement, which we plan to explore in the future.  ... 
arXiv:1910.13638v1 fatcat:bypw3sblxffjrhbeatijtqb6m4

Compositional CSP Traces Refinement Checking

Heike Wehrheim, Daniel Wonisch
2009 Electronical Notes in Theoretical Computer Science  
The approach has been implemented using the CSP model checker FDR as teacher during learning.  ...  In this paper, we transfer this technique to a setting with CSP as modelling and property specification language, and present an approach to compositional traces refinement checking.  ...  (n − 1)} In order to verify these refinements we can for instance use the CSP model checker FDR.  ... 
doi:10.1016/j.entcs.2009.08.022 fatcat:hqapahxffjbuxnbbarnrraxaoy

Formal Verification of Tokeneer Behaviours Modelled in fUML Using CSP [chapter]

Islam Abdelhalim, James Sharp, Steve Schneider, Helen Treharne
2010 Lecture Notes in Computer Science  
To illustrate the approach, we use the modelling of the Tokeneer ID Station specifications into fUML, and formalize them in CSP to check if the model is deadlock free.  ...  In this paper we propose using a subset of fUML (Foundational Subset for Executable UML) as a semi-formal language, and formalizing it to the process algebraic specification language CSP, to make use of  ...  Acknowledgments Thanks to Michael Goldsmith and Philip Armstrong for discussion about implementing the buffer in CSP. Thanks also to Ian Wilkie for his helpful information about fUML.  ... 
doi:10.1007/978-3-642-16901-4_25 fatcat:pirinwhlvbf33dtaayuqcldzo4

Model-checking CSP-Z: strategy, tool support and industrial application

Alexandre Mota, Augusto Sampaio
2001 Science of Computer Programming  
In this paper we propose a general strategy for model-checking CSP-Z speciÿcations using as tool support the FDR model-checker.  ...  We also present a modular approach for model-checking complex CSP-Z speciÿcations, speciÿcally to verify deadlock-freedom.  ...  We also thank Clemens Fischer and Paulo Borba for discussions about CSP-Z and FDR, and for suggestions and criticisms which helped us to improve our approach to model-checking CSP-Z.  ... 
doi:10.1016/s0167-6423(00)00023-x fatcat:hj56sf522fcd5dmbynoq2znqky

Checking the Validity of Scenarios in UML Models [chapter]

Holger Rasch, Heike Wehrheim
2005 Lecture Notes in Computer Science  
checker (FDR) for checking their validity.  ...  For validating them in a UML model, we translate both model and sequence diagrams into a formal specification language (the process algebra CSP), and develop procedures for employing the standard CSP model  ...  It is based on the semantic models of CSP. To see how we can use FDR for checking validity of sequence diagrams we first give a short summary of CSP's semantic models.  ... 
doi:10.1007/11494881_5 fatcat:e55xlxu2ibf3xnsgyhemsyn66a

How to Make FDR Spin LTL Model Checking of CSP by Refinement [chapter]

Michael Leuschel, Andrew Currie, Thierry Massart
2001 Lecture Notes in Computer Science  
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 study the possibility of doing LTL model checking on CSP specifications in the context of refinement.  ...  We also would like to thank David Jackson for some insightful comments about FDR.  ... 
doi:10.1007/3-540-45251-6_6 fatcat:s3kvuv2yj5e2ddsbveop4nwb6e

Verifying end-to-end protocols using induction with CSP/FDR [chapter]

S. J. Creese, Joy Reed
1999 Lecture Notes in Computer Science  
Our models are presented in a version of CSP allowing automatic veri cation with the FDR software tool. They encompass both inductive and non-inductive behaviours.  ...  We model aspects of a protocol for multiservice networks, and demonstrate how the technique can be used to verify end-to-end properties of protocols designed for arbitrary numbers of intermediate nodes  ...  Acknowledgements The authors would like to thank Michael Goldsmith, Bryan Scattergood, Bill Roscoe and Carroll Morgan for valuable advice and discussions.  ... 
doi:10.1007/bfb0098006 fatcat:2v6aqe6slrhblme2ksjyjmez2i
« Previous Showing results 1 — 15 out of 690 results