FDR Explorer

Authors:
Leo Freitas;Jim Woodcock
Affiliations:
Department of Computer Science, University of York, YO10 5DD York, UK;Department of Computer Science, University of York, YO10 5DD York, UK
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 5
Cited 0

Model-checking CSP

A classical mind
Formal methods: state of the art and future directions

ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
The Theory and Practice of Concurrency

The Theory and Practice of Concurrency
Hierarchical Compression for Model-Checking CSP or How to Check 1020 Dining Philosophers for Deadlock

TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
A Stubborn Attack On State Explosion

CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 one to interact more closely with, and have fine grained control over, FDR's behaviour and data structures. 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. This information is very valuable for both CSP users and tools that automatically generate CSP code, such as those related to security analysis generating test-cases as CSP processes. We also present a simple example of using the tool. Finally, we show how one can transform FDR's graph format into a graph notation (e.g., JGraph), hence enabling visualisation of Labelled Transition Systems (LTS) of CSP specifications.