Metraipolis › archive › dc_ea610c59e46f
Run-time algorithm specialization — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Run-time_algorithm_specialization
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-07T17:33:33.520Z
- SHA-256 of the archived text
206c5c3415b851cb2d6bcfd9af238506f44a2f53da9c5baaf7b90eddd9fe2a18- Stable URL of this page
https://metraipolis.com/documento/dc_ea610c59e46f
How to cite
Run-time algorithm specialization — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Run-time_algorithm_specialization (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_ea610c59e46f (Metraipolis archive dc_ea610c59e46f, sha256 206c5c3415b851cb2d6bcfd9af238506f44a2f53da9c5baaf7b90eddd9fe2a18)
BibTeX
@misc{dcea610c59e46f,
title = {Run-time algorithm specialization — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Run-time_algorithm_specialization},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_ea610c59e46f; sha256 206c5c3415b851cb2d6bcfd9af238506f44a2f53da9c5baaf7b90eddd9fe2a18},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Run-time_algorithm_specialization. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In computer science, run-time algorithm specialization is a methodology for creating efficient algorithms for costly computation tasks of certain kinds. The methodology originates in the field of automated theorem proving and, more specifically, in the Vampire theorem prover project. The idea is inspired by the use of partial evaluation in optimising program translation. Many core operations in theorem provers exhibit the following pattern. Suppose that we need to execute some algorithm a l g ( A , B ) {\displaystyle {\mathit {alg}}(A,B)} in a situation where a value of A {\displaystyle A} is fixed for potentially many different values of B {\displaystyle B} . In order to do this efficiently, we can try to find a specialization of a l g {\displaystyle {\mathit {alg}}} for every fixed A {\displaystyle A} , i.e., such an algorithm a l g A {\displaystyle {\mathit {alg}}_{A}} , that executing a l g A ( B ) {\displaystyle {\mathit {alg}}_{A}(B)} is equivalent to executing a l g ( A , B ) {\displaystyle {\mathit {alg}}(A,B)} . The specialized algorithm may be more efficient than the generic one, since it can exploit some particular properties of the fixed value A {\displaystyle A} . Typically, a l g A ( B ) {\displaystyle {\mathit {alg}}_{A}(B)} can avoid some operations that a l g ( A , B ) {\displaystyle {\mathit {alg}}(A,B)} would have to perform, if they are known to be redundant for this particular parameter A {\displaystyle A} . In particular, we can often identify some tests that are true or false for A {\displaystyle A} , unroll loops and recursion, etc.
Tema degli esploratori: statistica e scienza dei dati (deposito sistematico; categoria «Algorithms»).
Fonte: Wikipedia in inglese, voce «Run-time algorithm specialization» — https://en.wikipedia.org/wiki/Run-time_algorithm_specialization
Wikidata Q7379464 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q7379464
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Run-time_algorithm_specialization?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1337324489, consultata il 2026-10-07T17:03:45.923Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 52f4fa1be33a67fbf6c0566fa2cd10706ba37cde220287dc6d603aa84e7dea73