Using Ontologies and Algebra of Algorithms for Formalized Development of Parallel Programs

• Autorzy: Doroshenko A. , Yatsenko O.
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

ontology; algebra of algorithms; designing and synthesis of programs; parallel programs

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2009
• Tom: Vol. 93, nr 1-3
• Strony: 111--125
• Opis fizyczny: Bibliogr. 25 poz., tab., wykr.

Twórcy

autor

Doroshenko A.

autor

Yatsenko O.

• Institute of Software Systems of National Academy of Sciences of Ukraine Glushkov prosp. 40, 03187 Kyiv, Ukraine,

Bibliografia

• [1] Alur, R., Ivancic, F., Kim, J., Lee, I., Sokolsky, L.: Generating embedded software from heirarchical hybrid models, SIGPLAN Not., 38:171-182, 2003.
• [2] Bures, T., Denney, E., Fischer, B., Nistor, E.C.: The Role of Ontologies in Schema-based Program Synthesis, in: Workshop on Ontologies as Software Engineering Artifacts, Vancouver, Canada, 2004, http://ti.arc.nasa.gov/people/edenney/papers/ontologies.pdf.
• [3] Chen, P.P.: Entity-Relationship Modelling: Historical Events, Future Trends, and Lessons Learned, Software pioneers: contributions to software engineering, Springer-Verlag, New York, 2002, 296-310.
• [4] Czarnecki, K., Eisenecker, U.: Generative Programming: Methods, Tools and Applications, 1st edn. Addison-Wesley Professional, 2000, 864 p.
• [5] Denney, E., Whittle, J.: Combining Model-driven and Schema based Program Synthesis, Proceedings of the 1st International Conference on the Applications of UML and MDA to Software Systems (UMSS'2004), Las Vegas, Nevada, 2004.
• [6] de Roure, D., Jennings, N., Shadbolt, N.: Research Agenda for the Semantic Grid: A Future e-Science Infrastructure, Technical report UKeS-2002-02, UK e-Science Technical Report Series, National e-Science Centre, Edinburgh, UK, 2001, 78 p.
• [7] Doroshenko, A., Shevchenko, R.: A Rewriting Framework for Rule-Based Programming Dynamic Applications, Fundamenta Informaticae, vol. 72, N1-3, Springer-Verlag, Berlin, Heidelberg, New York, 2006, 95-108.
• [8] Fensel, D., Lausen, H., Polleres, A., de Bruijn, J. et al.: Enabling Semantic Web Services. The Web Service Modeling Ontology, Springer-Verlag, Berlin, Heidelberg, New York, 2007, 188 p.
• [9] Gupta, S., Li, Z., Reif, J.: Synthesizing Efficient Programs for Two-Level Memories from Tensor-products, Proc. of the 7th IASTED/ISMMInternational Conference on Parallel and Distributed Computing and Systems, Washington, DC, 1995, 510-513.
• [10] Heimdahl, M.P.E., Keenan, D.J.: Generating code from hierarchical state-based requirements, Proc. IEEE International Symposium on Requirements Engineering, 1997.
• [11] Leonard, E.I., Heitmeyer, C.L.: Automatic Program Generation from Formal Specifications using APTS, in: Automatic Program Development. A Tribute to Robert Paige, Springer Science, Dordrecht, 2008, 93-113.
• [12] Megson, G.M., Rapanotti, L., Chen, X. Automatic synthesis of parallel algorithms, Lecture Notes in Computer Science, vol. 1054, Springer-Verlag, Berlin, Heidelberg, 1996, 51-86.
• [13] MPI: A Message-Passing Interface Standard, http://www-unix.mcs.anl.gov/mpi.
• [14] Mur, R.A.: Automatic Inductive Programming. ICML 2006 Tutorial, 2006.
• [15] Nistor, E.C.: Using Domain Models in Extensible Schema-based Software Synthesis, NASA Ames Research Center, Technical Report, 2004, http://www.ics.uci.edu/ enistor/research/ nistor-report.pdf.
• [16] Noy, N.F., McGuinness, D.L.: Ontology Development 101: A Guide to Creating Your First Ontology, Stanford Knowledge Systems Laboratory Technical Report KSL-01-05 and Stanford Medical Informatics Technical Report SMI-2001-0880, 2001, 25 p.
• [17] OMG, Unified Modeling Language Specification, http://www.uml.org.
• [18] Protege, http://protege.stanford.edu.
• [19] Protege-OWL editor, http://protege.stanford.edu/overview/protege-owl.html.
• [20] Reasoning Systems. Refine User's Guide Version 3.0, 1990.
• [21] Reif, J.H.: Synthesis of Parallel Algorithms, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1993, 1011 p.
• [22] Tauber, J.A., Lynch, N.A., Tsai, M.J.: Compiling IOA without global synchronization, Proc. of the Third IEEE Int'l Symp. on Network Computing and Applications (NCA'2004 ), Washington, DC, 2004.
• [23] Waldinger, R., Jarvis, P., Dungan, J.: Program Synthesis for Multi-Agent Question Answering, International Symposium on Verification (Theory and Practice), Lecture Notes in Computer Science, Springer-Verlag, Berlin, Heidelberg, New York, 2003, 747-761.
• [24] Whalen, M.W.: High-integrity code generation for state-based formalisms, Proc. of the 22nd Int'l Conf. on Software Eng. (ICSE '2000), New York, NY, USA, 2000.
• [25] Yatsenko, Ye.A.: Algebras of Hyperschemes and Integrated Tools for Synthesis of Programs in Modern Object-Oriented Environments, Cybernetics and Systems Analysis, vol. 40, N1, Springer-Verlag, Berlin, Heidelberg, New York, 2004, 38-42.