## {sal,kh,alexk}

### BibTeX

@MISC{Linton_{sal,kh,alexk},

author = {S. Linton and K. Hammond and A. D. Al Zain and P. Trinder and D. Roozemond and P. Horn and Universität Kassel},

title = {{sal,kh,alexk}},

year = {}

}

### OpenURL

### Abstract

We present the results of the first four years of the European research project SCIEnce (www.symbolic-computation.org), which aims to provide key infrastructure for symbolic computation research. A primary outcome of the project is that we have developed a new way of combining computer algebra systems using the Symbolic Computation Software Composability Protocol (SCSCP), in which both protocol messages and data are encoded in the OpenMath format. We describe SCSCP middleware and APIs, outline some implementations for various Computer Algebra Systems (CAS), and show how SCSCP-compliant components may be combined to solve scientific problems that can not be solved within a single CAS, or may be organised into a system for distributed parallel computations.

### Citations

328 |
Stillman,Macaulay 2: a software system for research in algebraic geometry
- Grayson, M
(Show Context)
Citation Context ... implementation is currently a research prototype and not available in the Maple release). There are third-party implementations for TRIP [19, 20], Magma [8] (as a wrapper application), and Macaulay2 =-=[24]-=-. SCSCP thus, as intended, allows a large range of CAS to interact and to share computations. 4. EXAMPLES In this section we provide a number of examples which demonstrate the features and benefits of... |

71 | CHEVIE — A system for computing and processing generic character tables
- Geck, Hiss, et al.
- 1996
(Show Context)
Citation Context ...r specific permission and/or a fee. ISSAC 2010, 25–28 July 2010, Munich, Germany. Copyright 2010 ACM 978-1-4503-0150-3/10/0007 ...$10.00. GAP and Maple in CHEVIE for handling generic character tables =-=[21]-=-; Maple and the PVS theorem prover to obtain more reliable results [1]; GAP and nauty in GRAPE for fast graph automorphisms [40]; and GAP as a service for the ECLiPSe constraint programming system for... |

33 | Generic SBDD using computational group theory
- Gent, Harvey, et al.
- 2003
(Show Context)
Citation Context ...prover to obtain more reliable results [1]; GAP and nauty in GRAPE for fast graph automorphisms [40]; and GAP as a service for the ECLiPSe constraint programming system for symmetrybreaking in search =-=[22]-=-. In all these cases, interfacing to a CAS with the required functionality is far less work than re-implementing the functionality in the “home” system. Even within a single CAS, users may need to com... |

21 | Algorithmic Skeletons - Cole - 1999 |

19 | Computer algebra meets automated theorem proving: Integrating Maple and pvs
- Adams, Dunstan, et al.
- 2001
(Show Context)
Citation Context ..., Germany. Copyright 2010 ACM 978-1-4503-0150-3/10/0007 ...$10.00. GAP and Maple in CHEVIE for handling generic character tables [21]; Maple and the PVS theorem prover to obtain more reliable results =-=[1]-=-; GAP and nauty in GRAPE for fast graph automorphisms [40]; and GAP as a service for the ECLiPSe constraint programming system for symmetrybreaking in search [22]. In all these cases, interfacing to a... |

9 | Symgrid: A framework for symbolic computation on the grid - Hammond, Zain, et al. - 2007 |

6 | Evaluating a high-level parallel language (gph) for computational grids - Zain, Trinder, et al. |

