On CSP Refinement Tests That Run Multiple Copies of a Process

DOI10.1016/J.ENTCS.2009.08.011zbMath1339.68169OpenAlexW2136959787MaRDI QIDQ2810978

Gavin Lowe

Publication date: 6 June 2016

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.08.011

zbMATH Keywords

CSPexpressivenessstable failures refinement checkstesting harnesses

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

On Refinement-Closed Security Properties and Nondeterministic Compositions

Cites Work

• Responsiveness of interoperating components
• Checking noninterference in timed CSP
• On the expressive power of CSP refinement
• Unnamed Item
• Unnamed Item

This page was built for publication: On CSP Refinement Tests That Run Multiple Copies of a Process