1410 search results - page 41 / 282 » Proving theorems by reuse |
105
Voted
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
110
Voted
INFOCOM
2002
IEEE
15 years 6 months ago
2002
IEEE
—BGP allows routers to use general preference policies for route selection. This paper studies the impact of these policies on convergence time. We first describe a real-time mo...
CL
2000
Springer
15 years 6 months ago
2000
Springer
The control in multi-strategy proof planning goes beyond the control in other automated theorem proving approaches: not only the selection of the inference and the facts for the n...
ETRICS
2006
15 years 5 months ago
2006
Abstract. We provide a static analysis (using both dataflow analysis and theorem proving) to allow state changes within specifications. This can be used for specification languages...
123
click to vote
ACL
1996
15 years 3 months ago
1996
In this paper, we show that Higher-Order Coloured Unification - a form of unification developed for automated theorem proving - provides a general theory for modeling the interfac...