Journal Article10.1016/J.CL.2004.02.005
Verifying persistent security properties
TL;DR: This work studies bisimulation-based information flow security properties which are persistent, in the sense that if a system is secure then all of its reachable states are secure too, and provides a characterization of such properties in terms of unwinding conditions which demand properties of individual actions.
read more
About: This article is published in Computer Languages, Systems & Structures. The article was published on 01 Oct 2004. The article focuses on the topics: Computer security model & Security testing.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Information Flow Safety in Multiparty Sessions
TL;DR: In this article, a calculus for multiparty sessions enriched with security levels for messages is considered, and a monitored semantics for this calculus is proposed, which blocks the execution of processes as soon as they attempt to leak information.
Information flow ecurity in dynamic contexts
Riccardo Focardi,Sabina Rossi +1 more
- 24 Jun 2002
TL;DR: A security property for processes in dynamic contexts, i.e., contexts that can be reconfigured at runtime, is proposed such that a process is “secure” when every state reachable from it satisfies a basic Non-Interference property.
34
Compositional information flow security for concurrent programs
TL;DR: It is illustrated how the unwinding framework can be instantiated in order to deal with intentional information release and the verification techniques are extended to the analysis of security properties of programs admitting downgrading.
Towards Formal Specification of Abstract Security Properties
Antonio Maña,G. Pujol +1 more
- 04 Mar 2008
TL;DR: It is argued that security properties should be defined in formal, intuitive and abstract terms, and that reasoning mechanisms must exist for these specifications in order to relate different properties.
26
Controlling information release in the π-calculus
Silvia Crafa,Sabina Rossi +1 more
TL;DR: It is shown that the controlled release property is compositional with respect to most operators of the language leading to efficient proof techniques for the verification and the construction of (compositional) secure systems.
25
References
•Book
Introduction to Algorithms
Thomas H. Cormen,Charles E. Leiserson,Ronald L. Rivest +2 more
- 01 Jan 1990
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
24.8K
•Book
Communication and Concurrency
Robin Milner
- 01 Jan 1989
TL;DR: This chapter discusses Bisimulation and Observation Equivalence as a Modelling Communication, a Programming Language, and its application to Equational laws.
9K
Matrix multiplication via arithmetic progressions
Don Coppersmith,Shmuel Winograd +1 more
- 01 Jan 1987
TL;DR: A new method for accelerating matrix multiplication asymptotically is presented, by using a basic trilinear form which is not a matrix product, and making novel use of the Salem-Spencer Theorem.
2.4K
Security Policies and Security Models
Joseph A. Goguen,José Meseguer +1 more
- 26 Apr 1982
TL;DR: The reader is familiar with the ubiquity of information in the modern world and is sympathetic with the need for restricting rights to read, add, modify, or delete information in specific contexts.
2.4K
Secure Computer System: Unified Exposition and Multics Interpretation
D. Elliott Bell,Leonard J. La Padula +1 more
- 01 Mar 1976
TL;DR: A suggestive interpretation of the model in the context of Multics and a discussion of several other important topics (such as communications paths, sabotage and integrity) conclude the report.