Symbolic computation
From Wikipedia, the free encyclopedia
Symbolic computation or algebraic computation, relates to the use of machines, such as computers, to manipulate mathematical equations and expressions in symbolic form, as opposed to manipulating the approximations of specific numerical quantities represented by those symbols. Such a system might be used for symbolic integration or differentiation, substitution of one expression into another, simplification of an expression, etc.
It has uses in software testing under the title of symbolic execution where it can be used to analyse if and when errors in the code may occur. It can be used to predict what code statements do to specified inputs and outputs. It is also important for considering path traversal. It struggles when dealing with statements which are not purely mathematical.
Symbolic computation is also sometimes referred to as symbolic manipulation, symbolic processing, symbolic mathematics, or symbolic algebra, but these terms also refer to non-computational manipulation.
[edit] See also
- Computer algebra system
- Automated theorem prover
- Computer-assisted proof
- Proof checker
- Model checker
- Symbolic-numeric computation
[edit] References
- Making Computer Algebra More Symbolic (Invited), Stephen M. Watt, pp. 43-49, Proc. Transgressive Computing 2006: A conference in honor or Jean Della Dora , (TC 2006), April 24-26 2006, Granada Spain. At [1]
[edit] External links
- A Gentle Introduction to Static Analysis and Logic Programming showing an example of application of symbolic computation to perform static program analysis.
This article was originally based on material from the Free On-line Dictionary of Computing, which is licensed under the GFDL.
 |
This mathematics-related article is a stub. You can help Wikipedia by expanding it. |
