For a given (terminating) term rewriting system one can often estimate its derivational complexity indirectly by looking at the proof method that established termination. In this s...
Compositional semantics allow to reason about programs in an incremental way, thus providing the formal base for the development of modular data-flow analyses. The major drawback ...
Abstract. Synchronous languages are well suited for the design of dependable real-time systems: they enable a very high-level specification and an extremely modular implementation ...
In this paper, we are concerned with studying the semantic of the B modularity. We reuse the Harper-Lillibridge-Leroy (HLL) module system. This system implements an SML like module...
The increasing use of discrete simulation in modelling large and complex systems brings new challenges. One such challenge is the need to devise ways of developing modular approac...