CSP−based counter abstraction for systems with node identifiers

CSP−based counter abstraction for systems with node identifiers

Show other versions (1)

Detalhes bibliográficos
Main Authors:	Mazur, T, Lowe, G
Formato:	Journal article
Publicado em:	2013

Registos relacionados

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

Counter abstraction in the CSP/FDR setting
Por: Mazur, T, et al.
Publicado em: (2009)

Counter Abstraction in the CSP/FDR setting
Por: Mazur, T, et al.
Publicado em: (2007)

Formal verification of not fully symmetric systems using counter abstraction
Por: Mazur, T
Publicado em: (2008)

Extending CSP with tests for availability
Por: Lowe, G
Publicado em: (2009)

Extending CSP with tests for availability
Por: Lowe, G
Publicado em: (2009)

Models for CSP with availability information
Por: Lowe, G
Publicado em: (2010)

Probabilities and Priorities in Timed CSP
Por: Lowe, G
Publicado em: (1993)

Model Checking Systems with Replicated Components using CSP
Por: Mazur, T
Publicado em: (2011)

Analysing Security Protocols using CSP
Por: Lowe, G
Publicado em: (2011)

Probabilistic and Prioritized Models of Timed CSP
Por: Lowe, G
Publicado em: (1995)

Models for CSP with availability information
Por: Gavin Lowe
Publicado em: (2010-11-01)

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

Using CSP to Verify Sequential Consistency
Por: Lowe, G, et al.
Publicado em: (1999)

Using CSP to Verify Sequential Consistency
Por: Lowe, G, et al.
Publicado em: (1999)

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

Using CSP to detect errors in the TMN protocol
Por: Roscoe, A, et al.
Publicado em: (1996)

Using CSP to Detect Errors in the TMN Protocol
Por: Lowe, G, et al.
Publicado em: (1997)

Context-aware counter abstraction.
Por: Basler, G, et al.
Publicado em: (2010)

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

On CSP refinement tests that run multiple copies of a process
Por: Lowe, G
Publicado em: (2007)

Identifying efficiently solvable cases of Max CSP
Por: Cohen, D, et al.
Publicado em: (2004)

Implementing generalised alt - A case study in validated design using CSP
Por: Lowe, G
Publicado em: (2011)

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

The complexity of regular abstractions of one-counter languages
Por: Atig, M, et al.
Publicado em: (2016)

Unbounded nondeterminism in CSP
Por: Roscoe, A, et al.
Publicado em: (1989)

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

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

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

CSP202-CSP204 - PENGKOMPUTERAN SAINTIFIK - APRIL 1987.
Por: PPSKOM, Pusat Pengajian Sains Komputer
Publicado em: (1987)

Tyger: A Tool for Automatically Simulating CSP−Like Languages in CSP
Por: Gibson−Robinson, T
Publicado em: (2010)

View abstraction for systems with component identities
Por: Lowe, G
Publicado em: (2018)

VCEGAR: Verilog CounterExample Guided Abstraction Refinement
Por: Jain, H, et al.
Publicado em: (2007)

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

Classifying unbounded nondeterminism in CSP
Por: Barrett, G, et al.
Publicado em: (1991)

An Operational Semantics for CSP
Por: Roscoe, A, et al.
Publicado em: (1986)

Linking Z and CSP
Por: Hoare, C
Publicado em: (2015)

Taking quotients in CSP
Por: Goldsmith, M
Publicado em: (2006)

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

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