The proceedings contain 20 papers. The special focus in this conference is on genericprogramming. The topics include: Fundamentals of genericprogramming;requirement oriented programming;the refinement relation of gr...
ISBN:
(纸本)9783540410904
The proceedings contain 20 papers. The special focus in this conference is on genericprogramming. The topics include: Fundamentals of genericprogramming;requirement oriented programming;the refinement relation of graph-based generic programs;the construction principles of the class library KARLA;exception-safety in generic components;segmented iterators and hierarchical algorithms;theory and generality of complete traversals;translating parameterised types into java;software development in PVS using generic development steps;model checking generic container implementations;mizar correctness proofs of generic fraction field arithmetic;language independent container specification;applications of the genericprogramming paradigm in the design of CGAL;the STL model in the geometric domain and a genericprogramming environment for high-performance mathematical libraries.
In a customer-oriented environment standardized models are replaced by generic products. A generic product is defined through a set of attributes, which may have a set of alternative values. Since the number of varian...
详细信息
In a customer-oriented environment standardized models are replaced by generic products. A generic product is defined through a set of attributes, which may have a set of alternative values. Since the number of variants may run into high numbers, it is impossible to design and maintain a bill of material (BOM) structure for each variant. A solution is to describe all product variants in one generic BOM. BOMs for each product variant may then be generated from this structure by specifying attributes. By describing the generic BOM as an executable computer program we get the flexibility needed to integrate different aspects of a product in one structure. (C) 1998 Elsevier Science B.V. All rights reserved.
genericprogramming is requirement oriented programming. We study the concept of genericity and generic concepts. Support of genericprogramming is exemplified by TECTON formalizations of algebraic and STL concepts. W...
详细信息
ISBN:
(纸本)3540410902
genericprogramming is requirement oriented programming. We study the concept of genericity and generic concepts. Support of genericprogramming is exemplified by TECTON formalizations of algebraic and STL concepts. We call for a common effort to establish and maintain generic libraries.
This paper introduces SUCHTHAT, a language for experiments in genericprogramming. SUCHTHAT forms the synthesis of two independently developed languages: ALDES, a language for algorithm descriptions, and TECTON, a spe...
详细信息
ISBN:
(纸本)3540410902
This paper introduces SUCHTHAT, a language for experiments in genericprogramming. SUCHTHAT forms the synthesis of two independently developed languages: ALDES, a language for algorithm descriptions, and TECTON, a specification language for generic components. The SUCHTHAT language is characterized by its support of algorithmic requirements and dependent genericity. We discuss the underlying design decisions and show that the semantic interpretation of overloading plays a key role in determining optimal instantiations.
This paper is concerned with a mechanized formal treatment of the transformational software development process in a unified framework. We utilize the PVS system to formally represent, verify and correctly apply gener...
详细信息
ISBN:
(纸本)3540410902
This paper is concerned with a mechanized formal treatment of the transformational software development process in a unified framework. We utilize the PVS system to formally represent, verify and correctly apply generic software development steps and development methods from different existing transformational approaches. We illustrate our approach by representing the well-known divide-and-conquer paradigm, two optimization steps, and by formally deriving a mergesort program.
We propose the MIZAR system as a theorem prover capable of verifying generic algebraic algorithms on an appropriate abstract level. The main advantage of the MIZAR theorem prover is its special proof script language t...
详细信息
ISBN:
(纸本)3540410902
We propose the MIZAR system as a theorem prover capable of verifying generic algebraic algorithms on an appropriate abstract level. The main advantage of the MIZAR theorem prover is its special proof script language that enables textbook style presentation of proofs, hence allowing proofs in the language of algebra. Using MIZAR we were able to give a rigorous machine assisted correctness proof of a generic version of the Brown/Henrici arithmetic in the field of fractions over arbitrary gcd domains.
We report on the use of the genericprogramming paradigm in the computational geometry algorithms library CGAL. The parameterization of the geometric algorithms in CGAL enhances flexibility and adaptability and opens ...
详细信息
ISBN:
(纸本)3540410902
We report on the use of the genericprogramming paradigm in the computational geometry algorithms library CGAL. The parameterization of the geometric algorithms in CGAL enhances flexibility and adaptability and opens an easy way for abolishing precision and robustness problems by exact but nevertheless efficient computation. Furthermore we discuss circulators, which are an extension of the iterator concept to circular structures. Such structures arise frequently in geometric computing.
We report on a programming environment for the development of generic mathematical libraries based on functors (parameterized modules) that have rigorously specified but very abstract interfaces. We focus on the combi...
详细信息
ISBN:
(纸本)3540410902
We report on a programming environment for the development of generic mathematical libraries based on functors (parameterized modules) that have rigorously specified but very abstract interfaces. We focus on the combination of the functor-based programming style with software engineering principles in large development projects. The generated target code is highly efficient and can be easily embedded into foreign application environments.
Implementing non-trivial algorithms, like many graph algorithms, is generally expensive, Thus, it is desirable to reuse such implementations whenever possible. The implementations of graph algorithms normally cannot b...
详细信息
ISBN:
(纸本)3540410902
Implementing non-trivial algorithms, like many graph algorithms, is generally expensive, Thus, it is desirable to reuse such implementations whenever possible. The implementations of graph algorithms normally cannot be reused mainly because the representations of graphs differ in many ways and the implementations normally assume one specific representation. This article presents an approach to overcoming this problem which is based mainly on special iterators and special means to access data associated with objects.
暂无评论