Results 1 - 10
of
75
The Syntax Definition Formalism SDF - Reference Manual
, 2001
"... SDF is a formalism for the definition of syntax which is comparable to BNF in some respect, but has a wider scope in that it also covers the definition... ..."
Abstract
-
Cited by 132 (23 self)
- Add to MetaCart
SDF is a formalism for the definition of syntax which is comparable to BNF in some respect, but has a wider scope in that it also covers the definition...
Meta-Environment: a Component-Based Language Development Environment
"... The Asf+Sdf Meta-Environment is an interactive development environment for the automatic generation of interactive systems for constructing language de nitions and generating tools for them. Over the years, this system has been used in a variety of academic and commercial projects ranging from f ..."
Abstract
-
Cited by 78 (20 self)
- Add to MetaCart
The Asf+Sdf Meta-Environment is an interactive development environment for the automatic generation of interactive systems for constructing language de nitions and generating tools for them. Over the years, this system has been used in a variety of academic and commercial projects ranging from formal program manipulation to conversion of COBOL systems. Since the existing implementation of the Meta-Environment started exhibiting more and more characteristics of a legacy system, we decided to build a completely new, component-based, version. We demonstrate this new system and stress its open architecture.
The Discrete Time ToolBus - a software coordination architecture
, 1998
"... . The notion of "time" plays an important role when coordinating ..."
Abstract
-
Cited by 52 (12 self)
- Add to MetaCart
. The notion of "time" plays an important role when coordinating
Term Rewriting With Traversal Functions
- ACM Trans. Softw. Eng. Methodol
, 2001
"... Term rewriting is an appealing technique for performing program analysis and program transformation. Tree (term) traversal is frequently used but is not supported by standard term rewriting. ..."
Abstract
-
Cited by 51 (8 self)
- Add to MetaCart
Term rewriting is an appealing technique for performing program analysis and program transformation. Tree (term) traversal is frequently used but is not supported by standard term rewriting.
Automatically Checking an Implementation against Its Formal Specification
- IEEE Transactions on Software Engineering
, 2000
"... - ..."
Origin Tracking
- Journal of Symbolic Computation
, 1992
"... In the framework of conditional, not necessarily orthogonal, term rewriting systems, ..."
Abstract
-
Cited by 43 (19 self)
- Add to MetaCart
In the framework of conditional, not necessarily orthogonal, term rewriting systems,
Compiling Language Definitions: The ASF+SDF Compiler
, 1999
"... The ASF+SDF Meta-Environment is an interactive language development environment... ..."
Abstract
-
Cited by 33 (5 self)
- Add to MetaCart
The ASF+SDF Meta-Environment is an interactive language development environment...
LCM 3.0- A Language for Describing Conceptual Models Syntax Definition
, 1993
"... Data Types (ADT's) in the framework of order sorted algebraic specifications, in a way similar to the specification languages OBJ[6] and ASF[2]. The syntactical construct for defining ADTs in LCM is the hValueBlocki, in which you bind a name to a set of values, and define the appearance of function ..."
Abstract
-
Cited by 30 (13 self)
- Add to MetaCart
Data Types (ADT's) in the framework of order sorted algebraic specifications, in a way similar to the specification languages OBJ[6] and ASF[2]. The syntactical construct for defining ADTs in LCM is the hValueBlocki, in which you bind a name to a set of values, and define the appearance of functions and constants related to that set. The meaning of the expressions using values from that set is expressed by giving equations. As a simple example, a value block for specifying a sort representing the colors of a traffic light, together with a function nextcolor might look like this: begin value type TRAFFICLIGHTCOLOR functions -- Constants are viewed as functions without parameters. red : TRAFFICLIGHTCOLOR; orange : TRAFFICLIGHTCOLOR; green : TRAFFICLIGHTCOLOR; -- A function to return the next color to be displayed, -- given the current color of a traffic light. nextcolor(TRAFFICLIGHTCOLOR) : TRAFFICLIGHTCOLOR; predicates continue(TRAFFICLIGHTCOLOR); axioms nextcolor(red) = ...
An Algebraic Specification of a Language for Describing Financial Products
- ICSE-17 Workshop on Formal Methods Application in Software Engineering
, 1995
"... We report on the use of formal methods and supporting tools during the development of a language applied in a banking environment. This language, called RISLA, is used to define the nature of the interest products offered by a bank. A RISLA description fixes the cash flows (amounts of money coming i ..."
Abstract
-
Cited by 25 (6 self)
- Add to MetaCart
We report on the use of formal methods and supporting tools during the development of a language applied in a banking environment. This language, called RISLA, is used to define the nature of the interest products offered by a bank. A RISLA description fixes the cash flows (amounts of money coming in or going out on particular dates) resulting from a product, and is used to generate COBOL code. The language has been developed with the use of algebraic specifications, the role of which is discussed. Note: An extended abstract appeared under the same title in M. Wirsing (editor), Proceedings of the ICSE-17 Workshop on Formal Methods Application in Software Engineering Practice, Seattle, April 1995. Keywords & Phrases: algebraic specifications, financial engineering, COBOL, formal methods experience, tool support; Work done while at CWI, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands. y Work done while at the Programming Research Group of the University of Amsterdam. 1 Intro...

