W. Tracz. Formal Specification of Parameterized Programs in LILEANNA. PhD thesis, Stanford University, 1992.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....systems. The SpecWare system [55] from Kestrel generates code from detailed specs, using optimizing transformations to improve the quality of this code. SpecWare also has a module system based on parameterized programming, and in particular has colimit as a top level command. The lileanna system [58, 57] fully implements parameterized programming, and builds systems by composing compiled Ada modules. SpecWare has a verification capability, whereas lileanna does not. Prof. Peter Padawitz has developed a theory called swinging types that includes coinduction principles, and has an associated ....

William Tracz. Formal Specification of Parameterized Programs in lilleanna. PhD thesis, Stanford University, 1997.

....[80] on reflection for survivable systems [73] and on metalogical foundations for reflection [56] will be extended in several ways. More generally, we will take into account many previous contributions by other researchers in the area of software architecture and module composition operations [6, 67, 15, 19, 8, 41, 36, 28, 75], in reflection [71, 70, 79, 76, 41, 38, 81, 7, 68, 39, 12, 53, 24, 37, 52, 61, 64, 69] and in recent approaches to interoperation [34, 13, 14, 42, 5, 1, 45, 20] The proposed research will lead to a new technology for composition, interoperation, and dynamic evolution of software systems. It ....

....time, that evolve, operate in, and interact with an environment that is not under their control. Such systems need to be robust rather than brittle, and reactive rather than autistic. They may need to adapt to 1 Very encouraging experience on extensions of this kind such as LIL [28] and LILEANNA [75] already exists. 9 changes in their environment. In some cases it is important to be able to add new functionality to an existing system. A system s behavior can be changed from without brain surgery or from within conversation and contemplation. Although there will probably always be ....

W. Tracz. Formal specification of parameterized programs in LILEANNA, 1993. manuscript, version 7.0.

.... reference architecture for a specific domain is developed first and then the architecture is instantiated with 29 pre existing components, components are composed, adapted and verified [18] In some cases, special purpose languages are developed to describe software architectures, e.g. LILEANNA [21] or MetaH [22] Recently, an entire book was devoted to software architectures [19] in which various styles of organizing software systems are described. While each of the styles in [19] is represented in a different notation, the work of Gerken [9] uses category theory to formally specify ....

W. Tracz. Formal Specification of Parameterized Programs in LILEANNA. PhD thesis, Stanford University, 1993. 34

....In particular, if U is one of the theories in the class C, then U can simulate its own metalevel at the object level, and this process can be iterated ad infinitum, giving rise to a reflective tower. 1 Very encouraging experience on extensions of this kind such as LIL [17] and LILEANNA [53] already exists. Inst Ent Log PCalc LogSys Gamma Gamma Gamma Gamma Gamma Psi R Gamma Gamma Gamma Gamma Gamma Psi Gamma Gamma Gamma Gamma Gamma Psi R inst ent Log ent log pcalc Figure 1: Categories of logical structures and their relationships. In [8] several ....

William Tracz. Formal specification of parameterized programs in LILEANNA. Manuscript, Version 7.0, 1993.

....the 3C model. The 3C model of reusable software components was originally developed at the Reuse in Practice workshop, held July 11 13, 1989 in Pittsburgh, Pennsylvania [Tra90] and is an enhancement of the Concept Context model initially proposed by Tracz in his dissertation work at Stanford [Tra92] The 3Cs stand for: Concept The abstraction captured in a component. Content The implementation of that abstraction. Context The environment in which the component is designed to operate. A more detailed description of the 3C model can be found in [Edw90] which uses this model to develop a ....

William Tracz. Formal Specification of Parameterized Programs in LILEANNA. PhD thesis, Dept. of Electrical Engineering, Stanford University, Stanford, CA, to appear 1992.

....the application of a generic theory to an actual is computed by a pushout. OBJ [13, 28, 14] Eqlog [30] and FOOPS [31] extend this notion of generic module to functional, logic (i.e. relational) and object oriented programming, and in their combinations. It has even been applied to Ada [21, 63]. 6.2 Graph Rewriting. Another important problem in computing science is to find models of computation that are suitable for massively parallel machines. A successful model should be abstract enough to avoid the implementation details of particular machines, and yet concrete enough to serve as an ....

