POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Non-Interference Through Determinism
ESORICS '94 Proceedings of the Third European Symposium on Research in Computer Security
A General Theory of Composition for Trace Sets Closed under Selective Interleaving Functions
SP '94 Proceedings of the 1994 IEEE Symposium on Security and Privacy
Formal Aspects of Computing
The Shadow Knows: Refinement and security in sequential programs
Science of Computer Programming
Overcoming observability problems in distributed test architectures
Information Processing Letters
Unifying theories of confidentiality
UTP'10 Proceedings of the Third international conference on Unifying theories of programming
Hi-index | 0.00 |
This paper presents an approach for modelling interactions between users and systems in the Unifying Theories of Programming. Working in the predicate calculus, we outline generic techniques for calculating a user's observations of a system and, in turn, for identifying the information that a user can deduce about the system's behaviour from those observations. To demonstrate how this approach can be applied in practical software development, we propose some alternative refinement relations that offer greater flexibility than classical refinement by utilising knowledge of the observational abilities of users.