2137 search results - page 75 / 428 » Proving Abstract Non-interference |
ISMM
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We study hierachical segmentation in the framework of edgeweighted graphs. We define ultrametric watersheds as topological watersheds null on the minima. We prove that t...
JSYML
2010
14 years 8 months ago
2010
Abstract. In [8] we have considered a wide class of “well-behaved” reducibilities for sets of reals. In this paper we continue with the study of Borel reducibilities by proving...
MST
2010
14 years 8 months ago
2010
Abstract We prove that Polynomial Calculus and Polynomial Calculus with Resolution are not automatizable, unless W[P]-hard problems are fixed parameter tractable by one-side error...
CAV
2004
Springer
15 years 1 months ago
2004
Springer
Predicate abstraction has been proved effective for verifying several infinite-state systems. In predicate abstraction, an abstract system is automatinstructed given a set of predi...
CAV
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Many software model checkers are based on predicate abstraction. If the verification goal depends on pointer structures, the approach does not work well, because it is di...