SAT-solving in CSP trace refinement

SAT-solving in CSP trace refinement

Show other versions (3)

Xehetasun bibliografikoak
Egile Nagusiak:	Palikareva, H, Ouaknine, J, Roscoe, A
Formatua:	Journal article
Argitaratua:	2012

Antzeko izenburuak

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

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

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

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

Static Livelock Analysis in CSP
nork: Ouaknine, J, et al.
Argitaratua: (2011)

Static livelock analysis in CSP
nork: Ouaknine, J, et al.
Argitaratua: (2011)

Static Livelock Analysis in CSP
nork: Ouaknine, J, et al.
Argitaratua: (2011)

CSP and timewise refinement
nork: Roscoe, A, et al.
Argitaratua: (1991)

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

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

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

On the expressive power of CSP refinement
nork: Roscoe, A
Argitaratua: (2003)

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

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

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

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

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

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

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

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

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

Model checking Timed CSP
nork: Armstrong, P, et al.
Argitaratua: (2012)

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

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

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

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

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

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

On the expressiveness of CSP
nork: Roscoe, A
Argitaratua: (2011)

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

CSP files
nork: Roscoe, T, et al.
Argitaratua: (2011)

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

The expressiveness of CSP with priority
nork: Roscoe, A
Argitaratua: (2015)

Unbounded nondeterminism in CSP
nork: Roscoe, A
Argitaratua: (1988)

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

Timed CSP: a retrospective
nork: Ouaknine, J, et al.
Argitaratua: (2006)

Model−checking CSP
nork: A. W. Roscoe
Argitaratua: (1994)

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

Unbounded nondeterminism in CSP
nork: Roscoe, A, et al.
Argitaratua: (1989)

Developing and verifying protocols in CSP
nork: Roscoe, A
Argitaratua: (1993)