Action Refinement in Process Algebra and Security Issues
DOI10.1007/978-3-540-78769-3_14zbMATH Open1179.68100OpenAlexW97395656MaRDI QIDQ5504602FDOQ5504602
Authors: Annalisa Bossi, Carla Piazza, Sabina Rossi 
Publication date: 22 January 2009
Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78769-3_14
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The difference between splitting in \(n\) and \(n+1\)
- Program development by stepwise refinement
- Refinement of actions and equivalence notions for concurrent systems
- A proof system for information flow security
- Title not available (Why is that?)
- Action Refinement in Process Algebra and Security Issues
- Title not available (Why is that?)
- Action refinement.
- Comparing syntactic and semantic action refinement
- A causal operational semantics of action refinement
- Adding action refinement to a finite process algebra
- Title not available (Why is that?)
- Title not available (Why is that?)
- Deciding and axiomatizing weak ST bisimulation for a process algebra with recursion and action refinement
Cited In (7)
- Proof-based design of security protocols
- On the use of data refinement in the development of secure communications systems
- Non-interference through determinism
- On refinement-closed security properties and nondeterministic compositions
- Information flow in systems with schedulers. II: Refinement
- Action Refinement in Process Algebra and Security Issues
- Title not available (Why is that?)
This page was built for publication: Action Refinement in Process Algebra and Security Issues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5504602)
