Compositional System Security with Interface-Confined Adversaries
From MaRDI portal
Publication:3178245
DOI10.1016/j.entcs.2010.08.005zbMath1342.68083OpenAlexW2111057313MaRDI QIDQ3178245
Anupam Datta, Jason Franklin, Dilsun Kaynar, Deepak Garg
Publication date: 8 July 2016
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2010.08.005
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
Cites Work
- Safely composing security protocols
- Recognizing safety and liveness
- Protocol Composition Logic (PCL)
- Compositional System Security with Interface-Confined Adversaries
- Hoare type theory, polymorphism and separation
- Tentative steps toward a development method for interfering programs
- Proofs of Networks of Processes
- Representation, reasoning, and relational structures: a hybrid logic manifesto
- Modular verification of security protocol code by typing
- On the Relationship Between Concurrent Separation Logic and Assume-Guarantee Reasoning
