This book is a synopsis of basic and applied research done at the various research institutions of the Softwarepark Hagenberg in Austria. Starting with 15 coworkers in my Research Institute for Symbolic Computation (RISC), I initiated the Softwarepark Hagenberg in 1987 on request of the Upper Austrian Government with the objective of creating a scientific, technological, and economic impulse for the region and the international community. In the meantime, in a joint effort, the Softwarepark Hagenberg has grown to the current (2009) size of over 1000 R&D employees and 1300 students in six research institutions, 40 companies and 20 academic study programs on the bachelor, master’s and PhD level.
KeywordsSymbolic Computation Automate Theorem Prove Loop Invariant Research Funding Agency International Research Community
Unable to display preview. Download preview PDF.
- [Buc65]B. Buchberger. An Algorithm for Finding the Basis Elements in the Residue Class Ring Modulo a Zero Dimensional Polynomial Ideal. PhD thesis, University Innsbruck, Mathematical Institute, 1965. German, English translation in: J. of Symbolic Computation, Special Issue on Logic, Mathematics, and Computer Science: Interactions. Volume 41, Number 3–4, Pages 475–511, 2006.Google Scholar
- [Buc70]B. Buchberger. An Algorithmical Criterion for the Solvability of Algebraic Systems of Equations. Aequationes mathematicae, 4(3):374–383, 1970. German. English translation in: B. Buchberger, F. Winkler (eds.), Groebner Bases and Applications, London Mathematical Society Lecture Note Series, Vol. 251, Cambridge University Press, 1998, pp. 535–545.zbMATHCrossRefMathSciNetGoogle Scholar