2137 search results - page 110 / 428 » Proving Abstract Non-interference |
100
Voted
LATA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. In this paper we prove the following result. Let s be an infinite word on a finite alphabet, and N ≥ 0 be an integer. Suppose that all left special factors of s longe...
109
click to vote
DEXA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We define a formal syntax and semantics for the Rule Definition Language (RDL) of DemaqLite, which is a fragment of the declarative XML message processing system Demaq....
230
Voted
ERSHOV
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We present an algorithm for generating all polynomial invariants of Psolvable loops with assignments and nested conditionals. We prove termination of our algorithm. The p...
118
Voted
FCT
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. In the paper we show that there is a close relationship between the energy complexity and the depth of threshold circuits computing any Boolean function although they hav...
119
click to vote
IWANN
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. A new algorithm is presented for finding genotype-phenotype association rules from data related to complex diseases. The algorithm was based on Genetic Algorithms, a tech...