6 | Visualizing Parallel Functional Program Runs – Case Studies with the Eden Trace Viewer
- Berthold, Loogen
(Show Context)
Citation Context ...nDyer polynomials. Of course, we could do it locally in MuPAD, but that would take 38 seconds: >> swindyer := proc(plist) ... : >> R := Dom::UnivariatePolynomial(x,Dom::Rational): >> p1 := R(swindyer(=-=[2,3,5,7,11]-=-)): >> p2 := R(subs(swindyer([2,3,5,7,13,17])),x=3*x-2): >> p := p1 * p2: >> degree(p), nterms(p) 96, 49 >> st := time(): F1 := factor(p): time()-st 38431 Now let us use KANT remotely: >> package("Ope... |

5 | SymGrid-Par: Designing a framework for executing computational algebra systems on Computational Grids
- Zain, Hammond, et al.
- 2007
(Show Context)
Citation Context ...nDyer polynomials. Of course, we could do it locally in MuPAD, but that would take 38 seconds: >> swindyer := proc(plist) ... : >> R := Dom::UnivariatePolynomial(x,Dom::Rational): >> p1 := R(swindyer(=-=[2,3,5,7,11]-=-)): >> p2 := R(subs(swindyer([2,3,5,7,13,17])),x=3*x-2): >> p := p1 * p2: >> degree(p), nterms(p) 96, 49 >> st := time(): F1 := factor(p): time()-st 38431 Now let us use KANT remotely: >> package("Ope... |

4 |
Computational algebra and number theory
- Daberkow, Fieker, et al.
- 1997
(Show Context)
Citation Context ...1’ name=’times’/> <OMA> <OMS cd=’transc1’ name=’sin’/> <OMV name=’x’/> </OMA> <OMV name=’a’/> </OMA> </OMA> Now we use it to establish an SCSCP connection to a machine 400km away that is running KANT =-=[12]-=-. We use the KANT server to factor the product of shifted SwinnertonDyer polynomials. Of course, we could do it locally in MuPAD, but that would take 38 seconds: >> swindyer := proc(plist) ... : >> R ... |

3 |
E.: The SmallGroups Library. http://www-public.tu-bs. de:8080/~beick/soft/small/small.html (2002). An accepted GAP 4 package [11
- Besche, Eick, et al.
(Show Context)
Citation Context ...ividual systems. 4.1 GAP In order to illustrate the flexibility of our approach, we will describe three possible ways to set up a procedure for the same kind of problems. The GAP Small Groups Library =-=[7]-=- contains all groups of orders up to 2000, except groups of order 1024. The GAP command SmallGroup(n,i) returns the i-th group of order n. Moreover, for any group G of order 1 ≤ |G| ≤ 2000 where |G| ̸... |

3 | Generic Access to Web and Grid-based Symbolic Computing Services: the SymGrid-Services Framework - Cârstea, Frîncu, et al. - 2007 |

2 | 2008b) ‘Parallelism without pain: orchestrating computational algebra components into a high performance parallel system
- Zain, Trinder, et al.
(Show Context)
Citation Context ...nDyer polynomials. Of course, we could do it locally in MuPAD, but that would take 38 seconds: >> swindyer := proc(plist) ... : >> R := Dom::UnivariatePolynomial(x,Dom::Rational): >> p1 := R(swindyer(=-=[2,3,5,7,11]-=-)): >> p2 := R(subs(swindyer([2,3,5,7,13,17])),x=3*x-2): >> p := p1 * p2: >> degree(p), nterms(p) 96, 49 >> st := time(): F1 := factor(p): time()-st 38431 Now let us use KANT remotely: >> package("Ope... |

2 |
Handbook of Magma Functions, Edition 2.15
- Cannon, Bosma
- 2008
(Show Context)
Citation Context ... project: KANT [17] and Maple [33] (the latter implementation is currently a research prototype and not available in the Maple release). There are third-party implementations for TRIP [19, 20], Magma =-=[8]-=- (as a wrapper application), and Macaulay2 [24]. SCSCP thus, as intended, allows a large range of CAS to interact and to share computations. 4. EXAMPLES In this section we provide a number of examples... |

2 |
The Modular Isomorphism Problem for the Groups of Order 512
- Konovalov, A
- 2011
(Show Context)
Citation Context ... it locally in MuPAD, but that would take 38 seconds: >> swindyer := proc(plist) ... : >> R := Dom::UnivariatePolynomial(x,Dom::Rational): >> p1 := R(swindyer([2,3,5,7,11])): >> p2 := R(subs(swindyer(=-=[2,3,5,7,13,17]-=-)),x=3*x-2): >> p := p1 * p2: >> degree(p), nterms(p) 96, 49 >> st := time(): F1 := factor(p): time()-st 38431 Now let us use KANT remotely: >> package("OpenMath"): >> kant := SCSCP("scscp.math.tu-ber... |

2 |
Symbolic computation software composability
- Freundt, Horn, et al.
- 2008
(Show Context)
Citation Context ...ich demonstrate the features and benefits of SCSCP, such as flexible design, composition of different CAS, working with remote objects and speeding up computations. More examples can be found in e.g. =-=[14, 16]-=- and on the web sites for individual systems. 4.1 GAP In order to illustrate the flexibility of our approach, we will describe three possible ways to set up a procedure for the same kind of problems. ... |

2 |
SCSCP C Library – A C/C++ library for
- Gastineau
- 2009
(Show Context)
Citation Context ...g in the SCIEnce project: KANT [17] and Maple [33] (the latter implementation is currently a research prototype and not available in the Maple release). There are third-party implementations for TRIP =-=[19, 20]-=-, Magma [8] (as a wrapper application), and Macaulay2 [24]. SCSCP thus, as intended, allows a large range of CAS to interact and to share computations. 4. EXAMPLES In this section we provide a number ... |

2 |
Java Library for SCSCP and OpenMath. http://java. symcomp.org
- Horn, Roozemond, et al.
(Show Context)
Citation Context ...creates an SCSCP connection object, that can subsequently be used to send commands to the SCSCP server. Note that the actual connection is initiated on construction by starting the Java program WUPSI =-=[27]-=- which is bundled with the OpenMath package. This uses an asynchronous message-exchange mode, and can therefore be used to introduce background computations. The command s::compute(. . .) can then be ... |

1 |
GAP package. http: //www.cs.st-andrews.ac.uk/~alexk/openmath.htm
- Costantini, Konovalov, et al.
- 2010
(Show Context)
Citation Context ...ng into account their own design principles. 3.1 GAP In the GAP system, support for OpenMath and SCSCP is implemented in two GAP packages called OpenMath and SCSCP, respectively. The OpenMath package =-=[11]-=- is an OpenMath phrasebook for GAP: it converts OpenMath to GAP and vice versa, and provides a framework that users may extend with their private content dictionaries. The SCSCP package [30] implement... |

1 |
OpenMath in SCIEnce: Evolving of symbolic computation interaction
- Freundt, Horn, et al.
(Show Context)
Citation Context ...ich demonstrate the features and benefits of SCSCP, such as flexible design, composition of different CAS, working with remote objects and speeding up computations. More examples can be found in e.g. =-=[14, 16]-=- and on the web sites for individual systems. 4.1 GAP In order to illustrate the flexibility of our approach, we will describe three possible ways to set up a procedure for the same kind of problems. ... |

1 |
Interaction between the specialized and general computer algebra systems using the SCSCP protocol
- Gastineau
(Show Context)
Citation Context ...g in the SCIEnce project: KANT [17] and Maple [33] (the latter implementation is currently a research prototype and not available in the Maple release). There are third-party implementations for TRIP =-=[19, 20]-=-, Magma [8] (as a wrapper application), and Macaulay2 [24]. SCSCP thus, as intended, allows a large range of CAS to interact and to share computations. 4. EXAMPLES In this section we provide a number ... |