CSP−based counter abstraction for systems with node identifiers

CSP−based counter abstraction for systems with node identifiers

Veure altres versions (1)

Dades bibliogràfiques
Autors principals:	Mazur, T, Lowe, G
Format:	Journal article
Publicat:	2013

Ítems similars

CSP-based counter abstraction for systems with node identifiers
per: Mazur, T, et al.
Publicat: (2014)

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

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

Formal verification of not fully symmetric systems using counter abstraction
per: Mazur, T
Publicat: (2008)

Extending CSP with tests for availability
per: Lowe, G
Publicat: (2009)

Extending CSP with tests for availability
per: Lowe, G
Publicat: (2009)

Models for CSP with availability information
per: Lowe, G
Publicat: (2010)

Probabilities and Priorities in Timed CSP
per: Lowe, G
Publicat: (1993)

Model Checking Systems with Replicated Components using CSP
per: Mazur, T
Publicat: (2011)

Analysing Security Protocols using CSP
per: Lowe, G
Publicat: (2011)

Probabilistic and Prioritized Models of Timed CSP
per: Lowe, G
Publicat: (1995)

Models for CSP with availability information
per: Gavin Lowe
Publicat: (2010-11-01)

Symmetry reduction in CSP model checking
per: Gibson-Robinson, T, et al.
Publicat: (2019)

Using CSP to Verify Sequential Consistency
per: Lowe, G, et al.
Publicat: (1999)

Using CSP to Verify Sequential Consistency
per: Lowe, G, et al.
Publicat: (1999)

Model checking Timed CSP
per: Armstrong, P, et al.
Publicat: (2012)

Using CSP to detect errors in the TMN protocol
per: Roscoe, A, et al.
Publicat: (1996)

Using CSP to Detect Errors in the TMN Protocol
per: Lowe, G, et al.
Publicat: (1997)

Context-aware counter abstraction.
per: Basler, G, et al.
Publicat: (2010)

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

On CSP refinement tests that run multiple copies of a process
per: Lowe, G
Publicat: (2007)

Identifying efficiently solvable cases of Max CSP
per: Cohen, D, et al.
Publicat: (2004)

Implementing generalised alt - A case study in validated design using CSP
per: Lowe, G
Publicat: (2011)

Using CSP to Detect Insertion and Evasion Possibilities within the Intrusion Detection Area
per: Rohrmair, G, et al.
Publicat: (2002)

The complexity of regular abstractions of one-counter languages
per: Atig, M, et al.
Publicat: (2016)

Unbounded nondeterminism in CSP
per: Roscoe, A, et al.
Publicat: (1989)

CSP files
per: Roscoe, T, et al.
Publicat: (2011)

On the expressiveness of CSP
per: Roscoe, A
Publicat: (2011)

CSP and timewise refinement
per: Roscoe, A, et al.
Publicat: (1991)

CSP202-CSP204 - PENGKOMPUTERAN SAINTIFIK - APRIL 1987.
per: PPSKOM, Pusat Pengajian Sains Komputer
Publicat: (1987)

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

View abstraction for systems with component identities
per: Lowe, G
Publicat: (2018)

VCEGAR: Verilog CounterExample Guided Abstraction Refinement
per: Jain, H, et al.
Publicat: (2007)

Introduction to CEGAR —Counter-Example Guided Abstraction Refinement
per: M. U. Mandrykin, et al.
Publicat: (2018-10-01)

Classifying unbounded nondeterminism in CSP
per: Barrett, G, et al.
Publicat: (1991)

An Operational Semantics for CSP
per: Roscoe, A, et al.
Publicat: (1986)

Linking Z and CSP
per: Hoare, C
Publicat: (2015)

Taking quotients in CSP
per: Goldsmith, M
Publicat: (2006)

The expressiveness of CSP with priority
per: Roscoe, A
Publicat: (2015)

Unbounded nondeterminism in CSP
per: Roscoe, A
Publicat: (1988)