@incollection{gibson-robinson_fdr3modern_2014,
	title = {{FDR}3—{A} modern refinement checker for {CSP}},
	url = {https://www.cs.ox.ac.uk/files/6001/Document.pdf},
	abstract = {FDR3 is a complete rewrite of the CSP refinement checker FDR2, incorporating a significant number of enhancements. In this paper we describe the operation of FDR3 at a high level and then give a detailed description of several of its more important innovations. This includes the new multi-core refinement-checking algorithm that is able to achieve a near linear speed up as the number of cores increase. Further, we describe the new algorithm that FDR3 uses to construct its internal representation of CSP processes—this algorithm is more efficient than FDR2’s, and is able to compile a large class of CSP processes to more efficient internal representations. We also present experimental results that compare FDR3 to related tools, which show it is unique (as far as we know) in being able to scale beyond the bounds of main memory.},
	booktitle = {Tools and {Algorithms} for the {Construction} and {Analysis} of {Systems}},
	publisher = {Springer},
	author = {Gibson-Robinson, Thomas and Armstrong, Philip and Boulgakov, Alexandre and Roscoe, Andrew W},
	year = {2014},
	note = {00051 
bibtex: GABR14},
	pages = {187--201}
}

{"_id":"CXx7pCw4xH3ZSnypE","bibbaseid":"gibsonrobinson-armstrong-boulgakov-roscoe-fdr3amodernrefinementcheckerforcsp-2014","downloads":0,"creationDate":"2016-05-30T09:53:21.438Z","title":"FDR3—A modern refinement checker for CSP","author_short":["Gibson-Robinson, T.","Armstrong, P.","Boulgakov, A.","Roscoe, A. W"],"year":2014,"bibtype":"incollection","biburl":"https://api.zotero.org/users/2345845/collections/WG9KFXBW/items?key=9zfUPfSwh2adWPrQ5jSqh7vN&format=bibtex&limit=100i","bibdata":{"bibtype":"incollection","type":"incollection","title":"FDR3—A modern refinement checker for CSP","url":"https://www.cs.ox.ac.uk/files/6001/Document.pdf","abstract":"FDR3 is a complete rewrite of the CSP refinement checker FDR2, incorporating a significant number of enhancements. In this paper we describe the operation of FDR3 at a high level and then give a detailed description of several of its more important innovations. This includes the new multi-core refinement-checking algorithm that is able to achieve a near linear speed up as the number of cores increase. Further, we describe the new algorithm that FDR3 uses to construct its internal representation of CSP processes—this algorithm is more efficient than FDR2’s, and is able to compile a large class of CSP processes to more efficient internal representations. We also present experimental results that compare FDR3 to related tools, which show it is unique (as far as we know) in being able to scale beyond the bounds of main memory.","booktitle":"Tools and Algorithms for the Construction and Analysis of Systems","publisher":"Springer","author":[{"propositions":[],"lastnames":["Gibson-Robinson"],"firstnames":["Thomas"],"suffixes":[]},{"propositions":[],"lastnames":["Armstrong"],"firstnames":["Philip"],"suffixes":[]},{"propositions":[],"lastnames":["Boulgakov"],"firstnames":["Alexandre"],"suffixes":[]},{"propositions":[],"lastnames":["Roscoe"],"firstnames":["Andrew","W"],"suffixes":[]}],"year":"2014","note":"00051 bibtex: GABR14","pages":"187--201","bibtex":"@incollection{gibson-robinson_fdr3modern_2014,\n\ttitle = {{FDR}3—{A} modern refinement checker for {CSP}},\n\turl = {https://www.cs.ox.ac.uk/files/6001/Document.pdf},\n\tabstract = {FDR3 is a complete rewrite of the CSP refinement checker FDR2, incorporating a significant number of enhancements. In this paper we describe the operation of FDR3 at a high level and then give a detailed description of several of its more important innovations. This includes the new multi-core refinement-checking algorithm that is able to achieve a near linear speed up as the number of cores increase. Further, we describe the new algorithm that FDR3 uses to construct its internal representation of CSP processes—this algorithm is more efficient than FDR2’s, and is able to compile a large class of CSP processes to more efficient internal representations. We also present experimental results that compare FDR3 to related tools, which show it is unique (as far as we know) in being able to scale beyond the bounds of main memory.},\n\tbooktitle = {Tools and {Algorithms} for the {Construction} and {Analysis} of {Systems}},\n\tpublisher = {Springer},\n\tauthor = {Gibson-Robinson, Thomas and Armstrong, Philip and Boulgakov, Alexandre and Roscoe, Andrew W},\n\tyear = {2014},\n\tnote = {00051 \nbibtex: GABR14},\n\tpages = {187--201}\n}\n\n","author_short":["Gibson-Robinson, T.","Armstrong, P.","Boulgakov, A.","Roscoe, A. W"],"key":"gibson-robinson_fdr3modern_2014","id":"gibson-robinson_fdr3modern_2014","bibbaseid":"gibsonrobinson-armstrong-boulgakov-roscoe-fdr3amodernrefinementcheckerforcsp-2014","role":"author","urls":{"Paper":"https://www.cs.ox.ac.uk/files/6001/Document.pdf"},"downloads":0},"search_terms":["fdr3","modern","refinement","checker","csp","gibson-robinson","armstrong","boulgakov","roscoe"],"keywords":[],"authorIDs":[],"dataSources":["5wuvXcjZdiAp3GLdi"]}