Results 1 -
5 of
5
Test Case Characterisation By Regular Path Expressions
"... A signature-parametric (say generic) framework for test case characterisation, and definition of test set coverage criteria is developed. The signature might correspond to a programming language syntax, the format of a data structure, a computational or semantical structure, e.g., for derivations, p ..."
Abstract
-
Cited by 6 (4 self)
- Add to MetaCart
A signature-parametric (say generic) framework for test case characterisation, and definition of test set coverage criteria is developed. The signature might correspond to a programming language syntax, the format of a data structure, a computational or semantical structure, e.g., for derivations, proof trees, or control-flow graphs. Test set characterisation is based on regular expressions describing paths for terms over the signature at hand. Necessary and convenient properties for test set coverage criteria can be conceived in the framework.
Grammars of Syntactical Functions
"... : This draft 1 provides the most recent collection of definitions and explanations on the GSF formalism. The basic motivation for this draft has been to provide the formal base and the intuitive introduction for GSFs as required in the context of the system LDL. Thus, certain aspects like comparis ..."
Abstract
- Add to MetaCart
: This draft 1 provides the most recent collection of definitions and explanations on the GSF formalism. The basic motivation for this draft has been to provide the formal base and the intuitive introduction for GSFs as required in the context of the system LDL. Thus, certain aspects like comparison with other formalims, particular questions of implementation are not in the centre of this presentation. Date: 10.11.95 13:51 Contents 1 Overview 2 2 Introduction of GSFs 3 3 Basic formalization 8 4 GSFs as a specification language 13 5 References 18 1 This draft is in an early stage. I would be very grateful for comments. Most of the contents is not my personal achievement but rather newly formulated and assembled presentation of notions, terms and results already earlier published by Gnter Riedewald, Uwe Lmmel and me. However, for insufficiencies and incorrectness in the draft I am responsible only. Ralf Lmmel: Grammars of Syntactical Functions 2 1 Overview Not yet available. 2...
Operating on Parameterized Context-Free Grammars
, 1996
"... : A central formalism in the Language Development Laboratory (LDL 2 ; [Rie92]) are GSFs (Grammars of Syntactical Functions) - a kind of attribute grammars (AGs) which are closely related to logic programs since GSFs can be regarded as parameterized context-free grammars with relations associated w ..."
Abstract
- Add to MetaCart
: A central formalism in the Language Development Laboratory (LDL 2 ; [Rie92]) are GSFs (Grammars of Syntactical Functions) - a kind of attribute grammars (AGs) which are closely related to logic programs since GSFs can be regarded as parameterized context-free grammars with relations associated with the rules. LDL supports the formal definition of programming and special purpose languages where the automatic derivation of prototype interpreters is supported due to an implementational model based on logic programming. Here, we want to present a metaprogramming -like approach to the language design (specification) which supports the attachment of semantic aspects to a specification as well as the modification and composition of given fragments. The specification writer is supported by a type system. The approach is currently incorporated into the system LDL. The motivation for this operationoriented style of specification is given by the need for extensibility of specifications (i.e. ...
