Pervasive parallelism in highly-trustable interactive theorem proving systems
2013
Interactive theorem proving is a technology of fundamental importance for mathematics and computer-science. It is based on expressive logical foundations and implemented in a highly trustable way. Applications include huge mathematical proofs and semi-automated verifications of complex software systems. Interactive development of larger and larger proofs increases the demand for computing power, which means explicit parallelism on current multicore hardware [6].
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
18
References
11
Citations
NaN
KQI