Bisimulation semantics for concurrency with atomicity and action refinement
Fundamenta Informaticae
Adding action refinement to a finite process algebra
Information and Computation
A causal operational semantics of action refinement
Information and Computation
Comparing syntactic and semantic action refinement
Information and Computation - special issue: symposium on theoretical aspects of computer software TACS '94
The difference between splitting in n and n + 1
Information and Computation
Program development by stepwise refinement
Communications of the ACM
Refinement of actions and equivalence notions for concurrent systems
Acta Informatica
Communication and Concurrency
ACM Transactions on Computational Logic (TOCL)
Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract)
MFCS '89 Proceedings on Mathematical Foundations of Computer Science 1989
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
Fully abstract models for a process language with refinement
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Possibilistic Definitions of Security - An Assembly Kit
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
Action Refinement
Modelling Downgrading in Information Flow Security
CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
Information flow security in dynamic contexts
Journal of Computer Security
Unwinding in Information Flow Security
Electronic Notes in Theoretical Computer Science (ENTCS)
Maintaining information flow security under refinement and transformation
FAST'06 Proceedings of the 4th international conference on Formal aspects in security and trust
Language-based information-flow security
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
In the design process of distributed systems we may have to replace abstract specifications of components by more concrete specifications, thus providing more detailed design information. In the context of process algebra, this well-known approach is often referred to as action refinement. We study the relationships between action refinement and security properties within the Security Process Algebra (SPA). First we formalize the concept of action refinement as a structural inductive transformation. Then we prove several compositional results which can be exploited in the stepwise development of processes. Finally, we consider information flow security properties for SPA processes and define a decidable class of secure processes which is closed under refinement.