FRINK Linked Data Fragments server

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

• W935580318 endingPage "279" @default.
• W935580318 startingPage "279" @default.
• W935580318 abstract "Because of the high cost associated with failure in high-consequence systems, it is important to produce strong evidence that these systems will not fail in the field. For software systems, such evidence cannot be obtained by traditional verification methods such as testing. Transformation-oriented programming utilizes well-defined, formal transformation sequences to refine an initial, formal specification into a final implementation. It is a long standing goal that the formal, incremental nature of this approach be used to provide convincing evidence that software systems will behave as intended. The research presented here applies a formal framework for verifying transformation-based software systems. The verification framework consists of two phases: modeling and verification. In the first phase, a model of a transformation program is constructed in a formal specification language, and the correctness of this model is demonstrated. The model is correct if it accurately reflects the behavior of the original transformation program. Verification of the transformation program is achieved by mathematically proving that the model of the transformation program preserves the semantics of its input, i.e., that the output to the transformation program is semantically equivalent to its input. To prove the correctness conjecture, a semantic function M representing the interpretation of the transformation program's input language is constructed. The result of applying M to the input of the model must be identical to the result of applying M to the transformed input of the model. The successful verification of the correctness conjuncture implies that, in general, the transformation program is correctness-preserving with respect to M . The approach is demonstrated on a high-consequence system, namely the Sandia Secure Processor (SSP). Designed at Sandia National Laboratories, the SSP executes a subset of the Java language and provides a general-purpose computational infrastructure suitable for use in high-consequence embedded systems. The SSP class loader takes a Java application and produces a ROM image. The ROM image consists of a collection of class file images that can be executed by the hardware of the SSP. While the Java Virtual Machine allows applications to begin execution before all class files are completely loaded, this behavior is not appropriate for embedded systems. Therefore, the SSP is a closed system in the sense that all the classes used during execution must be available before the execution starts. In this context, the functionality of the SSP class loader is well-suited to a transformation-based implementation. The SSP class loader was previously implemented using the higher-order transformation language TL. The implementation consists of five stages through which a set of class files representing a Java application is incrementally refined into a corresponding ROM image. The applicability of the introduced verification approach is demonstrated by proving the correctness of parts of the SSP class loader written in TL. Specifically, the automated theorem prover ACL2 is employed to model the transformation program that represents index resolution, the first stage of the TL class loader. The semantic function Mdref is constructed to give a meaning to any index in the constant pool of a class file. Mdref denotes the transitive closure of the value obtained by following an index in the constant pool. A theorem is presented stating that Mdref yields the same value when applied to a class file or its transformed counterpart." @default.
• W935580318 created "2016-06-24" @default.
• W935580318 creator A5025656477 @default.
• W935580318 creator A5046673609 @default.
• W935580318 creator A5081543259 @default.
• W935580318 date "2005-01-01" @default.
• W935580318 modified "2023-09-27" @default.
• W935580318 title "Verification of transformation rules of the higher-order transformation language tl" @default.
• W935580318 hasPublicationYear "2005" @default.
• W935580318 type Work @default.
• W935580318 sameAs 935580318 @default.
• W935580318 citedByCount "0" @default.
• W935580318 crossrefType "journal-article" @default.
• W935580318 hasAuthorship W935580318A5025656477 @default.
• W935580318 hasAuthorship W935580318A5046673609 @default.
• W935580318 hasAuthorship W935580318A5081543259 @default.
• W935580318 hasConcept C104317684 @default.
• W935580318 hasConcept C111498074 @default.
• W935580318 hasConcept C11413529 @default.
• W935580318 hasConcept C154945302 @default.
• W935580318 hasConcept C156325763 @default.
• W935580318 hasConcept C184337299 @default.
• W935580318 hasConcept C185592680 @default.
• W935580318 hasConcept C199360897 @default.
• W935580318 hasConcept C204241405 @default.
• W935580318 hasConcept C2776436953 @default.
• W935580318 hasConcept C2778361913 @default.
• W935580318 hasConcept C2779791154 @default.
• W935580318 hasConcept C2780654840 @default.
• W935580318 hasConcept C41008148 @default.
• W935580318 hasConcept C55439883 @default.
• W935580318 hasConcept C55493867 @default.
• W935580318 hasConcept C75606506 @default.
• W935580318 hasConcept C80444323 @default.
• W935580318 hasConceptScore W935580318C104317684 @default.
• W935580318 hasConceptScore W935580318C111498074 @default.
• W935580318 hasConceptScore W935580318C11413529 @default.
• W935580318 hasConceptScore W935580318C154945302 @default.
• W935580318 hasConceptScore W935580318C156325763 @default.
• W935580318 hasConceptScore W935580318C184337299 @default.
• W935580318 hasConceptScore W935580318C185592680 @default.
• W935580318 hasConceptScore W935580318C199360897 @default.
• W935580318 hasConceptScore W935580318C204241405 @default.
• W935580318 hasConceptScore W935580318C2776436953 @default.
• W935580318 hasConceptScore W935580318C2778361913 @default.
• W935580318 hasConceptScore W935580318C2779791154 @default.
• W935580318 hasConceptScore W935580318C2780654840 @default.
• W935580318 hasConceptScore W935580318C41008148 @default.
• W935580318 hasConceptScore W935580318C55439883 @default.
• W935580318 hasConceptScore W935580318C55493867 @default.
• W935580318 hasConceptScore W935580318C75606506 @default.
• W935580318 hasConceptScore W935580318C80444323 @default.
• W935580318 hasLocation W9355803181 @default.
• W935580318 hasOpenAccess W935580318 @default.
• W935580318 hasPrimaryLocation W9355803181 @default.
• W935580318 hasRelatedWork W1535978686 @default.
• W935580318 hasRelatedWork W1537437501 @default.
• W935580318 hasRelatedWork W1542895223 @default.
• W935580318 hasRelatedWork W1546954646 @default.
• W935580318 hasRelatedWork W1558804527 @default.
• W935580318 hasRelatedWork W1587258366 @default.
• W935580318 hasRelatedWork W1840677318 @default.
• W935580318 hasRelatedWork W191304338 @default.
• W935580318 hasRelatedWork W1995593113 @default.
• W935580318 hasRelatedWork W2029575717 @default.
• W935580318 hasRelatedWork W2107151638 @default.
• W935580318 hasRelatedWork W2151835341 @default.
• W935580318 hasRelatedWork W2360449144 @default.
• W935580318 hasRelatedWork W2401985403 @default.
• W935580318 hasRelatedWork W2520438138 @default.
• W935580318 hasRelatedWork W2894368102 @default.
• W935580318 hasRelatedWork W2899100473 @default.
• W935580318 hasRelatedWork W2949078466 @default.
• W935580318 hasRelatedWork W3086212869 @default.
• W935580318 hasRelatedWork W39862969 @default.
• W935580318 isParatext "false" @default.
• W935580318 isRetracted "false" @default.
• W935580318 magId "935580318" @default.
• W935580318 workType "article" @default.