Easy composition of symbolic computation software: A new lingua franca for symbolic computation

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2010, Pages 339-346

  Linton, S ^a   Hammond, K ^a   Konovalov, A ^a   Al Zain, A D ^b   Trinder, R ^b   Roozemond, D ^c   Horn, R ^d  

^a UNIVERSITY OF ST ANDREWS   (United Kingdom)

^b HERIOT WATT UNIVERSITY   (United Kingdom)

^c EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^d UNIVERSITY OF KASSEL   (Germany)

Author keywords

Coordination; Interface; OpenMath; Parallelism; SCSCP

Indexed keywords

COORDINATION; INTERFACE; OPENMATH; PARALLELISM; SCSCP;

ALGEBRA; MIDDLEWARE; RESEARCH;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 77956294972     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (42)

1. A. Adams, M. Dunstan, H. Gottliebsen, T. Kelsey, U. Martin, and S. Owre. Computer Algebra meets Automated Theorem Proving: Integrating Maple and PVS. In Proc. TPHOLs 2001: Intl. Conf. on Theorem Proving in Higher Order Logics, Springer LNCS 2152, pages 27-42, 2001.
2. A. Al Zain, K. Hammond, P. Trinder, S. Linton, H.-W. Loidl, and M. Costantini. SymGrid-Par: Designing a Framework for Executing Computational Algebra Systems on Computational Grids. In Proc. ICCS '07: 7th Intl. Conf. on Computational Science, Springer LNCS 4488, pages 617-624, 2007.
3. A. Al Zain, P. Trinder, K. Hammond, A. Konovalov, S. Linton, and J. Berthold. Parallelism without pain: Orchestrating computational algebra components into a high-performance parallel system. In Proc. IEEE Intl. Symp. on Parallel and Distributed Processing with Applications (ISPA 2008), Sydney, Australia, pages 99-112, 2008.
4. A. Al Zain, P. Trinder, G. Michaelson, and H.-W. Loidl. Evaluating a High-Level Parallel Language (GpH) for Computational GRIDs. IEEE Trans. Parallel Distrib. Syst., 19(2):219-233, 2008.
5. J. Berthold and R. Loogen. Visualizing parallel functional program runs: Case studies with the eden trace viewer. In Proc. PARCO 2007: Intl. Conf. on Parallel Computing: Architectures, Algorithms and Applications, volume 15 of Advances in Parallel Computing, pages 121-128. IOS Press, 2007.
6. H. Besehe and B. Eick. Construction of finite groups. J. Symbolic Comput, 27(4):387-404, 1999.
7. H. Besehe, B. Eick, and E. O'Brien. The Small Groups Library, http : //www-public.tu-bs.de : 8080/~beick/soft/small/small.html.
8. J. Cannon and W. Bosma (Eds.). Handbook of Magma Functions, Edition 2.15, 2008. School of Mathematics and Statistics, University of Sydney http ://magma.maths.usyd.edu.au/.
9. A. Cârstea, M. Frîncu, G. Macariu, D. Petcu, and K. Hammond. Generic Access to Web and Grid-based Symbolic Computing Services: the SymGrid-Services Framework. In Proc. ISPDC 07: Intl. Symp. on Parallel and Distributed Computing, Castle Hagenberg, Austria, IEEE Press, pages 143-150, 2007.
10. M. Cole. Algorithmic Skeletons. In Research Directions in Parallel Functional Programming, chapter 13, pages 289-304. Springer-Verlag, 1999.
11. M. Costantini, A. Konovalov, and A. Solomon. OpenMath - OpenMath functionality in GAP, Version 10.1, 2010. GAP package, http: //www.cs.st-andrews.ac.uk/'alexk/openmath.htm.
12. M. Daberkow, C. Fieker, J. Klüners, M. Pohst, K. Roegner, M. Schörnig, and K. Wildanger. KANT V4. J. Symbolic Comput, 24(3-4):267-283, 1997.
13. Computational Algebra and Number Theory, 1993.
14. B. Eick and A. Konovalov. The modular isomorphism problem for the groups of order 512. In Groups St. Andrews 2009, London Math. Soc. Lecture Note Ser. (Accepted).
15. S. Freundt, P. Horn, A. Konovalov, S. Lesseni, S. Linton, and D. Roozemond. OpenMath in SCIEnce: Evolving of symbolic computation interaction. In proceedings of OpenMath Workshop 2009 (to appear).
16. S. Freundt, P. Horn, A. Konovalov, S. Linton, and D. Roozemond. Symbolic Computation Software Composability Protocol (SCSCP) specification. http://www.symbolic-computation.org/scscp, Version 1.3, 2009.
17. S. Freundt, P. Horn, A. Konovalov, S. Linton, and D. Roozemond. Symbolic computation software composability. In AISC/MKM/Calculemus, Springer LNCS 5144, pages 285-295, 2008.
18. S. Freundt and S. Lesseni. KANT 4 SCSCP Package. http://www.math.tu- berlin.de/~kant/kantscscp.html.
19. The GAP Group. GAP - Groups, Algorithms, and Programming, Version 4.4.12, 2008. http ://www.gap-system.org.
20. M. Gastineau. SCSCP C Library - A C/C++ library for Symbolic Computation Software Composibility Protocol, Version 0.6.0. IMCCE, 2009. http ://www.imcce.fr/Equipes/ASD/trip/scscp/.
21. M. Gastineau. Interaction between the specialized and general computer algebra systems using the SCSCP protocol. Submitted.
22. M. Geek, G. Hiss, F. Lübeck, G. Malle, and G. Pfeiffer. CHEVIE - A system for computing and processing generic character tables for finite groups of Lie type, Weyl groups and Hecke algebras. Appl. Algebra Engrg. Comm. Comput, 7:175-210, 1996.
23. I. Gent, W. Harvey, T. Kelsey, and S. Linton. Generic SBDD Using Computational Group Theory. In Proc. CP 2003: Intl. Conf. on Principles and Practice of Constraint Programming, Kinsale, Ireland, pages 333-347, 2003.
24. Globus toolkit, http://www.globus.org/toolkit/.
25. D. Grayson and M. Stillman. Macaulay2, a software system for research in algebraic geometry. Available at http://www.math.uiuc.edu/Macaulay2/.
26. K. Hammond, A. Al Zain, G. Cooperman, D. Petcu, and P. Trinder. SymGrid: a Framework for Symbolic Computation on the Grid. In Proc. EuroPar'07, LNCS, Rennes, France, August 2007.
27. P. Horn. MuPAD OpenMath Package, 2009. http ://mupad.symcomp.org/.
28. P. Horn and D. Roozemond. java.symcomp.org - Java Library for SCSCP and OpenMath. http://java.symcomp.org/.
29. P. Horn and D. Roozemond. WUPSI -Universal Popcorn SCSCP Interface. http ://java.symcomp.org/wupsi.html.
30. P. Horn and D. Roozemond. Open Math in SCIEnce: SCSCP and POPCORN. In Intelligent Computer Mathematics - MKM 2009, volume 5625 of Lecture Notes in Artificial intelligence, pages 474-479. Springer, 2009.
31. A. Konovalov and S. Linton. SCSCP - Symbolic Computation Software Composability Protocol, Version 1.2, 2010. GAP package, http: //www.cs.st-andrews.ac.uk/~alexk/scscp.htm.
32. A. Konovalov and S. Linton. Parallel computations in modular group algebras. (Submitted, 2010).
33. F. Lübeck and M. Neunhöffer. GAPDoc - A Meta Package for GAP Documentation, 2008. http://www. math.rwth-aachen.de/Trank.Luebeck/GAPDoc.
34. Maple, http://www.maplesoft.com/.
35. MuPAD. http://www.sciface.com/.
36. M. Neunhöffer. IO - Bindings for low level C library IO, 2009. http://www-groups.mcs.st-and.ac.uk/~neunhoef/Computer/Software/Gap/io.html.
37. E. O'Brien, W. Nickel, and G. Gamble. ANUPQ ANU p-Quotient, Version 3.0, 2006. http: //www.math.rwth-aachen.de/~Greg.Gamble/ANUPQ/
38. OpenMath. http://www.openmath.org/.
39. S. Peyton Jones (ed.), J. Hughes, L. Augustsson, D. Barton, B. Boutel, W. Burton, J. Fasel, K. Hammond, R. Hinze, P. Hudak, T. Johnsson, M. Jones, J. Launchbury, E. Meijer, J. Peterson, A. Reid, C. Runciman, and P. Wadler. Haskell 98 Language and Libraries. The Revised Report. Cambridge University Press, April 2003.
40. Sage, http://www.sagemath.org/.
41. L. Soicher. Computing with graphs and groups. In Topics in Algebraic Graph Theory, pages 250-266. Cambridge University Press, 2004.
42. P. Trinder, K. Hammond, J. Mattson Jr., A. Partridge, and S. Peyton Jones. GUM: a Portable Parallel Implementation of Haskell. In Proc. PLDI '96: Intl. Conf. on Programming Language Design and Implementation, Philadelphia, PA, USA, pages 79-88, May 1996.