2137 search results - page 179 / 428 » Proving Abstract Non-interference |
122
Voted
WDAG
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Optimistic and nonblocking concurrent algorithms are increasingly finding their way into practical use; an important example is software transactional memory implementat...
139
click to vote
CALCO
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems. This...
140
click to vote
CIARP
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Gender recognition problem has not been extensively studied in situations where the face cannot be accurately detected and it also can be partially occluded. In this cont...
104
click to vote
CIE
2009
Springer
15 years 9 months ago
2009
Springer
computability uses ordinals instead of natural numbers in abstract machines like register or Turing machines. We give an overview of the computational strengths of α-β-machines,...
109
click to vote
CONCUR
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Concavely-priced probabilistic timed automata, an extension of probabilistic timed automata, are introduced. In this paper we consider expected reachability, discounted, ...