SAT-solving in CSP trace refinement

SAT-solving in CSP trace refinement

Show other versions (3)

Bibliographic Details
Main Authors:	Palikareva, H, Ouaknine, J, Roscoe, A
Format:	Journal article
Published:	2012

Similar Items

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)

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

Static Livelock Analysis in CSP
by: Ouaknine, J, et al.
Published: (2011)

Static livelock analysis in CSP
by: Ouaknine, J, et al.
Published: (2011)

Static Livelock Analysis in CSP
by: Ouaknine, J, et al.
Published: (2011)

A Static Analysis Framework for Livelock Freedom in CSP
by: Ouaknine, J, et al.
Published: (2012)

A Static Analysis Framework for Livelock Freedom in CSP
by: Ouaknine, J, et al.
Published: (2013)

A Static Analysis Framework for Livelock Freedom in CSP
by: Ouaknine, J, et al.
Published: (2013)

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

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

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

Reducing complex CSP models to traces via priority
by: Mestel, D, et al.
Published: (2016)

Backdoors into heterogeneous classes of SAT and CSP
by: Gaspers, S, et al.
Published: (2014)

Backdoors into heterogeneous classes of SAT and CSP
by: Gaspers, S, et al.
Published: (2016)

Backdoors into heterogeneous classes of SAT and CSP
by: Gaspers, S, et al.
Published: (2016)

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

Translating timed automata to tock-CSP
by: Khattri, M, et al.
Published: (2011)

Translating Timed Automata to Tock−CSP
by: Khattri, M, et al.
Published: (2011)

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

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

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)

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

The order encoding: from tractable CSP to tractable SAT
by: Petke, J, et al.
Published: (2011)

The order encoding: From tractable CSP to tractable SAT
by: Petke, J, et al.
Published: (2011)

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

The order encoding: from tractable CSP to tractable SAT (extended abstract)
by: Petke, J, et al.
Published: (2011)

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

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

Efficient verification of concurrent systems using synchronisation analysis and SAT/SMT solving
by: Antonino, P, et al.
Published: (2019)

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

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

Timed CSP: a retrospective
by: Ouaknine, J, et al.
Published: (2006)

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

Efficient verification of comcurrent systems using local analysis based approximations and SAT solving
by: Antonino, P, et al.
Published: (2019)

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

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