CSP−based counter abstraction for systems with node identifiers

CSP−based counter abstraction for systems with node identifiers

Afficher d'autres versions (1)

Détails bibliographiques
Auteurs principaux:	Mazur, T, Lowe, G
Format:	Journal article
Publié:	2013

Documents similaires

CSP-based counter abstraction for systems with node identifiers
par: Mazur, T, et autres
Publié: (2014)

Counter abstraction in the CSP/FDR setting
par: Mazur, T, et autres
Publié: (2009)

Counter Abstraction in the CSP/FDR setting
par: Mazur, T, et autres
Publié: (2007)

Formal verification of not fully symmetric systems using counter abstraction
par: Mazur, T
Publié: (2008)

Extending CSP with tests for availability
par: Lowe, G
Publié: (2009)

Extending CSP with tests for availability
par: Lowe, G
Publié: (2009)

Models for CSP with availability information
par: Lowe, G
Publié: (2010)

Probabilities and Priorities in Timed CSP
par: Lowe, G
Publié: (1993)

Model Checking Systems with Replicated Components using CSP
par: Mazur, T
Publié: (2011)

Analysing Security Protocols using CSP
par: Lowe, G
Publié: (2011)

Probabilistic and Prioritized Models of Timed CSP
par: Lowe, G
Publié: (1995)

Models for CSP with availability information
par: Gavin Lowe
Publié: (2010-11-01)

Symmetry reduction in CSP model checking
par: Gibson-Robinson, T, et autres
Publié: (2019)

Using CSP to Verify Sequential Consistency
par: Lowe, G, et autres
Publié: (1999)

Using CSP to Verify Sequential Consistency
par: Lowe, G, et autres
Publié: (1999)

Model checking Timed CSP
par: Armstrong, P, et autres
Publié: (2012)

Using CSP to detect errors in the TMN protocol
par: Roscoe, A, et autres
Publié: (1996)

Using CSP to Detect Errors in the TMN Protocol
par: Lowe, G, et autres
Publié: (1997)

Context-aware counter abstraction.
par: Basler, G, et autres
Publié: (2010)

The order encoding: from tractable CSP to tractable SAT (extended abstract)
par: Petke, J, et autres
Publié: (2011)

On CSP refinement tests that run multiple copies of a process
par: Lowe, G
Publié: (2007)

Identifying efficiently solvable cases of Max CSP
par: Cohen, D, et autres
Publié: (2004)

Implementing generalised alt - A case study in validated design using CSP
par: Lowe, G
Publié: (2011)

Using CSP to Detect Insertion and Evasion Possibilities within the Intrusion Detection Area
par: Rohrmair, G, et autres
Publié: (2002)

The complexity of regular abstractions of one-counter languages
par: Atig, M, et autres
Publié: (2016)

Unbounded nondeterminism in CSP
par: Roscoe, A, et autres
Publié: (1989)

CSP files
par: Roscoe, T, et autres
Publié: (2011)

On the expressiveness of CSP
par: Roscoe, A
Publié: (2011)

CSP and timewise refinement
par: Roscoe, A, et autres
Publié: (1991)

CSP202-CSP204 - PENGKOMPUTERAN SAINTIFIK - APRIL 1987.
par: PPSKOM, Pusat Pengajian Sains Komputer
Publié: (1987)

Tyger: A Tool for Automatically Simulating CSP−Like Languages in CSP
par: Gibson−Robinson, T
Publié: (2010)

View abstraction for systems with component identities
par: Lowe, G
Publié: (2018)

VCEGAR: Verilog CounterExample Guided Abstraction Refinement
par: Jain, H, et autres
Publié: (2007)

Introduction to CEGAR —Counter-Example Guided Abstraction Refinement
par: M. U. Mandrykin, et autres
Publié: (2018-10-01)

Classifying unbounded nondeterminism in CSP
par: Barrett, G, et autres
Publié: (1991)

An Operational Semantics for CSP
par: Roscoe, A, et autres
Publié: (1986)

Linking Z and CSP
par: Hoare, C
Publié: (2015)

Taking quotients in CSP
par: Goldsmith, M
Publié: (2006)

The expressiveness of CSP with priority
par: Roscoe, A
Publié: (2015)

Unbounded nondeterminism in CSP
par: Roscoe, A
Publié: (1988)