High-integrity code generation for state-based formalisms
Proceedings of the 22nd international conference on Software engineering
Generative programming: methods, tools, and applications
Generative programming: methods, tools, and applications
Synthesis of Parallel Algorithms
Synthesis of Parallel Algorithms
Automatic synthesis of parallel algorithms
Solving Combinatorial Optimization Problems in Parallel - Methods and Techniques
Generating embedded software from hierarchical hybrid models
Proceedings of the 2003 ACM SIGPLAN conference on Language, compiler, and tool for embedded systems
Generating Code from Hierarchical State-Based Requirements
RE '97 Proceedings of the 3rd IEEE International Symposium on Requirements Engineering
Cybernetics and Systems Analysis
Compiling IOA without Global Synchronization
NCA '04 Proceedings of the Network Computing and Applications, Third IEEE International Symposium
Enabling Semantic Web Services: The Web Service Modeling Ontology
Enabling Semantic Web Services: The Web Service Modeling Ontology
A Rewriting Framework for Rule-Based Programming Dynamic Applications
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
| Hi-index | 0.00 |
An approach to formalized development of parallel programs using ontologies and algebra- algorithmic facilities is proposed. Ontology gives opportunity to describe the skeleton of the program representing main objects in the given subject domain, i.e. data, functions to process data and relations between functions. Once the skeleton of the program has been built, further development can be done in automated manner with the Integrated toolkit for Design and Synthesis (IDS) developed by the authors, which is based on using algorithmic algebras facilities. The application of the approach is illustrated with an example of developing parallel MPI program in the subject domain of sorting algorithms.