Sciweavers

949 search results - page 3 / 190
» Lightweight Formal Methods for Computer Algebra Systems
Sort
View
IFL
2003
Springer
144views Formal Methods» more  IFL 2003»
14 years 20 days ago
Building an Interface Between Eden and Maple: A Way of Parallelizing Computer Algebra Algorithms
Eden is a parallel functional language extending Haskell with processes. This paper describes the implementation of an interface between the Eden language and the Maple system. The...
Rafael Martínez, Ricardo Pena
ICSOC
2005
Springer
14 years 29 days ago
A Lightweight Formal Framework for Service-Oriented Applications Design
Leveraging service oriented programming paradigm would significantly affect the way people build software systems. This paper contributes to the above goal proposing a lightweigh...
Aliaksei Yanchuk, Alexander Ivanyukovich, Maurizio...
TAPSOFT
1997
Springer
13 years 11 months ago
Specifying Complex and Structured Systems with Evolving Algebras
This paper presents an approach for specifying complex, structured systems with Evolving Algebras by means of aggregation and composition. Evolving algebras provide a formal method...
Wolfgang May
JAR
1998
134views more  JAR 1998»
13 years 7 months ago
Integrating Computer Algebra into Proof Planning
Mechanized reasoning systems and computer algebra systems have different objectives. Their integration is highly desirable, since formal proofs often involve both of the two differ...
Manfred Kerber, Michael Kohlhase, Volker Sorge
AAECC
1993
Springer
94views Algorithms» more  AAECC 1993»
13 years 11 months ago
Relations Among Lie Formal Series and Construction of Symplectic Integrators
Symplectic integrators are numerical integration schemes for hamiltonian systems. The integration step is an explicit symplectic map. We find symplectic integrators using universa...
Pierre-Vincent Koseleff