A representative function approach to symmetry exploitation for CSP refinement checking

A representative function approach to symmetry exploitation for CSP refinement checking

Show other versions (3)

Detalhes bibliográficos
Main Authors:	Moffat, N, Goldsmith, M, Roscoe, A
Formato:	Conference item
Publicado em:	2008

Registos relacionados

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

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

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

Towards Symmetry Aware Refinement Checking (Extended Abstract)
Por: Moffat, N, et al.
Publicado em: (2007)

Assumption-commitment support for CSP model checking
Por: Moffat, N, et al.
Publicado em: (2008)

Assumption–Commitment Support for CSP Model Checking
Por: Moffat, N, et al.
Publicado em: (2008)

Assumption−Commitment Support for CSP Model Checking
Por: Moffat, N, et al.
Publicado em: (2008)

Assumption−Commitment Support for CSP Model Checking
Por: Moffat, N, et al.
Publicado em: (2006)

Model−checking CSP
Por: A. W. Roscoe
Publicado em: (1994)

Symmetry reduction in CSP model checking
Por: Gibson-Robinson, T, et al.
Publicado em: (2019)

Checking noninterference in Timed CSP
Por: Roscoe, A, et al.
Publicado em: (2013)

CSP and timewise refinement
Por: Roscoe, A, et al.
Publicado em: (1991)

On the expressive power of CSP refinement
Por: Roscoe, A
Publicado em: (2003)

Model checking Timed CSP
Por: Armstrong, P, et al.
Publicado em: (2012)

Hierarchical compression for model−checking CSP or how to check 10 20 dining philosophers for deadlock
Por: Roscoe, A, et al.
Publicado em: (1995)

SAT solving in CSP trace refinement
Por: Palikareva, H, et al.
Publicado em: (2012)

SAT−solving in CSP trace refinement
Por: Palikareva, H, et al.
Publicado em: (2011)

SAT-solving in CSP trace refinement
Por: Palikareva, H, et al.
Publicado em: (2012)

SAT−Solving in CSP Trace Refinement
Por: Palikareva, H, et al.
Publicado em: (2012)

FDR3 — A Modern Refinement Checker for CSP
Por: Gibson−Robinson, T, et al.
Publicado em: (2014)

Hierarchical compression for model−checking CSP‚ or How to check 10^20 dining philosophers for deadlock
Por: Roscoe, A, et al.
Publicado em: (1995)

Finitary refinement checks for infinitary specifications
Por: Roscoe, A
Publicado em: (2004)

Refinement checking for privacy policies.
Por: Papanikolaou, N, et al.
Publicado em: (2012)

Refinement checking for privacy policies
Por: Papanikolaou, N, et al.
Publicado em: (2012)

Refinement Checking for Privacy Policies
Por: Goldsmith, S
Publicado em: (2011)

Refinement Checking for Privacy Policies
Por: Goldsmith, S
Publicado em: (2011)

Watchdog transformations for property−oriented model checking
Por: Roscoe, A, et al.
Publicado em: (2003)

Watchdog Transformations for Property−Oriented Model−Checking
Por: Goldsmith, M, et al.
Publicado em: (2003)

Watchdog transformations for property−oriented model−checking
Por: Goldsmith, M, et al.
Publicado em: (2003)

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

Policy Refinement Checking (extended abstract)
Por: Goldsmith, S
Publicado em: (2009)

Relating Data Independent Trace Checks in CSP with UNITY Reachability under a Normality Assumption
Por: Roscoe, A, et al.
Publicado em: (2004)

On the expressiveness of CSP
Por: Roscoe, A
Publicado em: (2011)

Refinement in Object−Z and CSP
Por: Bolton, C, et al.
Publicado em: (2002)

The expressiveness of CSP with priority
Por: Roscoe, A
Publicado em: (2015)

Unbounded nondeterminism in CSP
Por: Roscoe, A
Publicado em: (1988)

CSP files
Por: Roscoe, T, et al.
Publicado em: (2011)

The perfect ‘spy’ for model−checking cryptoprotocols
Por: Roscoe, A, et al.
Publicado em: (1997)

Developing and verifying protocols in CSP
Por: Roscoe, A
Publicado em: (1993)

CSP is expressive enough for pi
Por: Roscoe, A
Publicado em: (2010)