scientific article; zbMATH DE number 1884409

zbMath1007.68508MaRDI QIDQ4798029

Riccardo Focardi, Roberto Gorrieri

Publication date: 18 March 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2171/21710331.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (33)

Rule formats for compositional non-interference properties ⋮ Verifying persistent security properties ⋮ Securing interaction between threads and the scheduler in the presence of synchronization ⋮ Taming Message-Passing Communication in Compositional Reasoning About Confidentiality ⋮ Controlling information release in the \(\pi\)-calculus ⋮ A comparison of semantic models for noninterference ⋮ Information flow in systems with schedulers. II: Refinement ⋮ Multilevel transitive and intransitive non-interference, causally ⋮ Interleaving vs True Concurrency: Some Instructive Security Examples ⋮ On the security and safety of AbU systems ⋮ Ugo Montanari and Software Verification ⋮ Unnamed Item ⋮ Synthesis of opaque systems with static and dynamic masks ⋮ Typing access control and secure information flow in sessions ⋮ A calculus of trustworthy ad hoc networks ⋮ Persistent Stochastic Non-Interference ⋮ Non-interference by Unfolding ⋮ Information flow security in boundary ambients ⋮ Model-Driven Information Flow Security for Component-Based Systems ⋮ A static analysis of cryptographic processes: the denotational approach ⋮ Formal Verification of Differential Privacy for Interactive Systems (Extended Abstract) ⋮ Coalgebraic minimization of HD-automata for the \(\pi\)-calculus using polymorphic types ⋮ CoCon: a conference management system with formally verified document confidentiality ⋮ Tempus fugit: How to plug it ⋮ On CSP Refinement Tests That Run Multiple Copies of a Process ⋮ On Intransitive Non-interference in Some Models of Concurrency ⋮ Synthesis of Non-Interferent Timed Systems ⋮ Semantic models for information flow ⋮ Action Refinement in Process Algebra and Security Issues ⋮ Secured Information Flow for Asynchronous Sequential Processes ⋮ Non-Interference Control Synthesis for Security Timed Automata ⋮ Towards SOS Meta-Theory for Language-Based Security ⋮ Non-interference Notions Based on Reveals and Excludes Relations for Petri Nets

This page was built for publication: