FDR3 — A Modern Refinement Checker for CSP

FDR3 — A Modern Refinement Checker for CSP

Bibliographic Details
Main Authors:	Gibson−Robinson, T, Armstrong, P, Boulgakov, A, Roscoe, A
Format:	Conference item
Published:	2014

Similar Items

Verifying Statemate Statecharts Using CSP and FDR
by: Roscoe, A, et al.
Published: (2006)

Compiling Statemate Statecharts into CSP and verifying them using FDR
by: Roscoe, A
Published: (2003)

Modelling and verifying key−exchange protocols using CSP and FDR
by: Roscoe, A
Published: (1995)

FDR into The Cloud
by: Gibson−Robinson, T, et al.
Published: (2014)

Counter Abstraction in the CSP/FDR setting
by: Mazur, T, et al.
Published: (2007)

Counter abstraction in the CSP/FDR setting
by: Mazur, T, et al.
Published: (2009)

CSP and timewise refinement
by: Roscoe, A, et al.
Published: (1991)

On the expressive power of CSP refinement
by: Roscoe, A
Published: (2003)

Critical systems validation and verification with CSP and FDR
by: Goldsmith, M, et al.
Published: (1999)

SAT−Solving in CSP Trace Refinement
by: Palikareva, H, et al.
Published: (2012)

SAT solving in CSP trace refinement
by: Palikareva, H, et al.
Published: (2012)

SAT-solving in CSP trace refinement
by: Palikareva, H, et al.
Published: (2012)

SAT−solving in CSP trace refinement
by: Palikareva, H, et al.
Published: (2011)

Recent developments in FDR
by: Armstrong, P, et al.
Published: (2012)

Recent Developments in FDR
by: Armstrong, P, et al.
Published: (2012)

Recent developments in FDR
by: Armstrong, P, et al.
Published: (2012)

Recent developments in FDR
by: Armstrong, P, et al.
Published: (2012)

Empirical analysis and optimization of an NP−hard problem using CSP and FDR
by: Creager, D, et al.
Published: (2007)

FDR2 user manual
by: Gardiner, P, et al.
Published: (2000)

A representative function approach to symmetry exploitation for CSP refinement checking
by: Moffat, N, et al.
Published: (2008)

Building a refinement checker for Z
by: Anthony J.H. Simons, et al.
Published: (2011-06-01)

Translating CSP trace refinement to UNITY unreachability : a study in data independence
by: Roscoe, A, et al.
Published: (2015)

A representative function approach to symmetry exploitation for CSP refinement checking
by: Moffat, N, et al.
Published: (2008)

A Representative Function Approach to Symmetry Exploitation for CSP Refinement Checking
by: Moffat, N, et al.
Published: (2008)

A Representative Function Approach to Symmetry Exploitation for CSP Refinement Checking
by: Moffat, N, et al.
Published: (2008)

Model checking Timed CSP
by: Armstrong, P, et al.
Published: (2012)

Computing maximal weak and other bisimulations
by: Roscoe, A, et al.
Published: (2015)

On the expressiveness of CSP
by: Roscoe, A
Published: (2011)

Faster FDR Counterexample Generation Using SAT−Solving
by: Palikareva, H, et al.
Published: (2009)

Tyger: A Tool for Automatically Simulating CSP−Like Languages in CSP
by: Gibson−Robinson, T
Published: (2010)

Refinement in Object−Z and CSP
by: Bolton, C, et al.
Published: (2002)

Unbounded nondeterminism in CSP
by: Roscoe, A
Published: (1988)

The expressiveness of CSP with priority
by: Roscoe, A
Published: (2015)

Web Services Security: a preliminary study using Casper and FDR
by: Roscoe, A, et al.
Published: (2004)

Verifying an infinite family of inductions simultaneously using data independence and FDR
by: Roscoe, A, et al.
Published: (1999)

Model−checking CSP
by: A. W. Roscoe
Published: (1994)

CSP files
by: Roscoe, T, et al.
Published: (2011)

CSP is expressive enough for pi
by: Roscoe, A
Published: (2010)

Developing and verifying protocols in CSP
by: Roscoe, A
Published: (1993)

Unbounded nondeterminism in CSP
by: Roscoe, A, et al.
Published: (1989)