118 search results - page 20 / 24 » A simple proof of Bazzi's theorem |
JAR
2002
14 years 12 months ago
2002
Abstract. This paper reports on the Mizar formalization of the theory of continuous lattices as presented in A Compendium of Continuous Lattices, [25]. By the Mizar formalization w...
TACAS
2010
Springer
15 years 7 months ago
2010
Springer
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...
103
click to vote
TACAS
1997
Springer
15 years 4 months ago
1997
Springer
Abstract. We have argued previously that the e ectiveness of a veri cation system derives not only from the power of its individual features for expression and deduction, but from ...
COCO
1994
Springer
15 years 4 months ago
1994
Springer
Recent results by Toda, Vinay, Damm, and Valiant have shown that the complexity of the determinant is characterized by the complexity of counting the number of accepting computati...
88
Voted
KBSE
1997
IEEE
15 years 4 months ago
1997
IEEE
Deduction-based software component retrieval uses preand postconditions as indexes and search keys and an automated theorem prover (ATP) to check whether a component matches. This...