3931 search results - page 558 / 787 » Separation logic and abstraction |
319
click to vote
POPL
2007
ACM
16 years 7 months ago
2007
ACM
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
203
click to vote
CADE
2001
Springer
16 years 7 months ago
2001
Springer
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
224
click to vote
EMSOFT
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We classify component-based models of computation into component models and interface models. A component model speci es for each component how the component behaves in a...
218
Voted
CORR
2002
Springer
15 years 7 months ago
2002
Springer
for data abstraction and justifies reasoning by simulation. Representation independence has been shown for a variety of languages and constructs but not for shared references to mu...
201
click to vote
ECCV
2004
Springer
16 years 9 months ago
2004
Springer
Abstract. In this paper, a new camera calibration algorithm is proposed, which is from the quasi-affine invariance of two parallel circles. Two parallel circles here mean two circl...