Sciweavers

837 search results - page 60 / 168
» Proof Development with OMEGA
Sort
View
104
Voted
COLT
1997
Springer
15 years 4 months ago
General Convergence Results for Linear Discriminant Updates
The problem of learning linear discriminant concepts can be solved by various mistake-driven update procedures, including the Winnow family of algorithms and the well-known Percep...
Adam J. Grove, Nick Littlestone, Dale Schuurmans
118
Voted
RTA
2010
Springer
15 years 4 months ago
Certified Subterm Criterion and Certified Usable Rules
Abstract. In this paper we present our formalization of two important termination techniques for term rewrite systems: the subterm criterion and the reduction pair processor in com...
Christian Sternagel, René Thiemann
96
Voted
ISTCS
1995
Springer
15 years 4 months ago
Some Improvements to Total Degree Tests
A low-degree test is a collection of simple, local rules for checking the proximity of an arbitrary function to a lowdegree polynomial. Each rule depends on the function’s value...
Katalin Friedl, Madhu Sudan
99
Voted
FM
2008
Springer
77views Formal Methods» more  FM 2008»
15 years 2 months ago
A Rigorous Approach to Networking: TCP, from Implementation to Protocol to Service
Abstract. Despite more then 30 years of research on protocol specification, the major protocols deployed in the Internet, such as TCP, are described only in informal prose RFCs and...
Tom Ridge, Michael Norrish, Peter Sewell
TCS
2008
15 years 19 days ago
On strong normalization and type inference in the intersection type discipline
We introduce a new unification procedure for the type inference problem in the intersection type discipline. It is well known that type inference in this case should succeed exact...
Gérard Boudol