1410 search results - page 41 / 282 » Proving theorems by reuse |
CORR
2008
Springer
13 years 10 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...
INFOCOM
2002
IEEE
14 years 2 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
14 years 2 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
14 years 1 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...
ACL
1996
13 years 11 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...