FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2114519152> ?p ?o ?g. }

• W2114519152 abstract "The Proof-Carrying Code (PCC) paradigm has emerged as a way of instilling trust in the code user about the properties of the code that she is about to run. The underlying idea is simple: code is shipped with a proof which attests that it adheres to the requirements set at the user’s computer. Consequently, the user does not need to check the code itself, only its proof, which is a simple, fast and one-time procedure. A program proof can be thought of as a semantic checksum, attesting that the semantics of the program has not been tampered with. While the underlying idea of Proof-Carrying Code is simple, it offers many challenges in both scientific and engineering aspects. This thesis concentrates on two aspects relevant for Proof-Carrying Code. First of all, we describe a way of giving a compositional semantics and matching Hoare logic to low-level, “unstructured” languages with jumps. Our work is based on the insight that a phrase structure can be given to the seemingly non-modular code by defining the code to be either a single instruction, or a finite union of pieces of code. We show that this seemingly trivial phrase structure actually provides a convenient basis for compositional semantics and logic. The semantic and logic descriptions that we thus obtain are similar in sophistication to those of the standard While language. Notably, Hoare triples in our logic can be interpreted in the usual way. The second aspect we investigate concerns “proof compilation”: the problem of translating a program proof alongside the program in the context of compilation. While the problem is trivial in the case of a non-optimizing compiler, it becomes complicated when optimizations take place: a valid proof of a program is in general not valid for the optimized, semantically equivalent version of the same program. We propose a way of describing optimizations via type systems, where the type system specifies both the dataflow analysis underlying the optimization and the rewrite rules making use of the analysis information and carrying out the optimization. The type derivation of a program is then used to guide the transformation of the proof. We demonstrate that this approach works both for high-level programs and Hoare proofs and on control flow graph based program descriptions and flat, unstructured program proofs. We are able to address complicated, program structure changing optimizations such as partial redundancy elimination and also optimizations based on bidirectional analysis." @default.
• W2114519152 created "2016-06-24" @default.
• W2114519152 creator A5058867828 @default.
• W2114519152 date "2008-01-01" @default.
• W2114519152 modified "2023-09-27" @default.
• W2114519152 title "Logics for Low-Level Code and Proof-Preserving Program Transformations" @default.
• W2114519152 cites W117803535 @default.
• W2114519152 cites W123771170 @default.
• W2114519152 cites W1482715091 @default.
• W2114519152 cites W1487472891 @default.
• W2114519152 cites W1511809518 @default.
• W2114519152 cites W1537084112 @default.
• W2114519152 cites W1538724214 @default.
• W2114519152 cites W1540384105 @default.
• W2114519152 cites W1540546860 @default.
• W2114519152 cites W1544646281 @default.
• W2114519152 cites W1555598009 @default.
• W2114519152 cites W1561339221 @default.
• W2114519152 cites W1561578075 @default.
• W2114519152 cites W1564069522 @default.
• W2114519152 cites W1564435947 @default.
• W2114519152 cites W1586396331 @default.
• W2114519152 cites W1586636845 @default.
• W2114519152 cites W158838047 @default.
• W2114519152 cites W1859811486 @default.
• W2114519152 cites W1885955018 @default.
• W2114519152 cites W1973336874 @default.
• W2114519152 cites W1981423943 @default.
• W2114519152 cites W1984580286 @default.
• W2114519152 cites W1991158186 @default.
• W2114519152 cites W1991984504 @default.
• W2114519152 cites W1994334933 @default.
• W2114519152 cites W1996228525 @default.
• W2114519152 cites W200081508 @default.
• W2114519152 cites W2006807875 @default.
• W2114519152 cites W2025317174 @default.
• W2114519152 cites W2028904812 @default.
• W2114519152 cites W2031833469 @default.
• W2114519152 cites W2034186738 @default.
• W2114519152 cites W2034711041 @default.
• W2114519152 cites W2040856861 @default.
• W2114519152 cites W2044895797 @default.
• W2114519152 cites W2051221358 @default.
• W2114519152 cites W2058360616 @default.
• W2114519152 cites W2065635796 @default.
• W2114519152 cites W2069300761 @default.
• W2114519152 cites W2075350371 @default.
• W2114519152 cites W2080696000 @default.
• W2114519152 cites W2087086761 @default.
• W2114519152 cites W2098293014 @default.
• W2114519152 cites W2099952704 @default.
• W2114519152 cites W2107787226 @default.
• W2114519152 cites W2110980218 @default.
• W2114519152 cites W2112888217 @default.
• W2114519152 cites W2122651546 @default.
• W2114519152 cites W2125346056 @default.
• W2114519152 cites W2128433129 @default.
• W2114519152 cites W2133074047 @default.
• W2114519152 cites W2146072020 @default.
• W2114519152 cites W2149240679 @default.
• W2114519152 cites W2149925406 @default.
• W2114519152 cites W2149996206 @default.
• W2114519152 cites W2152404881 @default.
• W2114519152 cites W2156625668 @default.
• W2114519152 cites W2163466224 @default.
• W2114519152 cites W2164810907 @default.
• W2114519152 cites W2170606418 @default.
• W2114519152 cites W2612827638 @default.
• W2114519152 cites W2888594017 @default.
• W2114519152 cites W2914870158 @default.
• W2114519152 cites W3146075203 @default.
• W2114519152 cites W203041528 @default.
• W2114519152 cites W2583967285 @default.
• W2114519152 hasPublicationYear "2008" @default.
• W2114519152 type Work @default.
• W2114519152 sameAs 2114519152 @default.
• W2114519152 citedByCount "2" @default.
• W2114519152 countsByYear W21145191522012 @default.
• W2114519152 crossrefType "journal-article" @default.
• W2114519152 hasAuthorship W2114519152A5058867828 @default.
• W2114519152 hasConcept C104949639 @default.
• W2114519152 hasConcept C156325763 @default.
• W2114519152 hasConcept C177264268 @default.
• W2114519152 hasConcept C184337299 @default.
• W2114519152 hasConcept C199360897 @default.
• W2114519152 hasConcept C207648694 @default.
• W2114519152 hasConcept C2776760102 @default.
• W2114519152 hasConcept C41008148 @default.
• W2114519152 hasConcept C55439883 @default.
• W2114519152 hasConcept C58041814 @default.
• W2114519152 hasConcept C80444323 @default.
• W2114519152 hasConceptScore W2114519152C104949639 @default.
• W2114519152 hasConceptScore W2114519152C156325763 @default.
• W2114519152 hasConceptScore W2114519152C177264268 @default.
• W2114519152 hasConceptScore W2114519152C184337299 @default.
• W2114519152 hasConceptScore W2114519152C199360897 @default.
• W2114519152 hasConceptScore W2114519152C207648694 @default.
• W2114519152 hasConceptScore W2114519152C2776760102 @default.
• W2114519152 hasConceptScore W2114519152C41008148 @default.
• W2114519152 hasConceptScore W2114519152C55439883 @default.

• next