Rule formats for non interference

Authors:
Simone Tini
Affiliations:
Dipartimento di Scienze CC.FF.MM., Università dell'Insubria, Como, Italy
Venue:
ESOP'03 Proceedings of the 12th European conference on Programming
Year:
2003

Citing 9
Cited 5

Structural operational semantics for weak bisimulations

Theoretical Computer Science
The Compositional Security Checker: A Tool for the Verification of Information Flow Security Properties

IEEE Transactions on Software Engineering
Rooted branching bisimulation as a congruence

Journal of Computer and System Sciences
Communication and Concurrency

Communication and Concurrency
Classification of Security Properties (Part I: Information Flow)

FOSAD '00 Revised versions of lectures given during the IFIP WG 1.7 International School on Foundations of Security Analysis and Design on Foundations of Security Analysis and Design: Tutorial Lectures
Formats of Ordered SOS Rules with Silent Actions

TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Non-Interference Through Determinism

ESORICS '94 Proceedings of the Third European Symposium on Research in Computer Security
Partial Model Checking and Theorem Proving for Ensuring Security Properties

CSFW '98 Proceedings of the 11th IEEE workshop on Computer Security Foundations
Information Flow Security in Dynamic Contexts

CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations

SOS formats and meta-theory: 20 years after

Theoretical Computer Science
Probabilistic bisimulation as a congruence

ACM Transactions on Computational Logic (TOCL)
A Hierarchy of SOS Rule Formats

Electronic Notes in Theoretical Computer Science (ENTCS)
A Notion of Biological Diagnosability Inspired by the Notion of Opacity in Systems Security

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Probabilistic congruence for semistochastic generative processes

FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the SBSNNI rule format. We prove that any Process Algebra construct whose SOS-style semantics is defined by SOS transition rules respecting such a format, preserves the well known non interference properties Persistent BNDC, SBSNNI, and SBNDC.