Titlebook: Recent Trends in Algebraic Development Techniques; 12th International W Francesco Parisi Presicce Conference proceedings 1998 Springer-Verl

易于交谈

BLAND

paroxysm

现任者

Mapping tile logic into rewriting logic, and the kernel language of several implementation efforts (Cafe, ELAN, Maude). . extends (unconditional) rewriting logic since it takes into account state changes with side effects and synchronization. It is especially useful for defining compositional models of computation of reactive systems, coo

辩论的终结

An algebra of mixin modules, give an axiomatic definition of a set of operations for mixin combination, corresponding to a variety of constructs existing in programming languages (merge, hiding, overriding, functional composition, ...). In particular, we show that they can all be expressed in terms of three primitive operation

MUT

Completeness of a logical system for structured specifications,. The system is based on the proof rules for structural specifications build in an arbitrary institution as presented in [ST 88]. The proof of its completeness is inspired by the proof due to M. V. Cengarle (see [Cen 94]) for specifications in first-order logic and the logical system for reasoning a

形容词词尾

Zero-safe nets: The individual token approach,a primitive notion of .. Besides ordinary places, called . places, zero-safe nets come equipped with . places, which are empty in any stable marking. . represent . of the system between stable markings. They must satisfy two main requirements: 1) to model interacting activities which cannot be decom

epidermis

A method for Fortran programs reverse engineering using algebraic specifications,this problem in the legacy systems framework, a broader approach can be followed which first involves reverse engineering. Reverse engineering generates abstract descriptions of a program from its source. These descriptions are used to generate the improved program source (inconsistencies removal, o

liaison

STAT