May Testing, Non-interference, and Compositionality

DOI10.1016/S1571-0661(05)80064-7zbMath1264.68112WikidataQ60173610 ScholiaQ60173610MaRDI QIDQ4923384

S. A. Schneider

Publication date: 6 June 2013

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

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) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Verifying persistent security properties ⋮ Ultrametric approximations of a Drygas functional equation

Cites Work

• Refusal testing
• Non-interference through determinism
• Recursion induction for real-time processes
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: May Testing, Non-interference, and Compositionality