922 search results - page 65 / 185 » On a Generalization of the Stone-Weierstrass Theorem |
178
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
158
click to vote
VMCAI
2010
Springer
16 years 3 months ago
2010
Springer
We present a loop property generation method for loops iterating over multi-dimensional arrays. When used on matrices, our method is able to infer their shapes (also called types),...
156
click to vote
ISPD
2010
ACM
16 years 1 months ago
2010
ACM
This paper presents SafeChoice (SC), a novel clustering algorithm for wirelength-driven placement. Unlike all previous approaches, SC is proposed based on a fundamental theorem, s...
170
click to vote
TACAS
2009
Springer
16 years 1 months ago
2009
Springer
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
157
click to vote
SAGT
2009
Springer
16 years 25 days ago
2009
Springer
We study implementability in dominant strategies of social choice functions when sets of types are multi-dimensional and convex, sets of outcomes are arbitrary, valuations for outc...