No abstract

We present a tool, simplify-defun, that transforms the definition of a given function into a simplified definition of a new function, providing a proof checked by ACL2 that the old and new functions are equivalent. When appropriate it also generates termination and guard proofs for the new function. We explain how the tool is engineered so that these proofs will succeed. Examples illustrate its utility, in particular for program transformation in synthesis and verification.

SUMMARYJava is normally compiled to bytecode, which is verified and then executed by the Java Virtual Machine. Bytecode produced via compilation must pass verification. The main cause of complexity for bytecode verification is subroutines, used by compilers to generate more compact code. The techniques to verify subroutines proposed in the literature reject certain programs produced by mundane compilers, are difficult to realize within an implementation of the Java Virtual Machine or are relatively complicated. This paper presents a novel technique which is very simple to understand, implement and prove sound. It is also very powerful: the set of accepted programs has a simple characterization which most likely includes all the code produced by current compilers and which enables future compilers to make more extensive use of subroutines.

I magine a space-for example, a museum exhibit or theater stage-in which you can stand surrounded by music and control its ebb and flow (the rhythms, orchestration, and so on) by your own full-body movement (such as dancing) without touching any controls. 1 In addition, imagine that this space also includes mobile robots that can interact with, entertain, sing, and speak to you, as though they were actors on a stage. 2 Figure 1 shows an example of this scenario. This kind of multimedia-multimodal system requires, among other things, intelligent interfaces and adaptive behavior. We believe that including artificial emotions (in the sense we explain below)

This roadmap describes ways that researchers in four areas --specification languages, program generation, correctness by construction, and programming languages --might help further the goal of verified software. It also describes what advances the ``verified software'' grand challenge might anticipate or demand from work in these areas. That is, the roadmap is intended to help foster collaboration between the grand challenge and these research areas. A common goal for research in these areas is to establish language designs and tool architectures that would allow multiple annotations and tools to be used on a single program. In the long term, researchers could try to unify these annotations and integrate such tools. AbstractThis roadmap describes ways that researchers in four areas -specification languages, program generation, correctness by construction, and programming languages -might help further the goal of verified software. It also describes what advances the "verified software" grand challenge might anticipate or demand from work in these areas. That is, the roadmap is intended to help foster collaboration between the grand challenge and these research areas.A common goal for research in these areas is to establish language designs and tool architectures that would allow multiple annotations and tools to be used on a single program. In the long term, researchers could try to unify these annotations and integrate such tools.