A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
A classical mind
Communication and Concurrency
Automatic Compositional Verification of Some Security Properties
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Non-Interference Through Determinism
ESORICS '94 Proceedings of the Third European Symposium on Research in Computer Security
An Improved Failures Model for Communicating Processes
Seminar on Concurrency, Carnegie-Mellon University
The security checker: a semantics-based tool for the verification of security properties
CSFW '95 Proceedings of the 8th IEEE workshop on Computer Security Foundations
CSP and determinism in security modelling
SP '95 Proceedings of the 1995 IEEE Symposium on Security and Privacy
IEEE Transactions on Software Engineering
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
Secure Information Flow for Concurrent Processes
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Static Analysis of Processes for No and Read-Up nad No Write-Down
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
What is Intransitive Noninterference?
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Managing classified documents in a relational database
Das'01 Proceedings of the fifteenth annual working conference on Database and application security
Semantic models for information flow
Theoretical Computer Science - Mathematical foundations of programming semantics
Defining information flow quantity
Journal of Computer Security - Special issue on CSFW15
On CSP Refinement Tests That Run Multiple Copies of a Process
Electronic Notes in Theoretical Computer Science (ENTCS)
Analysing the information flow properties of object-capability patterns
FAST'09 Proceedings of the 6th international conference on Formal Aspects in Security and Trust
Hi-index | 0.00 |
In this paper we compare two information flow security properties: the lazy security (L-Sec) and the Bisimulation Non-deducibility on Compositions (BNDC). To make this we define the Failure Non-deducibility on Compositions, a failure semantics version of the BNDC. The common specification language used for the comparison is the Security Process Algebra, an extension of CCS which permits to describe systems where actions belong to two different levels of confidentiality. We prove that BNDC applied to a restricted class of systems, the low-deterministic and non-divergent ones, is equal to L-Sec. So these two properties, which are based on quite different underlying intuitions, become the same if we add some conditions to BNDC.