No abstract

The use of component models such as Enterprise Java Beans and the CORBA Component Model (CCM) in application development is expanding rapidly. Even in real-time safety/mission-critical domains, component-based development is beginning to take hold as a mechanism for incorporating non-functional aspects such as realtime, quality-of-service, and distribution. To form an effective basis for development of such systems, we believe that support for reasoning about correctness properties of component-based designs is essential.In this paper, we present Cadena -an integrated environment for building and modeling CCM systems. Cadena provides facilities for defining component types using CCM IDL, specifying dependency information and transition system semantics for these types, assembling systems from CCM components, visualizing various dependence relationships between components, specifying and verifying correctness properties of models of CCM systems derived from CCM IDL, component assembly information, and Cadena specifications, and producing CORBA stubs and skeletons implemented in Java. We are applying Cadena to avionics applications built using Boeing's Bold Stroke framework.

No abstract

Numerous researchers have reported success in reason-

No abstract

We formalize a partial evaluator for Eugenio Moggi's computational metalanguage. This formalization gives an evaluation-order independent view of binding-time analysis and program specialization, including a proper treatment of call unfolding. It also enables us to express the essence of 'control-based binding-time improvements' for let expressions. Specifically, we prove that the binding-time improvements given by 'continuation-based specialization' can be expressed in the metalanguage via monadic laws. Downloaded: 24 Mar 2015 IP address: 180.211.214.167A computational formalization for partial evaluation 509 above (Bondorf and Danvy 1991), call-by-value partial evaluators insert residual let expressions to name dynamic expressions that should not be duplicated. With such a strategy, the residual program reads λz . let a = z × z in 11 − (a + a).This solution of inserting let expressions is effective, but ad hoc, in that there were no corresponding let expressions in the source program. In contrast, let expressions are an integral part of Moggi's computational metalanguage. Using this metalanguage, the source program can be rewritten as follows:

No abstract

No abstract