Sciweavers

60 search results - page 4 / 12
» Information Hiding in Finite State Machine
Sort
View
ACSW
2004
13 years 7 months ago
A Framework for Obfuscated Interpretation
Software protection via obscurity is now considered fundamental for securing software systems. This paper proposes a framework for obfuscating the program interpretation instead o...
Akito Monden, Antoine Monsifrot, Clark D. Thombors...
IHM
2004
ACM
13 years 11 months ago
Couplage de ressources d'interaction
Although coupling interaction resources is key to ubiquitous computing, this notion has been overlooked in previous studies. In this paper, we address this notion in a more system...
Nicolas Barralon, Christophe Lachenal, Joëlle...
ADC
2004
Springer
106views Database» more  ADC 2004»
13 years 11 months ago
Customizing Internal Activity Behaviour for Flexible Process Enforcement
Workflow technology has met with success in a variety of industries, although several limitations have emerged. One such drawback is the inflexibility of specification languages, ...
Belinda M. Carter, Joe Y.-C. Lin, Maria E. Orlowsk...
ISCIS
2009
Springer
14 years 25 days ago
Using a SAT solver to generate checking sequences
—Methods for software testing based on Finite State Machines (FSMs) have been researched since the early 60’s. Many of these methods are about generating a checking sequence fr...
Guy-Vincent Jourdan, Hasan Ural, Hüsnü Y...
ISLPED
1997
ACM
104views Hardware» more  ISLPED 1997»
13 years 9 months ago
Composite sequence compaction for finite-state machines using block entropy and high-order Markov models
- The objective of this paper is to provide an effective technique for accurate modeling of the external input sequences that affect the behavior of Finite State Machines (FSMs). B...
Radu Marculescu, Diana Marculescu, Massoud Pedram