Bisimulation and Unwinding for Verifying Possibilistic Security Properties
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Confidentiality-Preserving Refinement is Compositional - Sometimes
ESORICS '02 Proceedings of the 7th European Symposium on Research in Computer Security
Confidentiality-Preserving Refinement
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
A Generic Approach to the Security of Multi-Threaded Programs
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
A unifying approach to the security of distributed and multi-threaded programs
Journal of Computer Security - Special issue on CSFW14
Information flow property preserving transformation of UML interaction diagrams
Proceedings of the eleventh ACM symposium on Access control models and technologies
Preservation of probabilistic information flow under refinement
Information and Computation
Architectural Refinement and Notions of Intransitive Noninterference
ESSoS '09 Proceedings of the 1st International Symposium on Engineering Secure Software and Systems
The Shadow Knows: Refinement and security in sequential programs
Science of Computer Programming
On Refinement-Closed Security Properties and Nondeterministic Compositions
Electronic Notes in Theoretical Computer Science (ENTCS)
The Secret Art of Computer Programming
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Sums and Lovers: Case Studies in Security, Compositionality and Refinement
FM '09 Proceedings of the 2nd World Congress on Formal Methods
A refinement method for Java programs
FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
Maintaining information flow security under refinement and transformation
FAST'06 Proceedings of the 4th international conference on Formal aspects in security and trust
Developing security protocols by refinement
Proceedings of the 17th ACM conference on Computer and communications security
Journal of Computer Security - 7th International Workshop on Issues in the Theory of Security (WITS'07)
Preserving security properties under refinement
Proceedings of the 7th International Workshop on Software Engineering for Secure Systems
Stepwise development of secure systems
SAFECOMP'06 Proceedings of the 25th international conference on Computer Safety, Reliability, and Security
Possibilistic information flow control in MAKS and action refinement
ETRICS'06 Proceedings of the 2006 international conference on Emerging Trends in Information and Communication Security
Preserving secrecy under refinement
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Abstractions preserving parameter confidentiality
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
A formal framework for confidentiality-preserving refinement
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
The shadow knows: refinement of ignorance in sequential programs
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
Verifying persistent security properties
Computer Languages, Systems and Structures
Scheduler-Independent declassification
MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
Information flow in systems with schedulers, Part II: Refinement
Theoretical Computer Science
| Hi-index | 0.00 |
Abstract: In a stepwise development process, it is essential that system properties that have been already investigated in some phase need not be re-investigated in later phases. In formal developments, this corresponds to the requirement that properties are preserved under refinement. While safety and liveness properties are indeed preserved under most standard forms of refinement, it is well known that this is, in general, not true for information flow properties, a large and useful class of security properties. In this article, we propose a collection of refinement operators as a solution to this problem. We prove that these operators preserve information flow as well as other system properties. Thus, information flow properties become compatible with step-wise development. Moreover, we show that our operators are an optimal solution.