A syntactic approach to foundational proof-carrying code
From MaRDI portal
Publication:1826465
Recommendations
- A tutorial example of the semantic approach to foundational proof-carrying code
- Tutorial examples of the semantic approach to foundational proof-carrying code
- A tutorial example of the semantic approach to foundational proof-carrying code: Abstract
- scientific article; zbMATH DE number 2110618
- A gradual approach to a more trustworthy, yet scalable, proof-carrying code
Cited in
(18)- Verified software units
- Type-safe code transformations in Haskell
- Imperative LF meta-programming
- Modular verification of concurrent assembly code with dynamic thread creation and termination
- Modular development of certified program verifiers with a proof assistant,
- Tutorial examples of the semantic approach to foundational proof-carrying code
- Social processes, program verification and all that
- scientific article; zbMATH DE number 2163030 (Why is no real title available?)
- Temporal logic for proof-carrying code
- scientific article; zbMATH DE number 2110618 (Why is no real title available?)
- scientific article; zbMATH DE number 6403889 (Why is no real title available?)
- A semantic model of types and machine instructions for proof-carrying code
- Towards Formal Proof Script Refactoring
- Foundational certified code in the Twelf metalogical framework
- Interfacing Hoare logic and type systems for foundational proof-carrying code
- A tutorial example of the semantic approach to foundational proof-carrying code
- A tutorial example of the semantic approach to foundational proof-carrying code: Abstract
- Automated Deduction – CADE-19
This page was built for publication: A syntactic approach to foundational proof-carrying code
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1826465)