Results 1  10
of
18
ECC, an Extended Calculus of Constructions
, 1989
"... We present a higherorder calculus ECC which can be seen as an extension of the calculus of constructions [CH88] by adding strong sum types and a fully cumulative type hierarchy. ECC turns out to be rather expressive so that mathematical theories can be abstractly described and abstract mathematics ..."
Abstract

Cited by 84 (4 self)
 Add to MetaCart
We present a higherorder calculus ECC which can be seen as an extension of the calculus of constructions [CH88] by adding strong sum types and a fully cumulative type hierarchy. ECC turns out to be rather expressive so that mathematical theories can be abstractly described and abstract mathematics may be adequately formalized. It is shown that ECC is strongly normalizing and has other nice prooftheoretic properties. An !\GammaSet (realizability) model is described to show how the essential properties of the calculus can be captured settheoretically.
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 ...
CaslChart: a Combination of Statecharts and of the Algebraic Specification Language Casl
 In Proc. AMAST 2000
, 2000
"... this paper we present CaslChart a formal visual specification language for reactive systems obtained by combining an already existing language for reactive systems, precisely the statecharts as supported by Statemate ([6, 7]), with an already existing language for the specification of data structur ..."
Abstract

Cited by 19 (3 self)
 Add to MetaCart
this paper we present CaslChart a formal visual specification language for reactive systems obtained by combining an already existing language for reactive systems, precisely the statecharts as supported by Statemate ([6, 7]), with an already existing language for the specification of data structures, precisely the algebraic specification language Casl ([12, 17])
Plugging Data Constructs into ParadigmSpecific Languages: towards an Application to UML
 Algebraic Methodology and Software Technology (AMAST 2000), volume 1816 of Lecture Notes in Computer Science (LNCS
, 2000
"... . We are interested in the composition of languages, in particular a data description language and a paradigmspecific language, from a pragmatic point of view. Roughly speaking our goal is the description of languages in a componentbased style, focussing on the data definition component. The p ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
. We are interested in the composition of languages, in particular a data description language and a paradigmspecific language, from a pragmatic point of view. Roughly speaking our goal is the description of languages in a componentbased style, focussing on the data definition component. The proposed approach is to substitute the constructs dealing with data from the "data" language for the constructs describing data that are not specific to the particular paradigm of the "paradigmspecific" language in a way that syntax, semantics as well as methodologies of the two components are preserved. We illustrate our proposal on a toy example: using the algebraic specification language Casl, as data language, and a "prepost" condition logic `a la Hoare, as the paradigm specific one. A more interesting application of our technique is fully worked out in [16] and the first step towards an application to UML, that is an analysis of UML from the data viewpoint, following the guid...
Hidden Algebra for Software Engineering
 Proceedings Combinatorics, Computation and Logic
, 1999
"... : This paper is an introduction to recent research on hidden algebra and its application to software engineering; it is intended to be informal and friendly, but still precise. We first review classical algebraic specification for traditional "Platonic" abstract data types like integers, vectors, ma ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
: This paper is an introduction to recent research on hidden algebra and its application to software engineering; it is intended to be informal and friendly, but still precise. We first review classical algebraic specification for traditional "Platonic" abstract data types like integers, vectors, matrices, and lists. Software engineering also needs changeable "abstract machines," recently called "objects," that can communicate concurrently with other objects through visible "attributes" and statechanging "methods." Hidden algebra is a new development in algebraic semantics designed to handle such systems. Equational theories are used in both cases, but the notion of satisfaction for hidden algebra is behavioral, in the sense that equations need only appear to be true under all possible experiments; this extra flexibility is needed to accommodate the clever implementations that software engineers often use to conserve space and/or time. The most important results in hidden algebra are ...
A Study on Components and Assembly Primitives in B
 In Proceedings of the first B conference, pages 47–62, 3 rue du Maréchal Joffre, BP 34103, 44041 Nantes Cedex 1
"... . This paper is the result of a reflexion coming from the usage and learning of the language B. It tries to better explain and understand the assembly primitives includes and uses of the language. It presents a highlevel notion of components and develops a "component algebra". This algebra is speci ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
. This paper is the result of a reflexion coming from the usage and learning of the language B. It tries to better explain and understand the assembly primitives includes and uses of the language. It presents a highlevel notion of components and develops a "component algebra". This algebra is specialized to deal with the Bcomponents. The B assembly primitives are reexpressed in this basic formalism. Some problems about independence of concepts in the B methodology are pointed out and are discussed. 1 Introduction Specifications, like programs, must be modular because very large formal texts are not understandable for a human being. So, the study of modules and modularization is one of the issues in software engineering. The three main objectives of modularization [BHK90] are : information hiding, compositionality of module operations and reusability of modules. If the specification methodology encompasses the need for formal proofs to ensure consistency, as it is the case in the B ...
A new semantics for Clear
"... Summary. A semantics for the Clear specification language is given. The language of set theory is employed to present constructions corresponding to Clear's specificationcombining operations, which are then used as the basis for a denotational semantics. This is in contrast to Burstall and Goguen's ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Summary. A semantics for the Clear specification language is given. The language of set theory is employed to present constructions corresponding to Clear's specificationcombining operations, which are then used as the basis for a denotational semantics. This is in contrast to Burstall and Goguen's 1980 semantics which described the meanings of these operations
On Combining SemiFormal and Formal Object Specification Techniques
 Recent trends in algebraic development techniques: 12th international workshop, WADT’97
, 1998
"... . In the early phases of software development it seems profitable to freely mix semiformal and formal design techniques. Formal techniques have their strength in their ability to rigorously define desired software qualities like functionality, whereas semiformal methods are usually said to be easi ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
. In the early phases of software development it seems profitable to freely mix semiformal and formal design techniques. Formal techniques have their strength in their ability to rigorously define desired software qualities like functionality, whereas semiformal methods are usually said to be easier to understand and to be more humannature oriented. We propose a new approach in order to combine these two areas by exploiting how constructs of the formal specification language TROLL light are related to the graphical elements of the UML approach. 1 Introduction As a first step and in order to explain the roles of and the relationships between semiformal and formal specifications, let us start with a very simple software process model. We assume software development starts somehow with stating the requirements of the software system. These requirements are then formalized in the specification phase and are made more precise with respect to implementation in the design phase. In the i...
Some Thoughts on Algebraic Specification
 PROC. 3RD WORKSHOP ON THEORY AND APPLICATIONS OF ABSTRACT DATA TYPES
, 1985
"... ..."
Tossing Algebraic Flowers down the Great Divide
 In People and Ideas in Theoretical Computer Science
, 1999
"... Data Types and Algebraic Semantics The history of programming languages, and to a large extent of software engineering as a whole, can be seen as a succession of ever more powerful abstraction mechanisms. The first stored program computers were programmed in binary, which soon gave way to assembly l ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Data Types and Algebraic Semantics The history of programming languages, and to a large extent of software engineering as a whole, can be seen as a succession of ever more powerful abstraction mechanisms. The first stored program computers were programmed in binary, which soon gave way to assembly languages that allowed symbolic codes for operations and addresses. fortran began the spread of "high level" programming languages, though at the time it was strongly opposed by many assembly programmers; important features that developed later include blocks, recursive procedures, flexible types, classes, inheritance, modules, and genericity. Without going into the philosophical problems raised by abstraction (which in view of the discussion of realism in Section 4 may be considerable), it seems clear that the mathematics used to describe programming concepts should in general get more abstract as the programming concepts get more abstract. Nevertheless, there has been great resistance to u...