1410 search results - page 138 / 282 » Proving theorems by reuse |
160
click to vote
RSA
2010
15 years 22 days ago
2010
We consider Gibbs distributions on finite random plane trees with bounded branching. We show that as the order of the tree grows to infinity, the distribution of any finite neighb...
148
click to vote
SIAMCOMP
2010
15 years 22 days ago
2010
An equality template (also equality constraint language) is a relational structure with infinite universe whose relations can be defined by boolean combinations of equalities. We ...
154
click to vote
SIAMIS
2010
15 years 22 days ago
2010
Abstract. The linear inverse source and scattering problems are studied from the perspective of compressed sensing, in particular the idea that sufficient incoherence and sparsity ...
165
click to vote
CAV
2011
Springer
14 years 9 months ago
2011
Springer
Abstract. We describe a tool that applies theorem proving technology to synthesize code fragments that use given library functions. To determine candidate code fragments, our appro...
167
click to vote
IJIS
2011
14 years 9 months ago
2011
In this paper, we propose a method for modeling concepts in full computation-tree logic with sequence modal operators. An extended full computation-tree logic, CTLS∗ , is introdu...