2009
DOI: 10.1007/s00165-008-0074-7
|View full text |Cite
|
Sign up to set email alerts
|

FDR Explorer

Abstract: We describe: (1) the internal structures of FDR, the refinement model checker for Hoare's Communicating Sequential Processes (CSP); and (2) an application-programming interface (API) that allows users to interact more closely with FDR and to have finer-grain control over its behaviour and data structures. This API makes it possible to create optimised CSP code to perform refinement checks that are more space or time efficient, enabling the analysis of more complex and data-intensive specifications. The API can… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2009
2009
2014
2014

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 15 publications
0
2
0
Order By: Relevance
“…An experimental parallel implementation of FDR is described in [22]: states are randomly allocated between different computing nodes using a hash function; the state space is explored using a breadth-first search algorithm, and at the end of each level successor states are exchanged between the compute nodes. An alternative approach is that taken by FDR Explorer [23], whereby an API "makes possible to create optimised CSP code to perform refinement checks that are more space or time efficient, enabling the analysis of more complex and data-intensive specifications." Our approach involves partitioning the problem not at the level of the state space, but at the level of the CSP model -which means it is applicable only in certain scenarios, with one being the contribution of [19].…”
Section: Discussionmentioning
confidence: 99%
“…An experimental parallel implementation of FDR is described in [22]: states are randomly allocated between different computing nodes using a hash function; the state space is explored using a breadth-first search algorithm, and at the end of each level successor states are exchanged between the compute nodes. An alternative approach is that taken by FDR Explorer [23], whereby an API "makes possible to create optimised CSP code to perform refinement checks that are more space or time efficient, enabling the analysis of more complex and data-intensive specifications." Our approach involves partitioning the problem not at the level of the state space, but at the level of the CSP model -which means it is applicable only in certain scenarios, with one being the contribution of [19].…”
Section: Discussionmentioning
confidence: 99%
“…To succeed, some creativity will be required, since the CSP model (as it currently stands) runs into the resource limits of the FDR2 model-checker. One possible approach will be to use FDR Explorer [FW09] to assist us.…”
Section: Future Workmentioning
confidence: 99%