Process algebra and security (abstract)

DOI10.1007/3-540-44685-0_4MaRDI QIDQ4791265zbMATH OpenFDO

Authors S. A. Schneider

Publication date 6 February 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2154/21540037.htm

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computing methodologies and applications (68U99)

Recommendations

• Techniques for security checking: non-interference vs control flow analysis
• A Declarative Framework for Security: Secure Concurrent Constraint Programming
• Verifying security protocols: An application of CSP
• Analyzing security protocols with secrecy types and logic programs
• A calculus for cryptographic protocols: The spi calculus

Cited in

(7)

• A brief history of process algebra
• Formal enforcement of security policies on concurrent systems
• Classification of security properties in a Linda-like process algebra
• Beyond separation of duty
• Channel abstractions for network security
• A Declarative Framework for Security: Secure Concurrent Constraint Programming
• Relating Process Languages for Security and Communication Correctness (Extended Abstract)

This page was built for publication: Process algebra and security (abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4791265)