Sciweavers

7311 search results - page 131 / 1463
» Time in State Machines
Sort
View
TIME
2002
IEEE
15 years 9 months ago
A Finite-State Approach to Event Semantics
Events employed in natural language semantics are characterized in terms of regular languages, each string in which can be regarded as a motion picture. The relevant finite autom...
Tim Fernando
CAV
2000
Springer
125views Hardware» more  CAV 2000»
15 years 8 months ago
Efficient Reachability Analysis of Hierarchical Reactive Machines
Hierarchical state machines is a popular visual formalism for software specifications. To apply automated analysis to such specifications, the traditional approach is to compile th...
Rajeev Alur, Radu Grosu, Michael McDougall
CTRSA
2010
Springer
200views Cryptology» more  CTRSA 2010»
15 years 11 months ago
Resettable Public-Key Encryption: How to Encrypt on a Virtual Machine
Typical security models used for proving security of deployed cryptographic primitives do not allow adversaries to rewind or reset honest parties to an earlier state. Thus, it is c...
Scott Yilek
ICCD
2004
IEEE
104views Hardware» more  ICCD 2004»
16 years 1 months ago
Exploiting Quiescent States in Register Lifetime
Large register file with multiple ports, but with a minimal access time, is a critical component in a superscalar processor. Analysis of the lifetime of a logical to physical reg...
Rama Sangireddy, Arun K. Somani
ADS
2004
Springer
15 years 8 months ago
From Emotion to Interaction: Lessons from Real Human-Machine-Dialogues
The monitoring of emotional user states can help to assess the progress of human-machine-communication. If we look at specific databases, however, we are faced with several problem...
Anton Batliner, Christian Hacker, Stefan Steidl, E...