A scalable architecture for proof-carrying code

DOI10.1007/3-540-44716-4_2MaRDI QIDQ2763627zbMATH OpenFDO

Authors George C. Necula

Publication date 21 January 2002

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/2024/20240021

Mathematics Subject Classification ID

Theory of software (68N99) Computing methodologies and applications (68U99)

Recommendations

• scientific article; zbMATH DE number 2110618
• scientific article; zbMATH DE number 1330435
• A gradual approach to a more trustworthy, yet scalable, proof-carrying code
• Proof-carrying code with untrusted proof rules
• Proof-carrying code from certified abstract interpretation and fixpoint compression

Cited in

(8)

• Resource control for synchronous cooperative threads
• A portable virtual machine target for proof-carrying code
• Lightweight static capabilities
• Certifying algorithms
• Temporal logic for proof-carrying code
• scientific article; zbMATH DE number 2110618 (Why is no real title available?)
• Logic for Programming, Artificial Intelligence, and Reasoning
• Space-aware ambients and processes

This page was built for publication: A scalable architecture for proof-carrying code

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