May testing, non-interference, and compositionality

DOI10.1016/S1571-0661(05)80064-7MaRDI QIDQ4923384zbMATH OpenDBLPWikidataFDO

Authors S. A. Schneider

Publication date 6 June 2013

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

Full work available at URL https://doi.org/10.1016/S1571-0661(05)80064-7

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Checking noninterference in timed CSP
• Proving concurrent noninterference
• Trustworthy Global Computing
• Compositional noninterference from first principles
• Decidability and proof systems for language-based noninterference relations

Cites work

• scientific article; zbMATH DE number 1670841 (Why is no real title available?)
• scientific article; zbMATH DE number 3776831 (Why is no real title available?)
• scientific article; zbMATH DE number 48630 (Why is no real title available?)
• Non-interference through determinism
• Recursion induction for real-time processes
• Refusal testing

Cited in

(4)

• Verifying persistent security properties
• Ultrametric approximations of a Drygas functional equation
• scientific article; zbMATH DE number 1860623 (Why is no real title available?)
• Testing noninterference, quickly

This page was built for publication: May testing, non-interference, and compositionality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4923384)