Sciweavers

4520 search results - page 52 / 904
» Algebraic Techniques for Timed Systems
Sort
View
ISSAC
1989
Springer
74views Mathematics» more  ISSAC 1989»
15 years 5 months ago
Lookup Tables, Recurrences and Complexity
The use of lookup tables can reduce the complexity of calculation of functions defined typically by mathematical recurrence relations. Although this technique has been adopted by...
Richard J. Fateman
ECBS
2009
IEEE
113views Hardware» more  ECBS 2009»
15 years 8 months ago
Modeling and Analysis of Probabilistic Timed Systems
Probabilistic models are useful for analyzing systems which operate under the presence of uncertainty. In this paper, we present a technique for verifying safety and liveness prop...
Abhishek Dubey, Derek Riley, Sherif Abdelwahed, Te...
99
Voted
LPNMR
1990
Springer
15 years 5 months ago
The meaning of Negative Premises in Transition System Specifications
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
Roland N. Bol, Jan Friso Groote
ICTAI
2007
IEEE
15 years 8 months ago
Knowledge Based Mechanisms for Tutoring Systems in Science and Engineering
In science and engineering courses, students are often presented a situation for which they are asked to identify the relevant principles and to instantiate them as a set of equat...
Chun Wai Liew, Joel A. Shapiro, Donald E. Smith
EUROCRYPT
2010
Springer
15 years 6 months ago
Algebraic Cryptanalysis of McEliece Variants with Compact Keys
In this paper we propose a new approach to investigate the security of the McEliece cryptosystem. We recall that this cryposystem relies on the use of error-correcting codes. Since...
Jean-Charles Faugère, Ayoub Otmani, Ludovic...