64 search results - page 7 / 13 » On the Proof Complexity of Deep Inference |
LICS
1997
IEEE
14 years 23 days ago
1997
IEEE
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
CVPR
2010
IEEE
13 years 11 months ago
2010
IEEE
In this paper, we present an approach to multi-view image-based 3D reconstruction by statistically inversing the ray-tracing based image generation process. The proposed algorithm...
TPHOL
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract. We present a comprehensive set of tactics that make it practical to use separation logic in a proof assistant. These tactics enable the verification of partial correctne...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
ENTCS
2006
13 years 8 months ago
2006
Parkinson, Bornat, and Calcagno recently introduced a logic for partial correctness in which program variables are treated as resource, generalizing earlier work based on separati...