Type-Based Security for Mobile Computing Integrity, Secrecy and Liveness

DOI10.1016/j.entcs.2005.12.115zbMath1316.68110WikidataQ115044271 ScholiaQ115044271MaRDI QIDQ5262979

Nobuko Yoshida

Publication date: 10 July 2015

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.2005.12.115

zbMATH Keywords

types; security; mobile computing; \(\pi\)-calculus; process calculi

Mathematics Subject Classification ID

68N19: Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.)

68N15: Theory of programming languages

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Uses Software

• SafeDpi
• Cyclone
• Featherweight Java
• Jif
• MJ

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Contextual equivalence for higher-order \(\pi\)-calculus revisited
• Strong normalisation in the \(\pi\)-calculus
• A calculus of mobile processes. II
• On full abstraction for PCF: I, II and III
• Full abstraction for PCF
• Assigning types to processes
• Game-theoretic analysis of call-by-value computation
• Safe manual memory management in Cyclone
• Genericity and the \(\pi\)-calculus
• safeDpi: a language for controlling mobile code
• A logical analysis of aliasing in imperative higher-order functions
• Algebraic laws for nondeterminism and concurrency
• A framework for defining logics
• Certification of programs for secure information flow
• From process logic to program logic
• A uniform type structure for secure information flow
• Stack inspection
• Trustworthy Global Computing
• Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators