Rule formats for compositional non-interference properties

DOI10.1016/j.jlap.2004.03.003zbMath1072.68073OpenAlexW2081443964MaRDI QIDQ1878717

Simone Tini

Publication date: 8 September 2004

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2004.03.003

zbMATH Keywords

transition rule formats

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

SOS formats and meta-theory: 20 years after ⋮ Rule formats for determinism and idempotence ⋮ Towards SOS Meta-Theory for Language-Based Security

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Structural operational semantics for weak bisimulations
• Non-interference through determinism
• A complete inference system for a class of regular behaviours
• Higher-level synchronising devices in Meije-SCCS
• Structured operational semantics and bisimulation as a congruence
• The algebra of communicating processes with empty process
• Ordered SOS process languages for branching and eager bisimulations
• Rooted branching bisimulation as a congruence
• A Proof System for Information Flow Security
• Process Algebra
• Formal verification of parallel programs
• Theoretical Computer Science

This page was built for publication: Rule formats for compositional non-interference properties