Type-based security for mobile computing integrity, secrecy and liveness

DOI10.1016/J.ENTCS.2005.12.115MaRDI QIDQ5262979zbMATH OpenOpenAlexWikidataFDO

Authors 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\(\pi\)-calculussecurityprocess calculimobile computing

Mathematics Subject Classification ID

Theory of programming languages (68N15) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 2043318
• Channel dependent types for higher-order mobile processes
• Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Non-disclosure for distributed mobile code

Cites work

• scientific article; zbMATH DE number 1693037 (Why is no real title available?)
• scientific article; zbMATH DE number 1722647 (Why is no real title available?)
• scientific article; zbMATH DE number 1354140 (Why is no real title available?)
• scientific article; zbMATH DE number 1361143 (Why is no real title available?)
• scientific article; zbMATH DE number 1049169 (Why is no real title available?)
• scientific article; zbMATH DE number 1479644 (Why is no real title available?)
• scientific article; zbMATH DE number 1538026 (Why is no real title available?)
• scientific article; zbMATH DE number 2087446 (Why is no real title available?)
• scientific article; zbMATH DE number 1863387 (Why is no real title available?)
• A calculus of mobile processes. II
• A framework for defining logics
• A logical analysis of aliasing in imperative higher-order functions
• A uniform type structure for secure information flow
• Algebraic laws for nondeterminism and concurrency
• Assigning types to processes
• Certification of programs for secure information flow
• Contextual equivalence for higher-order -calculus revisited
• From process logic to program logic
• Full abstraction for PCF
• Game-theoretic analysis of call-by-value computation
• Genericity and the \(\pi\)-calculus
• Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators
• On full abstraction for PCF: I, II and III
• Safe manual memory management in Cyclone
• Stack inspection
• Strong normalisation in the \(\pi\)-calculus
• Trustworthy Global Computing
• safeDpi: a language for controlling mobile code

Cited in

(10)

• A Modal Language for the Safety of Mobile Values
• Channel dependent types for higher-order mobile processes
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• scientific article; zbMATH DE number 2043318 (Why is no real title available?)
• Non-disclosure for distributed mobile code
• A confinement criterion for securely executing mobile code
• Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
• scientific article; zbMATH DE number 2038768 (Why is no real title available?)
• Trust and partial typing in open systems of mobile agents
• Mobile computation with functions

Describes a project that uses

Uses Software

• MJ
• Jif
• Featherweight Java
• Cyclone
• SafeDpi

This page was built for publication: Type-based security for mobile computing integrity, secrecy and liveness

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