503 search results - page 49 / 101 » Verifying Quantitative Properties Using Bound Functions |
108
click to vote
IACR
2011
13 years 11 months ago
2011
We put forward a generalization of lossy trapdoor functions (LTFs). Namely, all-but-many lossy trapdoor functions (ABM-LTFs) are LTFs that are parametrized with tags. Each tag can...
HYBRID
2009
Springer
15 years 3 months ago
2009
Springer
Abstract. In this paper we propose a trajectory based reachability analysis by using local finite-time invariance property. Trajectory based analysis are based on the execution tra...
104
click to vote
CVPR
2000
IEEE
16 years 1 months ago
2000
IEEE
While several image-based rendering techniques have been proposed to successfully render scenes/objects from a large collection (e.g., thousands) of images without explicitly reco...
TASE
2008
IEEE
14 years 11 months ago
2008
IEEE
The safety of pointer programs is an important issue in high-assurance software design, and their verification remains a major challenge. Pointer Logic has been proposed to verify...
ICFP
2005
ACM
15 years 12 months ago
2005
ACM
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...