Results 1 
9 of
9
Sketching Concepts and Computational Model of TROLL light
 PROC. 3RD INT. CONF. DESIGN AND IMPLEMENTATION OF SYMBOLIC COMPUTATION SYSTEMS (DISCO'93) A. MIOLA (ED.), SPRINGER, BERLIN, LNCS 722, PP.1732 (1993)
, 1993
"... The specification language TROLL light is intended to be used for conceptual modeling of information systems. It is designed to describe the Universe of Discourse (UoD) as a system of concurrently existing and interacting objects, i.e., an object community. The first part of the present paper introd ..."
Abstract

Cited by 34 (22 self)
 Add to MetaCart
The specification language TROLL light is intended to be used for conceptual modeling of information systems. It is designed to describe the Universe of Discourse (UoD) as a system of concurrently existing and interacting objects, i.e., an object community. The first part of the present paper introduces the various language concepts offered by TROLL light . TROLL light objects have observable properties modeled by attributes, and the behavior of objects is described by events. Possible object observations may be restricted by constraints, whereas event occurrences may be restricted to specified lifecycles. TROLL light objects are organized in an object hierarchy established by subobject relationships. Communication among objects is supported by event calling. The second part of our paper outlines a simplified computational model for TROLL light . After introducing signatures for collections of object descriptions (or templates as they are called in TROLL light) we explain how single ...
TFL: An algebraic language to specify the dynamic behaviour of knowledgebased systems
 The Knowledge Engineering Review
, 1996
"... TFL, the Task Formal Language, has been developed for integrating the static and dynamic aspects of Knowledge Based Systems. This paper focuses on the formal speci cation of dynamic behaviour. Although fundamental in Knowledge Based System, the strategic reasoning was rather neglected until now by t ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
(Show Context)
TFL, the Task Formal Language, has been developed for integrating the static and dynamic aspects of Knowledge Based Systems. This paper focuses on the formal speci cation of dynamic behaviour. Although fundamental in Knowledge Based System, the strategic reasoning was rather neglected until now by the existing formal speci cations. Most languages were generally more focused on the domain and problemsolving knowledge speci cation than on the control. The formalisation presented here di ers from previous ones in several aspects. First, a di erent representation of dynamic knowledge is proposed: TFL is based on Algebraic Data Types, as opposed to dynamic or temporal logic. Second, dynamic strategic reasoning is emphasised, whereas existing languages only o er to specify algorithmic control. Then, TFL does not only provide the speci cation of the problemsolving knowledge of the object system, but also of its strategic knowledge. Finally, the dynamic knowledge of the metasystem itself is also speci ed. Moreover, modularisation is another important feature of the presented language. 1
A Model Inference System for Generic Specification with Application to Code Sharing
 In Proc. of TAPSOFT95, Col. on Formal Approaches in Software Engineering, LNCS 915
, 1995
"... . This paper presents a model inference system to control instantiation of generic modules. Generic parameters are specified by properties which represent classes of modules sharing some common features. Just as type checking consists in verifying that an expression is well typed, model checking all ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
(Show Context)
. This paper presents a model inference system to control instantiation of generic modules. Generic parameters are specified by properties which represent classes of modules sharing some common features. Just as type checking consists in verifying that an expression is well typed, model checking allows to detect whether a (possibly generic) instantiation of a generic module is valid, i.e. whether the instantiation module is a model of the parameterizing property. Equality of instances can be derived from a canonical representation of modules. At last, we show how the code of generic modules can be shared for all instances of modules. 1 Introduction Genericity is a useful feature for specification languages, and for programming languages alike, because it allows to reuse already written packages by instantiating them on various ways, thus limits the risk of bugs and reduces software costs. When a generic module is instantiated and imported into another module, one has to check that the...
Some Thoughts on Algebraic Specification
 PROC. 3RD WORKSHOP ON THEORY AND APPLICATIONS OF ABSTRACT DATA TYPES
, 1985
"... ..."
Safe Derivations in Object Hierarchies
 Int. Conf. on ObjectOriented Information Systems (OOIS'94
, 1995
"... ABSTRACT. We present a language for specifying structure and behavior of objects in information systems. This language is restricted to a set of core concepts for conceptual modeling. But it includes powerful concepts for specifying constraints and derived data. We present an algorithm for deciding ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
ABSTRACT. We present a language for specifying structure and behavior of objects in information systems. This language is restricted to a set of core concepts for conceptual modeling. But it includes powerful concepts for specifying constraints and derived data. We present an algorithm for deciding on safe computation of derived information and demonstrate how this algorithm works with an example.
Detecting Isomorphisms of Modular Specifications with Diagrams
 In Proceedings of AMAST'95, number 936 in LNCS
, 1995
"... . We propose to detect isomorphisms of algebraic modular specifications, by representing specifications as diagrams over a category C0 of base specifications and specification morphisms. We start with a formulation of modular specifications as terms, which are interpreted as diagrams. This represen ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
. We propose to detect isomorphisms of algebraic modular specifications, by representing specifications as diagrams over a category C0 of base specifications and specification morphisms. We start with a formulation of modular specifications as terms, which are interpreted as diagrams. This representation has the advantage of being more abstract, i.e. less dependent of one specific construction than terms. For that, we define a category diagr (C0) of diagrams, which is a completion of C0 with finite colimits. The category diagr (C0) is finitely cocomplete, even if C0 is not finitely cocomplete. We define a functor D[[]] : Term (C0) ! diagr (C0) which maps specifications to diagrams, and specification morphisms to diagram morphisms. This interpretation is sound in that the colimit of a diagram representing a specification is isomorphic to this specification. The problem of isomorphisms of modular specifications is solved by detecting isomorphisms of diagrams. 1 Introduction The specif...
Algebraic System Specification and Development: Survey and Annotated Bibliography  Second Edition 
, 1997
"... Data Types . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50 4.5.4 Special Approaches . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50 4.6 Semantics of Programming Languages . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52 4.6.1 Semantics of Ada . . . ..."
Abstract
 Add to MetaCart
Data Types . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50 4.5.4 Special Approaches . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50 4.6 Semantics of Programming Languages . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52 4.6.1 Semantics of Ada . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52 4.6.2 Action Semantics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52 4.7 Specification Languages . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53 4.7.1 Early Algebraic Specification Languages . . . . . . . . . . . . . . . . . . . . . . . . 53 4.7.2 Recent Algebraic Specification Languages . . . . . . . . . . . . . . . . . . . . . . . 55 4.7.3 The Common Framework Initiative. . . . . . . . . . . . . . . . . . . . . . . . . . . 56 5 Methodology 57 5.1 Development Phases . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 57 5.1.1 Applica...
Some thoughts on algebraic specication 1;2
"... This paper presents in an informal way the main ideas underlying our work on algebraic specication. The central idea, due to Goguen and Burstall, is that much work on algebraic specication can be done independently of the particular logical system (or institution) on which the specication formalism ..."
Abstract
 Add to MetaCart
This paper presents in an informal way the main ideas underlying our work on algebraic specication. The central idea, due to Goguen and Burstall, is that much work on algebraic specication can be done independently of the particular logical system (or institution) on which the specication formalism is based. We also examine the