Automated techniques for provably safe mobile code.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 65531 (Why is no real title available?)
- scientific article; zbMATH DE number 1392299 (Why is no real title available?)
- scientific article; zbMATH DE number 1420794 (Why is no real title available?)
- A dependently typed assembly language
- A framework for defining logics
- A semantic model of types and machine instructions for proof-carrying code
- A type system for expressive security policies
- Elf: A meta-language for deductive systems
- Logical frameworks
- On equivalence and canonical forms in the LF type theory
- Resource bound certification
- Stack-based typed assembly language
- Stack-based typed assembly language
Cited in
(11)- Lazy mobile intruders
- Secure Prolog-based mobile code
- Grail: a functional form for imperative mobile code
- A type system for expressive security policies
- scientific article; zbMATH DE number 2080177 (Why is no real title available?)
- Verification, Model Checking, and Abstract Interpretation
- scientific article; zbMATH DE number 1612498 (Why is no real title available?)
- A confinement criterion for securely executing mobile code
- Matching in security-by-contract for mobile code
- Commanding a robot in a safe way
- Proving the correctness of mobile Java code
This page was built for publication: Automated techniques for provably safe mobile code.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853627)