Sciweavers

283 search results - page 28 / 57
» A New DNA Implementation of Finite State Machines
Sort
View
ITCC
2003
IEEE
14 years 1 months ago
Fast Prefix Code Processing
As large main memory becomes more and more available at reasonable prices, processing speed of large data sets becomes more important than reducing main memory usage of internal d...
Renato Pajarola
INTERACT
2003
13 years 9 months ago
Designing and Prototyping Multimodal Commands
Abstract: Designing and implementing multimodal applications that take advantage of several recognitionbased interaction techniques (e.g. speech and gesture recognition) is a diffi...
Marie-Luce Bourguet
ASE
2005
137views more  ASE 2005»
13 years 7 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund
ACSAC
2007
IEEE
14 years 2 months ago
Extending the Java Virtual Machine to Enforce Fine-Grained Security Policies in Mobile Devices
The growth of the applications and services market for mobile devices is currently slowed down by the lack of a flexible and reliable security infrastructure. The development and...
Iulia Ion, Boris Dragovic, Bruno Crispo
FSTTCS
2007
Springer
14 years 1 months ago
Synthesis of Safe Message-Passing Systems
We show that any regular set of basic MSCs can be implemented by a deadlock-free communicating finite-state machine with local termination: Processes stop in local dead-states ind...
Nicolas Baudru, Rémi Morin