A transformational perspective into the core of an abstract class loader for the SSP

Abstract

The SSP is a hardware implementation of a subset of the JVM for use in high-consequence embedded applications. In this context, a majority of the activities belonging to class loading, as it is defined in the specification of the JVM, can be performed statically. Static class loading has the net result of dramatically simplifying the design of the SSP, as well as increasing its performance. Because of the high consequence nature of its applications, strong evidence must be provided that all aspects of the SSP have been implemented correctly. This includes the class loader. This article explores the possibility of formally verifying a class loader for the SSP implemented in the strategic programming language TL. Specifically, an implementation of the core activities of an abstract class loader is presented and its verification in ACL2 is considered.

Programming Errors in Traversal Programs Over Structured Data

“…Historically, strategic programming has been researched considerably in the context of software transformation. We refer the reader to [70,68,34,44,46,78] for some published accounts of actual applications of traversal programming with traversal strategies.…”

Proof of transitive closure property of directed acyclic graphs

“…Sandia National Laboratories developed the Sandia Secure Processor (SSP) as a computational infrastructure for highconsequence embedded real-time systems [1]. The SSP is a restricted form of the Java Virtual Machine.…”

“…An index corresponds to the identifier of some other entry in the pool. Given this definition of a constant pool, we can represent a pool using a Directed Acyclic Graph (DAG) [1], as shown in Figure 1.…”

“…A graph defines the reachable relation 1 . The transitive closure of the reachable relation is the graph such that for any pair of nodes (n a , n b ) if n b is reachable from n a , then there is an edge (n a , n b ) in E.…”