290 search results - page 3 / 58 » A Metamodeling Approach for Reasoning about Requirements |
FC
2010
Springer
13 years 12 months ago
2010
Springer
Abstract. Starting from algebraic properties that enable guessing lowentropy secrets, we formalize guessing rules for symbolic verification. The rules are suited for both off-line ...
TALG
2010
13 years 7 months ago
2010
We describe an automata-theoretic approach for the competitive analysis of online algorithms. Our approach is based on weighted automata, which assign to each input word a cost in...
IFIP
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
AAAI
1994
13 years 10 months ago
1994
In this paper we argue that for realistic applications involving default reasoning it is necessary to reason about the priorities of defaults. Existing approaches require the know...
AI
2000
Springer
13 years 8 months ago
2000
Springer
Automated handling of tutoring and training functions in educational systems requires the availability of articulate domain models. In this article we further develop the applicat...