William Joseph Tracz. Formal Specification of Parameterized Programs in lilleanna. PhD thesis, Stanford University, to appear.

....to object orientation. FOOPS was developed in conjunction with the library interconnection language LIL [13] This language is similar to FOOPS, except that it includes lower level facilities for system construction, to support the so called vertical composition of sub systems. See also [46] for information about LIL. 1.1 Object oriented Programming The object oriented paradigm advocates the development of systems as structured collections of autonomous objects that communicate with each other, have local storage, and persist and evolve with time. Because system structure is based ....

W. J. Tracz. Formal Specification of Parameterized Programs in lilleanna. PhD thesis, Stanford University, 1992 (to appear).

....another. Validations are also stored in the tatami database; these may or may not be formal proofs. If the atomic specifications of a project have associated code, then the system can be generated from the module expression that describes it, as suggested in [6] and implemented in lileanna [19, 20]. Our short term plans for the tatami system do not include this capability, but we hope to provide it eventually; the SpecWare system [18] provides this capability, along with many optimizing transformations to improve the generated code. Specifications can be formal, semi formal, or informal, as ....

William Tracz. Formal Specification of Parameterized Programs in lilleanna. PhD thesis, Stanford University, 1997.

....of proofs. The SpecWare system [55] from Kestrel generates code from detailed specs, using optimizing transformations to improve the quality of this code. SpecWare also has a module system based on parameterized programming, and in particular has colimit as a top level command. The lileanna system [57, 56] fully implements parameterized programming, and can build systems by composing compiled Ada modules. SpecWare has a verification capability, whereas lileanna does not. Peter Padawitz has developed a theory called swinging types that includes coinduction principles, and has a prototype ....

William Tracz. Formal Specification of Parameterized Programs in lilleanna. PhD thesis, Stanford University, 1997.

....as well as implementations. LIL provides two dimensional module composition following the CAT ideas [72] where vertical structure refers to the layering of software to use capabilities from lower layers, while horizontal structure refers to a single layer. LIL has been implemented as lileanna [168, 169], which uses Ada for code and anna [135] for specs; it has been used to build helicopter navigation software. New features of lileanna include operations to add, delete and modify module functionality, at both the code and spec levels. A formal semantics is given for all this in [111] using a ....

William Tracz. Formal Specification of Parameterized Programs in lilleanna. PhD thesis, Stanford University, 1997.

....unusual feature is the use of information hiding in specifications and the resulting behavioral (i.e. black box ) notion of sat isfaction for views. Similar basic laws for composing specifications were first proved in [GM82] and later in [ST88] Material from the present paper appeared in [Tra97], and its full version may be found at www.cs.ucsd.edu users goguen ps will.ps.gz, which includes all the proofs omitted here. The next section describes some foundational concepts that are used throughout the paper. This is followed by two sections on horizontal composition (on specification ....

Tracz, W. Formal Specification of Parameterized Programs in lilleanna. PhD thesis, Stanford University, 1997.

....is the use of information hiding in specifications and the resulting behavioral (i.e. black box ) notion of sat 4 Goguen Tracz isfaction for views. Similar basic laws for composing specifications were first proved in [GM82] and later in [ST88] Material from the present paper appeared in [Tra97], and its full version may be found at www.cs.ucsd.edu users goguen ps will.ps.gz, which includes all the proofs omitted here. The next section describes some foundational concepts that are used throughout the paper. This is followed by two sections on horizontal composition (on specification ....

Tracz, W. Formal Specification of Parameterized Programs in lilleanna. PhD thesis, Stanford University, 1997.

No context found.

W. Tracz. Formal Specification of Parameterized Programs in LILEANNA. PhD thesis, Stanford University, 1992.

No context found.

William Tracz. Formal Specification of Parameterized Programs in LILEANNA. PhD thesis, Dept. of Electrical Engineering, Stanford University, Stanford, CA, to appear 1993.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC