13383 search results - page 174 / 2677 » Abstractions from proofs |
198
click to vote
FASE
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Graph constraints were introduced in the area of graph transformation, in connection with the notion of (negative) application conditions, as a form to limit the applicab...
167
click to vote
ENTCS
2007
15 years 6 months ago
2007
We formalize in the logical framework ATS/LF a proof based on Tait’s method that establishes the simply-typed lambda-calculus being strongly normalizing. In malization, we emplo...
182
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract— We present a proof for the probabilistic completeness of RRT-based algorithms when planning with constraints on end-effector pose. Pose constraints can induce lowerdime...
149
click to vote
CORR
2011
Springer
15 years 28 days ago
2011
Springer
Abstract. We present a deep embedding of Bellantoni and Cook’s syntactic characterization of polytime functions. We prove formally that it is correct and complete with respect to...
162
click to vote
IPSN
2009
Springer
16 years 1 months ago
2009
Springer
bstract: Enabling Reliable and High-Fidelity Data Center Sensing Chieh-Jan Mike Liang† , Jie Liu‡ , Liqian Luo , Andreas Terzis† † Johns Hopkins University ‡ Microsoft Re...