2137 search results - page 250 / 428 » Proving Abstract Non-interference |
101
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We prove that interactive learning based classical realizability (introduced by Aschieri and Berardi for first order arithmetic [1]) is sound with respect to Coquand game...
139
Voted
DLOG
2010
15 years 1 months ago
2010
Abstract. This paper investigates Description Logics which allow transitive closure of roles to occur not only in concept inclusion axioms but also in role inclusion axioms. First,...
157
Voted
ESA
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We prove that for every graph H, there exists a polynomial-time algorithm deciding if a planar graph can be contracted to H. We introduce contractions and topological min...
109
click to vote
IAT
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract--In this paper, we study the method of ranking intuitionistic fuzzy numbers. Firstly a possibility degree formula is defined to compare two intuitionistic fuzzy numbers. W...
165
Voted
OPODIS
2010
15 years 1 months ago
2010
Abstract. Shared counters are the key to solving a variety of coordination problems on multiprocessor machines, such as barrier synchronization and index distribution. It is desire...