Sciweavers

181 search results - page 8 / 37
» Testable Use Cases in the Abstract State Machine Language
Sort
View
MSCS
2010
104views more  MSCS 2010»
13 years 5 months ago
A note on accelerated Turing machines
ABSTRACT. In this note we prove that any Turing machine which uses only a finite computational space for every input cannot solve an uncomputable problem even in case it runs in a...
Cristian S. Calude, Ludwig Staiger
SOCO
2005
Springer
14 years 15 days ago
Stateful Aspects in JAsCo
Aspects that trigger on a sequence of join points instead of on a single join point are not explicitly supported in current AspectOriented approaches. Explicit protocols are howeve...
Wim Vanderperren, Davy Suvée, María ...
SASO
2009
IEEE
14 years 1 months ago
MOCAS: A State-Based Component Model for Self-Adaptation
This paper introduces MOCAS (Model Of Components for Adaptive Systems), a generic state-based component model which enables the self-adaptation of software components together wit...
Cyril Ballagny, Nabil Hameurlain, Franck Barbier
SSPR
2000
Springer
13 years 10 months ago
Encoding Nondeterministic Finite-State Tree Automata in Sigmoid Recursive Neural Networks
Abstract. Recently, a number of authors have explored the use of recursive recursive neural nets (RNN) for the adaptive processing of trees or tree-like structures. One of the most...
Mikel L. Forcada, Rafael C. Carrasco
ACSAC
2007
IEEE
14 years 1 months ago
Tampering with Special Purpose Trusted Computing Devices: A Case Study in Optical Scan E-Voting
Special purpose trusted computing devices are currently being deployed to offer many services for which the general purpose computing paradigm is unsuitable. The nature of the ser...
Aggelos Kiayias, Laurent Michel, Alexander Russell...