The Experts below are selected from a list of 6240 Experts worldwide ranked by ideXlab platform
Sönke Magnussen - One of the best experts on this subject based on the ideXlab platform.
-
computer aided refinement of data structures on higher order Algebraic Specifications
Lecture Notes in Computer Science, 2004Co-Authors: Walter Dosch, Sönke MagnussenAbstract:The paper studies the transformational refinement of data structures in the framework of higher-order Algebraic Specifications. We present novel procedures that mechanize the refinement of entire data structures within a single complex transformation step. The transformations validate a general refinement relation that captures different types of simulations. General transformation rules describe Algebraic implementations based on abstraction and representation functions. Specialized transformations cover particular changes between data structures. All transformation procedures have been implemented in the Lubeck Transformation System. The system uses analysis algorithms to establish the soundness conditions of the transformations by syntactic criteria. We report practical experiences about manipulating data structures with the system. The paper summarizes results from the second author's PhD thesis [20].
-
WADT - The Lübeck Transformation System: A Transformation System for Equational Higher Order Algebraic Specifications
Recent Trends in Algebraic Development Techniques, 2002Co-Authors: Walter Dosch, Sönke MagnussenAbstract:The Lubeck Transformation System supports the refinement of higher order Algebraic Specifications following sound transformation rules. We discuss the system requirements, describe the specification language and explain the life cycle of a specification in the transformation process. The system analyses various properties of the specification providing user guidance for further design decisions. The refinement relation is implemented by two refinement modes covering the different transformation rules for entire Specifications and single axioms. Finally we describe the architecture and the implementation of the system. Throughout the paper, we accompany the presentation with a running example.
-
the lubeck transformation system a transformation system for equational higher order Algebraic Specifications
Lecture Notes in Computer Science, 2002Co-Authors: Walter Dosch, Sönke MagnussenAbstract:The Lubeck Transformation System supports the refinement of higher order Algebraic Specifications following sound transformation rules. We discuss the system requirements, describe the specification language and explain the life cycle of a specification in the transformation process. The system analyses various properties of the specification providing user guidance for further design decisions. The refinement relation is implemented by two refinement modes covering the different transformation rules for entire Specifications and single axioms. Finally we describe the architecture and the implementation of the system. Throughout the paper, we accompany the presentation with a running example.
Walter Dosch - One of the best experts on this subject based on the ideXlab platform.
-
computer aided refinement of data structures on higher order Algebraic Specifications
Lecture Notes in Computer Science, 2004Co-Authors: Walter Dosch, Sönke MagnussenAbstract:The paper studies the transformational refinement of data structures in the framework of higher-order Algebraic Specifications. We present novel procedures that mechanize the refinement of entire data structures within a single complex transformation step. The transformations validate a general refinement relation that captures different types of simulations. General transformation rules describe Algebraic implementations based on abstraction and representation functions. Specialized transformations cover particular changes between data structures. All transformation procedures have been implemented in the Lubeck Transformation System. The system uses analysis algorithms to establish the soundness conditions of the transformations by syntactic criteria. We report practical experiences about manipulating data structures with the system. The paper summarizes results from the second author's PhD thesis [20].
-
WADT - The Lübeck Transformation System: A Transformation System for Equational Higher Order Algebraic Specifications
Recent Trends in Algebraic Development Techniques, 2002Co-Authors: Walter Dosch, Sönke MagnussenAbstract:The Lubeck Transformation System supports the refinement of higher order Algebraic Specifications following sound transformation rules. We discuss the system requirements, describe the specification language and explain the life cycle of a specification in the transformation process. The system analyses various properties of the specification providing user guidance for further design decisions. The refinement relation is implemented by two refinement modes covering the different transformation rules for entire Specifications and single axioms. Finally we describe the architecture and the implementation of the system. Throughout the paper, we accompany the presentation with a running example.
-
the lubeck transformation system a transformation system for equational higher order Algebraic Specifications
Lecture Notes in Computer Science, 2002Co-Authors: Walter Dosch, Sönke MagnussenAbstract:The Lubeck Transformation System supports the refinement of higher order Algebraic Specifications following sound transformation rules. We discuss the system requirements, describe the specification language and explain the life cycle of a specification in the transformation process. The system analyses various properties of the specification providing user guidance for further design decisions. The refinement relation is implemented by two refinement modes covering the different transformation rules for entire Specifications and single axioms. Finally we describe the architecture and the implementation of the system. Throughout the paper, we accompany the presentation with a running example.
B Marre - One of the best experts on this subject based on the ideXlab platform.
-
testing from Algebraic Specifications test data set selection by unfolding axioms
Lecture Notes in Computer Science, 2006Co-Authors: Marc Aiguier, Agnes Arnould, Pascale Le Gall, Clement Boin, B MarreAbstract:This paper deals with test data set selection from Algebraic Specifications. Test data sets are generated from selection criteria which are usually defined to cover specification axioms. The unfolding selection criterion consists in covering the input domain of an operation using case analysis. The unfolding procedure can be iterated in order to split input domains of operations into finer subdomains. In this paper we propose to extend an unfolding procedure previously developed in [5,19] that could only be performed on very low level, i.e. executable Specifications. On the contrary, our new unfolding procedure can be applied to any positive conditional specification. We show that our unfolding procedure is sound (no test is added) and complete (no test is lost) with respect to the starting reference test data set.
-
FATES - Testing from Algebraic Specifications: test data set selection by unfolding axioms
Formal Approaches to Software Testing, 2005Co-Authors: Marc Aiguier, Pascale Le Gall, Agnes Arnould, Clement Boin, B MarreAbstract:This paper deals with test data set selection from Algebraic Specifications. Test data sets are generated from selection criteria which are usually defined to cover specification axioms. The unfolding selection criterion consists in covering the input domain of an operation using case analysis. The unfolding procedure can be iterated in order to split input domains of operations into finer subdomains. In this paper we propose to extend an unfolding procedure previously developed in [5, 19] that could only be performed on very low level, i.e. executable Specifications. On the contrary, our new unfolding procedure can be applied to any positive conditional specification. We show that our unfolding procedure is sound (no test is added) and complete (no test is lost) with respect to the starting reference test data set.
-
Testing from Algebraic Specifications: test data set selection by unfolding axioms
2005Co-Authors: Marc Aiguier, Pascale Le Gall, Agnes Arnould, Clement Boin, B MarreAbstract:This paper deals with test data set selection from Algebraic Specifications. Test data sets are generated from selection criteria which are usually defined to cover specification axioms. The unfolding selection criterion consists in covering the input domain of an operation using case analysis. The unfolding procedure can be iterated in order to split input domains of operations into finer subdomains. In this paper we propose to extend an unfolding procedure previously developed by Bruno Marre that could only be performed on very low level, i.e. executable Specifications. On the contrary, our new unfolding procedure can be applied to any positive conditional specification. We show that our unfolding procedure is sound (no test is added) and complete (no test is lost) with respect to the starting reference test data set.
Marc Aiguier - One of the best experts on this subject based on the ideXlab platform.
-
exhaustive test sets for Algebraic Specifications
Software Testing Verification & Reliability, 2016Co-Authors: Marc Aiguier, Agnes Arnould, Pascale Le Gall, Delphine LonguetAbstract:In the context of testing from Algebraic Specifications, test cases are ground formulas chosen amongst the ground semantic consequences of the specification, according to some possible additional observability conditions. A test set is said to be exhaustive if every programme P passing all the tests is correct and if for every incorrect programme P, there exists a test case on which P fails. Because correctness can be proved by testing on such a test set, it is an appropriate basis for the selection of a test set of practical size. The largest candidate test set is the set of observable consequences of the specification. However, depending on the nature of Specifications and programmes, this set is not necessarily exhaustive. In this paper, we study conditions to ensure the exhaustiveness property of this set for several Algebraic formalisms equational, conditional positive, quantifier free and with quantifiers and several test hypotheses. Copyright © 2016 John Wiley & Sons, Ltd.
-
testing from Algebraic Specifications test data set selection by unfolding axioms
Lecture Notes in Computer Science, 2006Co-Authors: Marc Aiguier, Agnes Arnould, Pascale Le Gall, Clement Boin, B MarreAbstract:This paper deals with test data set selection from Algebraic Specifications. Test data sets are generated from selection criteria which are usually defined to cover specification axioms. The unfolding selection criterion consists in covering the input domain of an operation using case analysis. The unfolding procedure can be iterated in order to split input domains of operations into finer subdomains. In this paper we propose to extend an unfolding procedure previously developed in [5,19] that could only be performed on very low level, i.e. executable Specifications. On the contrary, our new unfolding procedure can be applied to any positive conditional specification. We show that our unfolding procedure is sound (no test is added) and complete (no test is lost) with respect to the starting reference test data set.
-
FATES - Testing from Algebraic Specifications: test data set selection by unfolding axioms
Formal Approaches to Software Testing, 2005Co-Authors: Marc Aiguier, Pascale Le Gall, Agnes Arnould, Clement Boin, B MarreAbstract:This paper deals with test data set selection from Algebraic Specifications. Test data sets are generated from selection criteria which are usually defined to cover specification axioms. The unfolding selection criterion consists in covering the input domain of an operation using case analysis. The unfolding procedure can be iterated in order to split input domains of operations into finer subdomains. In this paper we propose to extend an unfolding procedure previously developed in [5, 19] that could only be performed on very low level, i.e. executable Specifications. On the contrary, our new unfolding procedure can be applied to any positive conditional specification. We show that our unfolding procedure is sound (no test is added) and complete (no test is lost) with respect to the starting reference test data set.
-
Testing from Algebraic Specifications: test data set selection by unfolding axioms
2005Co-Authors: Marc Aiguier, Pascale Le Gall, Agnes Arnould, Clement Boin, B MarreAbstract:This paper deals with test data set selection from Algebraic Specifications. Test data sets are generated from selection criteria which are usually defined to cover specification axioms. The unfolding selection criterion consists in covering the input domain of an operation using case analysis. The unfolding procedure can be iterated in order to split input domains of operations into finer subdomains. In this paper we propose to extend an unfolding procedure previously developed by Bruno Marre that could only be performed on very low level, i.e. executable Specifications. On the contrary, our new unfolding procedure can be applied to any positive conditional specification. We show that our unfolding procedure is sound (no test is added) and complete (no test is lost) with respect to the starting reference test data set.
Agnes Arnould - One of the best experts on this subject based on the ideXlab platform.
-
exhaustive test sets for Algebraic Specifications
Software Testing Verification & Reliability, 2016Co-Authors: Marc Aiguier, Agnes Arnould, Pascale Le Gall, Delphine LonguetAbstract:In the context of testing from Algebraic Specifications, test cases are ground formulas chosen amongst the ground semantic consequences of the specification, according to some possible additional observability conditions. A test set is said to be exhaustive if every programme P passing all the tests is correct and if for every incorrect programme P, there exists a test case on which P fails. Because correctness can be proved by testing on such a test set, it is an appropriate basis for the selection of a test set of practical size. The largest candidate test set is the set of observable consequences of the specification. However, depending on the nature of Specifications and programmes, this set is not necessarily exhaustive. In this paper, we study conditions to ensure the exhaustiveness property of this set for several Algebraic formalisms equational, conditional positive, quantifier free and with quantifiers and several test hypotheses. Copyright © 2016 John Wiley & Sons, Ltd.
-
testing from Algebraic Specifications test data set selection by unfolding axioms
Lecture Notes in Computer Science, 2006Co-Authors: Marc Aiguier, Agnes Arnould, Pascale Le Gall, Clement Boin, B MarreAbstract:This paper deals with test data set selection from Algebraic Specifications. Test data sets are generated from selection criteria which are usually defined to cover specification axioms. The unfolding selection criterion consists in covering the input domain of an operation using case analysis. The unfolding procedure can be iterated in order to split input domains of operations into finer subdomains. In this paper we propose to extend an unfolding procedure previously developed in [5,19] that could only be performed on very low level, i.e. executable Specifications. On the contrary, our new unfolding procedure can be applied to any positive conditional specification. We show that our unfolding procedure is sound (no test is added) and complete (no test is lost) with respect to the starting reference test data set.
-
FATES - Testing from Algebraic Specifications: test data set selection by unfolding axioms
Formal Approaches to Software Testing, 2005Co-Authors: Marc Aiguier, Pascale Le Gall, Agnes Arnould, Clement Boin, B MarreAbstract:This paper deals with test data set selection from Algebraic Specifications. Test data sets are generated from selection criteria which are usually defined to cover specification axioms. The unfolding selection criterion consists in covering the input domain of an operation using case analysis. The unfolding procedure can be iterated in order to split input domains of operations into finer subdomains. In this paper we propose to extend an unfolding procedure previously developed in [5, 19] that could only be performed on very low level, i.e. executable Specifications. On the contrary, our new unfolding procedure can be applied to any positive conditional specification. We show that our unfolding procedure is sound (no test is added) and complete (no test is lost) with respect to the starting reference test data set.
-
Testing from Algebraic Specifications: test data set selection by unfolding axioms
2005Co-Authors: Marc Aiguier, Pascale Le Gall, Agnes Arnould, Clement Boin, B MarreAbstract:This paper deals with test data set selection from Algebraic Specifications. Test data sets are generated from selection criteria which are usually defined to cover specification axioms. The unfolding selection criterion consists in covering the input domain of an operation using case analysis. The unfolding procedure can be iterated in order to split input domains of operations into finer subdomains. In this paper we propose to extend an unfolding procedure previously developed by Bruno Marre that could only be performed on very low level, i.e. executable Specifications. On the contrary, our new unfolding procedure can be applied to any positive conditional specification. We show that our unfolding procedure is sound (no test is added) and complete (no test is lost) with respect to the starting reference test data set.
