2687 search results - page 110 / 538 » Formal Analysis of PKCS |
175
Voted
DATE
2009
IEEE
15 years 10 months ago
2009
IEEE
—In this paper, a novel approach for integrating static non-preemptive software scheduling in formal bottom-up performance evaluation of embedded system models is described. The ...
117
click to vote
IFL
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. This paper is an extension of a previous work where two nondeterminism analyses were presented. One of them was efficient but not very powerful and the other one was more...
170
click to vote
SIGMOD
2011
ACM
14 years 6 months ago
2011
ACM
Probabilistic database systems have successfully established themselves as a tool for managing uncertain data. However, much of the research in this area has focused on efficient...
111
click to vote
ACRI
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Cellular Automata are a powerful formal model for describing physical and computational processes. Qualitative analysis of Cellular Automata is in general a hard problem....
145
Voted
CICLING
2001
Springer
15 years 8 months ago
2001
Springer
In this paper we describe a rule-based formalism for the analysis and labelling of texts segments. The rules are contextual rewriting rules with a restricted form of negation. They...